International Business Machines Corporation

Bruce E Naylor

Betty J Patterson

Sandra L Stoob

Janna L Mansker

Judy Y Tse

George S Denny

Richard G Hannan

Jim W Bahls

Anu V Vakkalagadda

Anuradha V Vakkalagadda

Karen D Paffendorf

James W Bahls

Jack Chiu-Chiu Yuan

Steve T Kuo

Jeffrey N Stevens

Harrison Scofield

Richard L Stone

Kenneth Edward Davies

Richard Dale Housh

Alexander T Maluta

Gerald LeRoy Carpenter

Walter C Geddes

Mark J Kline

A computer program product and system are disclosed for deferring the deletion of resource control blocks from a resource queue within an information management system that includes a plurality of short-term processes and a plurality of long-term processes when each of the long term processes has unset a 'resource in use' control flag for that long term process, a 'request deletion' flag has been set by the information management system, and a predetermined amount of time has elapsed.

Computer program product and system for deferring the deletion of control blocks

A method, computer program product, and system for dynamically refreshing software modules within an actively running computer system is provided. An existing module or multiple modules (recognizable units of executable code) is ready for execution in an active computer system. New modules corresponding in function to the existing modules are loaded into the computer system memory for the purpose of updating the existing modules. The new modules are prepared for execution by pointing to corresponding state data currently being used by the existing modules and otherwise made ready to take over execution. A lock is held on execution exclusively be the refreshing process for a relatively brief moment in order to switch access from the call point or call references from the existing modules to the new modules. The lock is released now allowing execution of the new modules with the existing data thus accomplishing the update or refresh of the modules. Finally, the previous or &ldquo;old&rdquo; modules are removed from memory.

Method, computer program product, and system for dynamically refreshing software modules within an actively running computer system

A method, apparatus, and article of manufacture for accessing a database management system. An application programming interface (API) provides a plurality of simplified procedures that allow an application program executed by the computer to access a database management system (DBMS) by creating an authorized connection between the application program and the DBMS. The application program invokes the simplified procedures of the API, the invoked procedures generate at least one supervisor call (SVC) interrupt that transfers control to an SVC Service Routine, and the SVC Service Routine connects to a Cross Coupling Facility (XCF) that interfaces to an Open Transaction Manager Access (OTMA) component of the DBMS.

Application programming interface for creating authorized connections to a database management system

A shared queue is provided to allow any of a plurality of systems to process messages received by clients of a data processing environment. A received message is enqueued onto the shared queue. Any of the plurality of systems having available processing capacity can retrieve the message from the shared queue and process the message. A response to the message, where appropriate, is enqueued onto the shared queue for delivery back to the client. A unique list structure is provided to implement the queue. The list structure is comprised of a plurality of sublists, or queue types. Each queue type is divided into a plurality of list headers. List entries, containing data from the received messages, are chained off of the list headers. A common queue server is used to interface to the queue and to store messages thereon. The common queue server stores message data in storage buffers, and then transfers this data to the list entries. Thus, common queue server coordinates the enqueuing of data onto the shared queue.

Computer program product for a shared queue structure for data integrity

Shared queue structure for data integrity

A computer program product comprising a computer useable medium having computer program logic recorded on it for enabling a processor in a computer system to interact with a shared storage medium comprising a ready queue is described and a staging queue. The computer program logic enables the processor to determine whether a data object is larger than available storage capacity of a working storage associated with an application. A public key is associated with the data object and is available to all applications. If it is determined that the data object is larger than available storage capacity of the working storage, then the computer program product enables the processor to generate a private key for the data object, enables the processor to divide the data object into N segments, enables the processor to cause segments 2 through N of the data object to be stored in the staging queue via the working storage (the private key is also stored with each of the segments 2 through N in the staging queue), and enables the processor to cause segment 1 of the data object, the public key, and the private key to be stored in the ready queue. The private key becomes available to all applications once stored in the ready queue.

Computer program product for queuing and retrieving data objects to and

A system and method for interacting with a shared storage medium comprising a ready queue and a staging queue is described. To store a data object, whether the data object is larger than available storage capacity of a working storage associated with an application is first determined. If the data object is larger than available storage capacity of the working storage, then a private key for the data object is generated. The application then divides the data object into N segments, and causes segments 2 through N to be stored in the staging queue via the working storage. The private key is stored with each of segments 2 through N in the staging queue. Then, the application causes segment 1 of the data object, the public key, and the private key to be stored in the ready queue. To retrieve a data object, an application causes a record having a public key stored therein to be retrieved from the ready queue. Stored in the record are at least a portion of a data object and a private key. The application determines whether any segments of the data object are stored on the staging queue. If one or more segments of the data object are stored on the staging queue, then the application causes any records having the private key stored within them to be retrieved from the staging queue in the order in which the records were stored on the staging queue.

System and method for queuing an retrieving data objects to and from a

Described herein is a computer program product comprising a computer useable medium having computer program logic recorded thereon for enabling a processor in a computer system to manage a plurality of data structures stored in a computer storage medium. The computer storage medium includes a primary storage medium and an overflow storage medium. The computer program logic enables the processor to receive a request to store a data object in a target data structure, and enables the processor to determine whether an overflow mode condition currently exists. If it is determined that an overflow mode condition does not currently exist, then the computer program product enables the processor to determine whether a combined size of all data structures stored in the primary storage medium plus a size of the data object is greater than a predetermined threshold. If it is determined that a combined size of all data structures stored in the primary storage medium plus a size of the data object is greater than a predetermined threshold, then the computer program product enables the processor to enter an overflow mode such that an overflow mode condition exists. Once in the overflow mode, the computer program product enables the processor to select one or more data structures currently stored in the primary storage medium, and enables the processor to move the selected data structures from the primary storage medium to the overflow storage medium.

Computer program product for overflow queue processing

An expert system is provided which can be accessed by other application programs operating within any of the available operating environments in a general purpose computer system. In this architecture, an expert system consultation subsystem provides the means for performing expert consultations. Included within the expert system subsystem is a task manager which initiates and manages a plurality of concurrent consultations. Interface programming provides the capability for the expert system consultation subsystem to communicate and pass data and commands between it and other application programs operating within the computer system. Further, means are provided to allow the expert system subsystem to access data stored on database management systems.

Expert system architecture

Growing community of inventors

Morgan Hill, CA, United States of America

Bruce E Naylor