Patents by Inventor Mark F. Wilding

Mark F. Wilding has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7206975
    Abstract: A method and system for monitoring and maintaining a primary service, its associated services and requisite system resources on a computer system. The system includes a fault monitor component and a system monitor component. The fault monitor component monitors and maintains the availability of the primary service, its associated services and the system monitor component. The system monitor component monitors and maintains the availability of the system resources. In the event of a fault in the primary service, its associated service or the system monitor component, the fault monitor component may notify an administrator, restart the service or take other corrective action. The operation of the fault monitor component is ensured through the operating system which will restart the fault monitor component in the event of a failure.
    Type: Grant
    Filed: December 6, 2002
    Date of Patent: April 17, 2007
    Assignee: International Business Machines Corporation
    Inventor: Mark F. Wilding
  • Patent number: 7181585
    Abstract: A data structure, method and system are provided incorporating a general purpose memory allocator and defensive heap memory manager. This provides an ability to reliably detect various types of memory errors, dynamically enable or disable memory debugging, enhance success of read and write operations using various memory verification techniques. Further, through separation of control information associated with allocated and free chunks of memory from the chunks themselves (separation of metadata from actual data), enhanced protection of vital information about the heap memory layout in general is provided. The heap memory manager uses read, write, and execute protected heap header walls and pool header walls and may, for each pool and memory block, separately use hidden front and back Memory Debug Information Areas (MDIAs) with checksums and well-known signature fields thereby enhancing overall memory management.
    Type: Grant
    Filed: April 30, 2003
    Date of Patent: February 20, 2007
    Assignee: International Business Machines Corporation
    Inventors: Alexander Abrashkevich, Mark F. Wilding
  • Patent number: 7080228
    Abstract: A reservation system for making reservations in a shared memory buffer to store information from applications is logically partitioned in a number of fixed size indexed contiguous slots. The reservation system uses an atomic counter that is stored in the shared memory buffer. The value of the atomic counter can be associated with the index of a slot available for reservation. An application making a reservation increases the atomic counter value on a number of reserved slots to provide a value that is associated with the index of the next slot available for reservation. After the reservation is accomplished, the information is written into the reserved slots. The reservation system writes parsing information for further parsing to validate information in the shared memory buffer. The reservation system provides functionality for continuous and instantaneous dumping of the shared memory buffer into a file for cleaning and for wrapping the buffer.
    Type: Grant
    Filed: April 29, 2003
    Date of Patent: July 18, 2006
    Assignee: International Business Machines Corporation
    Inventors: Matthew Albert Huras, David C. Kalmuk, John P. Kennedy, Herbert W. Pereyra, Mark F. Wilding
  • Patent number: 7069470
    Abstract: A method and system for intelligent trap analysis for debugging software on a computer system. Instead of dumping only a register context snapshot or all of memory to a file, a trap handler determines a likely cause of a trapped instruction and selects relevant memory addresses for copying to a file. The relevant memory addresses and their contents are preserved for later analysis. The trap handler may step back through the process instruction list searching for relevant memory addresses referenced by the instructions preceding the trapped instruction. The module may undo the effect of instructions as it steps back through the instruction list.
    Type: Grant
    Filed: September 26, 2002
    Date of Patent: June 27, 2006
    Assignee: International Business Machines Corporation
    Inventors: Mark F. Wilding, Alexandra G. Bialek, Yung Chung
  • Patent number: 6976107
    Abstract: An adaptive spin latch system is provided for use in a multiprocessor computer system. The spin latch system includes a run queue, a spin latch module and a wait queue. The run queue is adapted to store agent index data correlated to at least one agent in run mode. The spin latch module is adapted to put the at least one agent into sleep mode for a period of time correlated to a number of agents awaiting access to a resource. The wait queue is adapted to store agent index data correlated to the at least one agent in sleep mode. A method of regulating access by agents to a resource in a multiprocessor computing system is also provided.
    Type: Grant
    Filed: September 12, 2002
    Date of Patent: December 13, 2005
    Assignee: International Business Machines Corporation
    Inventors: Joseph Serge Limoges, Dominique J. Evans, Dale J. Hagen, Matthew A. Huras, Stephen A. Schormann, Mark F. Wilding
  • Publication number: 20040221120
    Abstract: A data structure, method and system are provided incorporating a general purpose memory allocator and defensive heap memory manager. This provides an ability to reliably detect various types of memory errors, dynamically enable or disable memory debugging, enhance success of read and write operations using various memory verification techniques. Further, through separation of control information associated with allocated and free chunks of memory from the chunks themselves (separation of metadata from actual data), enhanced protection of vital information about the heap memory layout in general is provided. The heap memory manager uses read, write, and execute protected heap header walls and pool header walls and may, for each pool and memory block, separately use hidden front and back Memory Debug Information Areas (MDIAs) with checksums and well-known signature fields thereby enhancing overall memory management.
    Type: Application
    Filed: April 30, 2003
    Publication date: November 4, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Alexander Abrashkevich, Mark F. Wilding
  • Publication number: 20040181635
    Abstract: A reservation system for making reservations in a shared memory buffer to store information from applications is logically partitioned in a number of fixed size indexed contiguous slots. The reservation system uses an atomic counter that is stored in the shared memory buffer. The value of the atomic counter can be associated with the index of a slot available for reservation. An application making a reservation increases the atomic counter value on a number of reserved slots to provide a value that is associated with the index of the next slot available for reservation. After the reservation is accomplished, the information is written into the reserved slots. The reservation system writes parsing information for further parsing to validate information in the shared memory buffer. The reservation system provides functionality for continuous and instantaneous dumping of the shared memory buffer into a file for cleaning and for wrapping the buffer.
    Type: Application
    Filed: April 29, 2003
    Publication date: September 16, 2004
    Applicant: International Business Machines Corporation
    Inventors: Matthew Albert Huras, David C. Kalmuk, John P. Kennedy, Hebert W. Pereyra, Mark F. Wilding
  • Publication number: 20040158824
    Abstract: The present invention provides a complier and linker for analyzing the structures of complex data stored in memory when a print statement specified in source code refers to those complex data structures, and then generating executable code which will print the complex data when a data processing system executes the executable code.
    Type: Application
    Filed: April 29, 2003
    Publication date: August 12, 2004
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Edward Van Gennip, Mark F. Wilding, Daniel A. Wood
  • Publication number: 20030212788
    Abstract: A generic control interface for creating a control module for a service. The interface includes a facility that encapsulates the specific control commands or actions for the service in generic functions. A control module inherits or incorporates the generic functions and provides an interface between a specific service and the controlling product, thereby enabling the controlling product to control a specific service using generic functions. The functions may include a multi-level status check function, a health probe function and a customizable control or request function. The multi-level status check function assess the service's operability, aliveness and availability. A controlling product can control or monitor the service through the service's associated control module without requiring a detailed understanding of the specific operations necessary for controlling or monitoring the specific service.
    Type: Application
    Filed: March 27, 2003
    Publication date: November 13, 2003
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mark F. Wilding, Steven Raspudic
  • Publication number: 20030204778
    Abstract: A method and system for intelligent trap analysis for debugging software on a computer system. Instead of dumping only a register context snapshot or all of memory to a file, a trap handler determines a likely cause of a trapped instruction and selects relevant memory addresses for copying to a file. The relevant memory addresses and their contents are preserved for later analysis. The trap handler may step back through the process instruction list searching for relevant memory addresses referenced by the instructions preceding the trapped instruction. The module may undo the effect of instructions as it steps back through the instruction list.
    Type: Application
    Filed: September 26, 2002
    Publication date: October 30, 2003
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mark F. Wilding, Alexandra G. Bialek, Yung Chung
  • Publication number: 20030204715
    Abstract: A system, method and facility for manipulating registries on a computer system. The system includes a generic registry facility, which features functions classified according to the breadth of their applicability to varying types of registries. The registries may be classified as file-based and proprietary. The file-based registries may be binary or text-based. The generic registry facility provides a library of generic registry facility functions that may be included in a specific registry manipulation module through which a computer program can manipulate a specific registry. The generic registry facility functions may be customized by the developer of the registry manipulation module for a specific registry. The functions may include an action verification function that includes a commit sequence for ensuring that requested changes to a registry are made successfully. The functions may also include a trigger function for triggering events upon the occurrence of a change to a registry.
    Type: Application
    Filed: April 25, 2003
    Publication date: October 30, 2003
    Inventors: Daniel D. Behman, Mark F. Wilding
  • Publication number: 20030196015
    Abstract: An adaptive spin latch system is provided for use in a multiprocessor computer system. The spin latch system includes a run queue, a spin latch module and a wait queue. The run queue is adapted to store agent index data correlated to at least one agent in run mode. The spin latch module is adapted to put the at least one agent into sleep mode for a period of time correlated to a number of agents awaiting access to a resource. The wait queue is adapted to store agent index data correlated to the at least one agent in sleep mode. A method of regulating access by agents to a resource in a multiprocessor computing system is also provided.
    Type: Application
    Filed: September 12, 2002
    Publication date: October 16, 2003
    Applicant: International Business Machines Corporation
    Inventors: Joseph Serge Limoges, Dominique J. Evans, Dale J. Hagen, Matthew A. Huras, Stephen A. Schormann, Mark F. Wilding
  • Publication number: 20030182264
    Abstract: distributed database management system implemented on a cluster of computers. The cluster including disks organized as data nodes. The data nodes being locally connected to one or more computers in the cluster. The distributed database management system includes a distributed database manager layer having a lock manager, a resource manager, and an architecture manager. The lock manager serializes access to the data nodes in the cluster. The resource manager maintains a data representation of the resources of each computer in the cluster and makes the data available to other computers in the cluster to facilitate access to the resources by the other computers. The architecture manager defines logical ownership relationships between data nodes and computers in the cluster to permit the architecture of the database to be dynamically reconfigured to provide improved performance.
    Type: Application
    Filed: March 17, 2003
    Publication date: September 25, 2003
    Inventors: Mark F. Wilding, Matthew A. Huras
  • Publication number: 20030135619
    Abstract: A dynamic status tree facility for providing status information about one or more systems. The facility includes a tree data structure and methods for manipulating the data structure. The facility is accessible to provider processes using a set of provider interface methods. The facility is accessible to consumer processes using a set of consumer interface methods. The tree data structure is defined by nodes stored in shared memory and attached to by way of a defined data structure made available to the provider and consumer interface methods. The nodes in the tree data structure are defined to have a control block and a variable set of export data. The export data for any one node is specified by a variable in the control block. Certain of the exported data in the tree is representable in a format selected to have one of four defined properties. A set of tags are defined for the identification of nodes and export information in the tree data structure.
    Type: Application
    Filed: July 15, 2002
    Publication date: July 17, 2003
    Inventors: Mark F. Wilding, Alexander Abrashkevich