Sandra L Stoob

8087027, Dec 27, 2011

Mar 29, 2007

11/693570

Janna Lynn Mansker - San Jose CA, US
Betty Joan Patterson - Hollister CA, US
Bruce Eric Naylor - Morgan Hill CA, US
Sandra Lee Stoob - Morgan Hill CA, US

International Business Machines Corporation - Armonk NY

G06F 9/46
G06F 12/00
G06F 17/30

718104, 707813

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.

57065128, Jan 6, 1998

Jul 28, 1995

8/508547

Jim W. Bahls - Pleasanton CA
George S. Denny - San Jose CA
Richard G. Hannan - San Jose CA
Janna L. Mansker - San Jose CA
Bruce E. Naylor - Morgan Hill CA
Betty J. Patterson - San Jose CA
Sandra L. Stoob - Morgan Hill CA
Judy Y. Tse - San Francisco CA
Anuradha V. Vakkalagadda - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

395621

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.

57065136, Jan 6, 1998

Jul 28, 1995

8/508826

Jim W. Bahls - Pleasanton CA
George S. Denny - San Jose CA
Richard G. Hannan - San Jose CA
Janna L. Mansker - San Jose CA
Bruce E. Naylor - Morgan Hill CA
Betty J. Patterson - San Jose CA
Sandra L. Stoob - Morgan Hill CA
Judy Y. Tse - San Francisco CA
Anu V. Vakkalagadda - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1730

395621

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.

56921560, Nov 25, 1997

Jul 28, 1995

8/508911

Jim W. Bahls - Pleasanton CA
George S. Denny - San Jose CA
Richard G. Hannan - San Jose CA
Janna L. Mansker - San Jose CA
Bruce E. Naylor - Morgan Hill CA
Betty J. Patterson - San Jose CA
Sandra L. Stoob - Morgan Hill CA
Judy Y. Tse - San Francisco CA
Anuradha V. Vakkalagadda - San Jose CA

International Business Machines Corp. - Armonk NY

G06F 1200
G06F 1212
G06F 1300

395492

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.

58871683, Mar 23, 1999

Jun 2, 1995

8/460749

James W. Bahls - Pleasanton CA
George S. Denny - San Jose CA
Richard G. Hannan - San Jose CA
Janna L. Mansker - San Jose CA
Bruce E. Naylor - Morgan Hill CA
Karen D. Paffendorf - East Brunswick NJ
Betty J. Patterson - San Jose CA
Sandra L. Stoob - Morgan Hill CA
Judy Y. Tse - San Francisco CA
Anu V. Vakkalagadda - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 1130

395680

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.

57970050, Aug 18, 1998

Dec 30, 1994

8/366554

James W. Bahls - Pleasanton CA
George S. Denny - San Jose CA
Richard G. Hannan - San Jose CA
Janna L. Mansker - San Jose CA
Bruce E. Naylor - Morgan Hill CA
Karen D. Paffendorf - East Brunswick NJ
Betty J. Patterson - San Jose CA
Sandra L. Stoob - Morgan Hill CA
Judy Y. Tse - San Francisco CA
Anu V. Vakkalagadda - San Jose CA

International Business Machines Corporation - Armonk NY

G06F 15163
G06F 900

395680

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.