Abstract: A deterministic flushing of one or more storage data objects buffered within a storage data buffer to a storage medium involves a processing of a host data object including writing a storage data object corresponding to the host data object to the storage data buffer, and a flushing of the storage data object(s) buffered within the storage data buffer to the storage medium prior to or subsequent to (i.e., relative to) the writing of the storage data object corresponding to the host data object to the storage data buffer as a function of an occurrence determination of a storage data buffer flushing event. The deterministic flushing further involves a queuing of a host data buffer meta-data update request for later processing.

Abstract: A system and method for generating a key list structure forming a queue of users' work flow requests in a queuing system such that many requests from a single user will not prevent processing of requests from other users in the queuing system. The key list structure comprises keys associated with users' work flow requests, each key indicating a priority level associated with a request, a user identification (User ID) associated with a requestor, and, an assigned user priority value (UPV). The method assigns UPVs to user requests in a manner such that user request entries become interleaved in the key list structure to prevent a single user from dominating the request processing.

Abstract: A system and method for generating a key list structure forming a queue of users' work flow requests in a queuing system such that many requests from a single user will not prevent processing of requests from other users in said queuing system. The key list structure comprising keys associated with users' work flow requests, each key indicating a priority level associated with a request, a user identification (User ID) associated with a requester, and, an assigned user priority value (UPV). The method assigns UPVs to user requests in a manner such that user request entries become interleaved in the key list structure to prevent starvation of any user's request.

Abstract: A queue management system and a method of managing a queue. The queue management system includes primary and secondary queues for storing messages, and a processor for determining on which queue to place received messages. This processor means includes (i) means for receiving messages, and (ii) means for determining, for each received message, whether the message is logically related, according to a predefined relationship, to one of the messages stored on the primary queue. If the received message is logically related to one of the messages stored on the primary queue, then placing the received message on the secondary queue; and if the received message is not logically related to one of the messages stored on the primary queue, then placing the received message on the primary queue.

Abstract: A multiple processing architecture and a method of managing a work queue of that processing architecture. The multiple processing architecture comprises a plurality of distributed computer systems and a coupling facility. Each of the computer systems has an operating system instance resident thereon and providing at least one application server; and these systems are all connected to the coupling facility by a plurality of links that transmit data between the computer systems and the coupling facility.