Abstract: A method of insuring continuous processing of messages from a Work FIFO in a message passing interface between a requesting module and a receiving module. Each module has access to two queues in the message passing interface, and each queue has a Work FIFO for containing message frames to be processed and a Free FIFO for containing empty message frames. The method includes a step of monitoring the number of free messages in the Free FIFO of the receiving module. When that number falls below a selectable early warning level, the receiving module is alerted. The receiving module then sends an early warning level signal to the requesting module, and additional free messages are posted to the Free FIFO of the receiving module. This posting of additional free messages allows the continued processing, by the receiving module, of messages from the receiving module work FIFO.

Abstract: A data processing system for managing a plurality of objects within said data processing system, the distributed data processing system having an object oriented environment. A container object is created for holding objects and a plurality of objects is detected within the data processing system. A filter object is associated with the container object, wherein the filter object receives the plurality of objects within the data processing system and the filter object passes selected ones of the plurality of objects to the container object. The data processing system is periodically monitored to detect changes in the plurality of objects. The container object is automatically updated using the filter object to pass selected ones of the plurality of objects to the container object in response to monitoring the data processing system, wherein the container object is automatically updated.

Abstract: Methods and associated structure providing a balanced queue communication system for the exchange of messages between an originating node and a receiving node in a distributed computing environment. A balanced queue comprises a pair of wraparound (circular) queues, one each associated with the originating node and the receiving node. A message is queued by the originating node in the queue associated therewith. Background processing within the originating node retrieves message queued therein and transmits the messages to the intended receiving node. The position in the originating node's circular queue is pre-pended to the message and transmitted therewith. The receiving node places the received message in its circular queue in the position specified by the pre-pended location with each message. Background daemon and application processing within the receiving node then retrieves the queued messages for application specific processing.