Interprocess communication queue location transparency

• US 5,133,053 A
• Filed: 02/13/1987
• Issued: 07/21/1992
• Est. Priority Date: 02/13/1987
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Loucks, Larry K., Johnson, Donavon W., Shaheen-Gouda, Amal A.
• Primary Examiner(s): Lee, Thomas C.
• Assistant Examiner(s): MOHAMED, AYNI Y
• Application Number:
  US07/014,888
• Time in Patent Office: 1,985 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 370/85, 370/89, 370/94
• US Class Current: 709/223
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 69/00 Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass networks security protocols H04L9/40; wireless communication networks H04W

Abstract

A system for an efficient message handling technique implemented in AIX, an operating system derived from UNIX System V, is described for use in a distributed services network include a plurality of multi-processing, multi-tasking nodes among which interprocess communication occurs via queues, the actual node locations of which are transparent at the application interface.

Claims

1. A network management system for communication among processes at different nodes in a network executing user applications via key identified message queues at node locations unknown within an application requesting a communication transaction on a target queue comprising:

an address resolution table at each node correlating a first, application supplied node unique target queue key with a second node unique key associated with said target queue; and

routines at each node for accessing said table and constructing a target queue address for use in completing the requested communication transaction, and means for executing said routines to complete the requested communication transaction.

2. The system of claim 1 wherein each address resolution table is predefined by a network administrator.

8. The systems of claims 1, 5 or 6 additionally including:

means for determining whether a message queue location node has experienced a power cycle during a period between returning a message queue identifier to a user application node and the use thereof at said user application node.

12. The system of claim 1 additionally comprising:

means for accepting a user application supplied alpha-numeric queue name and associating therewith a node unique numeric key.

3. A method of communicating among nodes in a network in which each node comprises a processor executing applications able to perform operations on memory resident, key identified message queues at any node in the network comprising:

providing kernel resident predefined, modifiable tables in each column for mapping a first node unique queue key supplied by an application requesting access to a given queue identified by said first key to a second node and node unique queue key indicative of actual location of said given queue; and

utilizing said second node unique queue key in formulating an actual address for accessing said given queue.

7. The methods of claims 3 or 4 additionally including the step of:

determining whether the message queue node has experienced a power cycle during a period between returning a message queue identifier to a node and the use thereof by said node.

10. The methods of claims 3 or 4 including the additional steps of:

associating a unique type value with each queue;

post incrementing said unique type value when an application requests a unique type value; and

using said type value to select a desired message from among a plurality of messages on a message queue.

4. A method of facilitating communication among user applications executing at processors located at one or more nodes in a network, using message queues, actual node locations of which are transparent to the user applications, comprising the steps of:

maintaining in memory at each node a key mapping table correlating node unique queue keys assigned to applications running at each said node with actual queue node location and keys of message queues;

accessing a key mapping table with an application supplied key for obtaining node location and key of a message queue and establishing a communications link between an application node and the message queue node.

5. In a network supporting a plurality of processor nodes for executing user application programs, and enabling access to target queues located at any node from any node,

system means for making target queue node location transparent to user applications comprising:

means for providing to user applications node unique target queue keys;

means at each node for correlating user application target queue keys with target queue location nodes and keys; and

message handling system call routines at each node for reading said means for correlating and establishing links for communicating between said application node and said location target queue node.

6. In a distributed services network including interconnected processors, each located at a different network node, each processor including memory resident system resources and routines for creating and accessing message queues, and each processor being able to execute a plurality of user application programs, wherein communication among processors occurs via message queues located at any node in the network,

a system for making message queue node locations transparent to user application programs comprising:

library routine means callable from each node for assigning node unique keys to each user application program supplied queue name;

table loading means operable at processor startup for providing at each node, a kernel resident mapping table having entries correlating said assigned node unique keys with message queue location nodes and key and

system call routines for accepting a user application program supplied keys, locating a correlated message queue location node, and establishing a communication link between the user application program node and a correlated message queue location node for performing a message operation.

9. A system for handling communication among processes via message queues, located a different node in a multiprocessor network comprising:

means for making node locations of message queues transparent to said processes;

means for providing non-conflicting message queue name assignment within said network; and

means for demultiplexing a plurality of reply messages on a given message queue.

11. The system of claim 9 wherein said demultiplexing means includes:

means for associating a unique type value with each queue;

means for post incrementing said unique type value when an application requests a user type value; and

means using said type value for selecting a desired message from among a plurality of messages on a message queue.