Method of indicating processes resident within a cell of a data processing system

• US 4,914,583 A
• Filed: 04/13/1988
• Issued: 04/03/1990
• Est. Priority Date: 04/13/1988
• Status: Expired due to Fees

• Current Assignee: Motorola Computer Group (Motorola Solutions, Inc.)
• Original Assignee: Motorola, Inc. (Motorola Solutions, Inc.)
• Inventors: Barnea, Michael, Weisshaar, Bernhard P.
• Primary Examiner(s): Shaw, Gareth D.
• Assistant Examiner(s): Chum, Debra A.
• Application Number:
  US07/181,024
• Time in Patent Office: 720 Days
• Field of Search: 364/200 MS File, 364/ 900 MS File, 340/825.07, 340/825.52, 370/94
• US Class Current: 719/313
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]

Abstract

A multi-processor, multi-tasking virtual machine comprises processes, messages, and contexts. Processes communicate only through messages. Contexts are groups of related processes. The virtual machine is implemented in a distributed data processing system comprising a plurality of individual cells coupled by a local area network (LAN). Each cell may comprise one or more processes and/or contexts.

A network interface module (NIM) provides the interface between any individual cell and the LAN. To facilitate message transmission between processes resident on different cells, each NIM is provided with tables identifying the locations of resident and non-resident processes, respectively. Cells may be added to or deleted from the LAN without disrupting the LAN operations.

Claims

1. In a distributed data processing system comprising a plurality of individual cells, a method of determining whether a given process is resident within one of said cells, said method comprising the steps of:

(a) providing in each of said plurality of cells a table of resident processes, said table comprising the names of processes resident within said cell;

(b) sending a discovery message from a first cell to a second cell, said discovery message comprising the name of said given process and the location of said first cell; and

(c) determining whether the table of resident processes for said second cell contains the name of said given process;

(i) if said given process is resident within said second cell, informing said first cell of the location of said second cell; and

(ii) if said process is not resident within said second cell, sending said discovery message to successive different cells in said system, until one cell'"'"'s table of resident processes contains the name of said given process, in which case said first cell is informed of the location of said one cell, or until said discovery message has been received by all other cells in the system without finding the name of said given process in any table of resident processes, in which case said first cell is informed that said given process is not located in any cell of said system.

2. The method recited in claim 1, wherein in steps (c)(i) and (c)(ii) said first cell is informed of the location of said second cell or said one cell, respectively, by the steps of:

(d) generating a discovery response message, said discovery response message comprising the name of said given process and the location of said second cell or said one cell, respectively; and

(e) sending said discovery response message to said first cell.

3. In a distributed data processing system comprising a plurality of individual cells, a method of

indicating the process resident within one of said cells, and of

notifying the remainder of said plurality of individual cells of changes in the number of processes resident within said one cell, said method comprising the steps of:

(a) providing in said one cell a table of resident processes, each entry in said table comprising a first portion corresponding to the name of a process which is resident within said one cell;

(b) when a process is created in said one cell whose name is not currently contained with said table of resident processes, making a new entry in said table of resident processes corresponding to said newly created process;

(c) generating a notification message comprising the name of said newly created process and the location of said one cell; and

(d) sending said notification message to a next cell.

4. The method recited in claim 3, and further comprising the step of:

(e) determining whether said next cell contains the name of said newly created process.

5. The method recited in claim 3, and further comprising the step of:

(e) repeating step (d) until each cell in said system has received said notification message.

6. The method recited in claim 5, and further comprising the step of:

(f) determining whether each cell contains the name of said newly created process.

7. The method recited in claim 3, and further comprising the steps of:

(e) providing each entry in said table or resident processes with a second portion corresponding to the number of processes having the same name which are resident in said one cell; and

(f) incrementing said second portion of the appropriate table entry every time a process is created in said one cell whose name is the same as that contained in the first portion of said table entry.

8. The method of indicating resident processes as recited in claim 7, and further comprising the steps of:

(d) decrementing said second portion of the appropriate table entry every time a process is deleted in said one cell whose name is the same as that contained in the first portion of said table entry, and

(e) deleting said table entry when said second portion of said table entry reaches a count of zero.

9. The method recited in claim 3, wherein said next cell comprises a table of non-resident processes, and further comprises the step of:

(e) using the contents of said notification message, comparing the name of said newly created process with said table of non-resident processes to determine whether the name of said newly created process is contained within said table of non-resident processes.

10. The method recited in claim 9, and further comprising the step of:

(f) repeating step (d) until each cell in said system has received said notification message.

11. The method recited in claim 9, wherein each entry of said table of non-resident processes comprises a first portion containing the name of a process which is resident in a cell other than said next cell and a second portion containing the location of said process, and wherein if the name of said newly created process is contained within said table of non-resident processes, the location of said newly created process is substituted for the location currently stored in said table of non-resident processes corresponding to said newly created process only if said next cell is closer within said system to said one cell than the cell whose location is currently stored for said newly created process in said table of non-resident processes.

12. The method recited in claim 11, and further comprising the step of:

(f) repeating step (d) until each cell in said system has received said notification message.