A multi-processor, multi-tasking virtual machine comprises processes, messages, and contexts. processes communicate only through messages. processes may be grouped into contexts of related processes. Communication may be made between processes in different or related contexts or at the same context level.
According to one message transmission mode, a message may be sent to each process with a given name within one context, thus ensuring that all processes with the same name at the same context level can be communicated with individually without knowing how many there are or where they are located.
|
10. A method of communicating between processes in a data processing system comprising a plurality of processes grouped into one or more contexts, said method comprising the steps of:
(a) generating a request by a first process in one of said contexts to send a message to any process within said one context having the identical name as said first process, the location of said identically-named process within said context being unknown to said first process; and (b) if said one context contains any identically-named process, sending said message to said identically-named process.
1. A method of communicating between processes in a data processing system comprising a plurality of processes grouped into one or more contexts, said method comprising the steps of:
(a) providing each context with a table identifying the location of each of its constituent processes; (b) generating a request by a first process in one of said contexts to send a message to any process within said one context having the identical name as said first process, the location of said identically-named process within said context being unknown to said first process; (c) searching the table of said one context to determine whether any other identically-named process is located within said one context; and (d) if said one context contains any identically-named process, sending said message to said identically-named process.
5. A data processing system comprising:
at least one processor, a plurality of processes resident in at least one memory store, related ones of said processes being grouped into one or more contexts, and means for communicating between said processes, said means comprising: storage means associated with each context for identifying the location of each of its constituent processes; means for generating a request by a first process in one of said contexts to send a message to any process within said one context having the identical name as said first process, the location of said identically-named process within said context being unknown to said first process; means for searching the storage means associated with said one context and indicating whether any identically-named process is located within said one context; and means response to said indicating means for sending said message to said identically-named process. 2. A method of communicating between processes in a data processing system comprising a plurality of processes grouped into one or more contexts, said method comprising the steps of:
(a) providing each context with a context process for providing access to the processes within said context; (b) providing each context process with a table identifying the location of each of its constituent processes; (c) generating a request by a first process in one of said contexts to send a message to any process within said one context having the identical name as said first process, the location of said identically-named process within said context being unknown to said first process; and (d) searching the table of the context process of said one context to determine whether said one context contains an identically-named process and, if so, sending said message to said identically-named process from the process which most recently received said message and identifying said identically-named process as having received said message.
7. A data processing system comprising:
at least one processor, a plurality of processes resident in at least one memory store, related ones of said processes being grouped into one or more contexts, each context having associated therewith a context process for providing access to the processes within said context, and means for communicating between said processes, said means comprising: storage means associated with each context process for identifying the location of each of its constituent processes; means for generating a requires by a first process in one of said contexts to send a message to any process within said one context having the identical name as said first process, the location of said identically-named process within said context being unknown to said first process; means for searching the storage means of the context process associated with said one context and indicating whether any identically-named process is located within said one context; and means responsive to said indicting means for sending said message to said identically-named process. 3. The method of communicating between processes recited in
(e) repeating step (d) until all identically-named processes in said one context have received said message, including said first process.
4. The method of communicating between processes recited in
6. The data processing system recited in
8. The data processing system recited in
control means responsive to said searching means and to said sending means for causing them to repetitively search for any identically-named process located within said one context which has not received said message and, if found, to send said message to it, until said message has been sent to all identically-named processes within said one context, including said first process.
9. The data processing system recited in
11. The method of communicating between processes recited in
(c) determining whether said one context contains an identically-named process which has not received said message, and, if so, sending said message to said identically-named process from the process which most recently received said message.
12. The method of communicating between processes recited in
(d) repeating step (c) until it is determined that all identically-named processes in said one context have received the message, including said first process.
13. The method of communicating between processes recited in
|
|||||||||||||||||||||||||||||||||||||||||||||||||||
This application is a continuation of application Ser. No. 730,923, filed 05/06/85, now abandoned.
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
The present invention is related to the following inventions, filed on even date herewith, all assigned to the assignee of the present invention:
1. Title: Nested Contexts in a Virtual Single Machine
Inventor: Andrew Kun
Ser. No.: 730,903
6. Title: Computer System With Data Residence Transparency and Data Access Transparency
Inventors: Bruce Mansfield, Frank Kolnick, and Andrew Kun
Ser. No.: 730,929
7. Network Interface Module With Minimized Data Paths
Inventors: Bernard Weisshaar and Michael Barnea
Ser. No.: 730,621 now U.S. Pat. No. 4,754,395
8. Title: Method of Inter-Process Communication in a Distributed Data Processing System
Inventors: Brude Weisshaar, Frank Kolnick, Andrew Kun, and Bruce Mansfield
Ser. No.: 730,892 now U.S. Pat. No. 4,694,396
9. Title: Virtual Single Machine With Message-Like Hardware Interrupts and Processor Exceptions
Inventors: Andrew Kun, Frank Kolnick, and Bruce Mansfield
Ser. No.: 730,922
This invention relates generally to digital data processing, and, in particular, to an operating system facilitating the transmission of messages among processes.
The present invention is implemented in a distributed data processing system--that is, two or more data processing systems which are capable of functioning independently but which are so coupled as to send and receive messages to and from one another.
A Local Area Network (LAN) is an example of a distributed data processing system. A typical LAN comprises a number of autonomous data processing "cells", each comprising at least a processor and memory. Each cell is capable of conducting data processing operations independently. In addition, each cell is coupled (by appropriate means such as a twisted wire pair, coaxial cable, fiber optic cable, etc.) to a network of other cells which may be, for example, a loop, star, tree, etc., depending upon the design considerations.
As mentioned above, the present invention finds utility in such a distributed data processing system, since there is a need in such a system for processes which are executing or which are to be executed in the individual cells to share data and to communicate data among themselves.
A "process", as used within the present invention, is defined as a self-contained package of data and executable procedures which operate on that data, comparable to a "task" in other known systems. Within the present invention a process can be thought of as comparable to a subroutine in terms of size, complexity, and the way it is used. The difference between processes and subroutines is that processes can be created and destroyed dynamically and can execute concurrently with their creator and other "subroutines".
Within a process, as used in the present invention, the data is totally private and cannot be accessed from the outside, i.e., by other processes. Processes can therefore by used to implement "objects", "modules", or other higher-level data abstractions. Each process executes sequentially. Concurrently is achieved through multiple processes, possibly executing on multiple processors.
Every process in the distributed data processing system of the present invention has a unique identifier (PID) by which it can be referenced. The PID is assigned by the system when the process is created, and it is used by the system to physically locate the process.
Every process also has a non-unique, symbolic "name", which is a variable-length string of characters. In general, the name of a process is known system-wide. To restrict the scope of names, the present invention utilizes the concept of a "context".
A "context" is simply a collection of related processes whose names are not known outside of the context. Contexts partition the name space into smaller, more manageable subsystems. They also "hide" names, ensuring that processes contained n them do not unintentionally conflict with those in other contexts.
A process in one context cannot explicitly communicate with, and does not known about, processes inside other contexts. All interaction across context boundaries must be through a "context process", thus providing a degree of security. The context process often acts as a switchboard for incoming messages, rerouting them to the appropriate sub-processes in its context.
A context process behaves like any other process and additionally has the property that any processes which it creates are known only to itself and to each other. Creation of the process constitutes definition of a new context with the same name as the process.
Any process can create context processes. Each new context thus defined is completely contained inside the context in which it was created and therefore is shielded from outside reference. This "nesting" allows the name space to be structured hierarchically to any desired depth.
Conceptually, the highest level in the hierarchy is the system itself, which encompasses all contexts. Nesting is used in top-down design to break a system into components or "layers", where each layer is more detailed than the preceding one. This is analogous to breaking a task down into subroutines, and in fact many applications which are single tasks on known systems may translate to multiple processes in nested contexts.
A "message" is a buffer containing data which tells a process what to do and/or supplies it with information it needs to carry out its operation. Each message buffer can have a different length (up to 64 kilobytes). By convention, the first field in the message buffer defines the type of message (e.g., "read", "print", "status", "event", etc.).
Messages are queued from one process to another by name of PID. Queuing avoids potential synchronization problems and is used instead of semaphores, monitors, etc. The sender of a message is free to continue after the message is sent. When the receiver attempts to get a message, it will be suspended until one arrives if none are already waiting in its queue. Optionally, the sender can specify that it wants to wait for a reply and is suspended until that specific message arrives. Messages from any other source are not dequeued until after that happens.
Within the present invention, messages are the only way for two processes to exchange data. There is no concept of a "global variable". Shared memory areas are not allowed, other than through processes which essentially "manage" each area by means of messages. Messages are also the only form of dynamic memory that the system handles. A request to allocate memory therefore returns a block of memory which can be used locally by the process but can also be transmitted to another process.
Messages provide the mechanism by which hardware transparency is achieved. A process located anywhere in the system may send a message to any other process anywhere else in the system (even on another processor) if it knows the process name. This means that processes can be dynamically distributed across the system at any time to gain optimal throughput without changing the processes which reference them. Resolution of destinations is done by searching the process name space. p The context nesting level determines the "scope of reference" when sending messages between processes by name. From a given process, a message may be sent to all processes at its own level (i.e., in the same context) and (optionally) to any arbitrary higher level. The contexts are searched from the current context upward until a match is found. All processes with the given name at that level are then sent a copy of the message. A process may also send a message to itself or to its parent (the context process) without knowing either name explicitly, permitting multiple instances of a process to exist in different contexts, with different names.
Sending messages by PID obviates the need for a name search and ignores context boundaries. This is the most efficient method of communicating.
There is a significant need to be able to provide within a data processing operating system the ability to easily pass messages among processes at the same level and having the same name. While it is known to provide the capability of sending messages between processes, it is presently not known to provide a "universal" message between a first process and all other related processes having the same name, without the first process knowing how many such other processes there are and where they are located.
Accordingly, it is an object of the present invention to provide a data processing system having an improved operating system.
It is also an object of the present invention to provide an improved data processing system having an operating system which allows the easy transmission of messages within related groups of processes, or contexts.
It is another object of the present invention to provide an improved data processing system having an operating system which allows a first process to send a message to one or more other processes, wherein the other processes are related to the first process only through the fact that they share the same context and the same name.
These and other objects are achieved in accordance with a preferred embodiment of the invention by providing a method of communicating between processes in a data processing system comprising a plurality of processes, the method comprising the steps of grouping related processes into one or more contexts, each context having associated therewith a table identifying the location of each of its constituent processes; generating a request by a first process in one of the contexts to send a message to each process within the one context having the identical name, the location and quantity of such other processes within the context being unkown to the first process; searching the table associated with the one context to determine whether any other process is located within the one context having the name; and, if the one context contains one or more other processes having the same name, sending the message to each of the other processes at the locations indicated by the table for the other processes.
The invention is pointed out with particularity in the appended claims. However, other features of the invention will become more apparent and the invention will be best understood by referring to the following detailed description in conjunction with the accompanying drawings in which:
FIG. 1 shows a representational illustration of a single network, distributed data processing system incorporating the improved data management system of the present invention.
FIG. 2 shows a block diagram illustrating a multiple-network, distributed data processing system incorporating the improved data management system of the present invention.
FIG. 3 shows an architectural model of a data processing system incorporating the present invention.
FIG. 4 shows the relationship between software contexts and processes as they relate to the present invention.
FIG. 5 shows the relationship between external events and processes.
FIG. 6 shows how messages may be sent between processes within nested contexts.
FIG. 7 shows an architectural model of the improved data management system incorporating the present invention.
FIG. 8 shows an architectural software model of the improved data management system incorporating the present invention.
FIG. 9 shows the relationship between pictures, views, and windows in the human interface of a data processing system incorporating the present invention.
FIG. 10 shows a conceptual view of the different levels of human interface within a data processing system incorporating the present invention.
FIG. 11 illustrates the relationship between contexts and processes, in terms of process control blocks (PCB's) and process hash tables (PHT's).
FIG. 12 shows a different conceptual representation of the contexts and processes illustrated in FIG. 11.
With reference to FIG. 1, a distributed computer configuration is shown comprising multiple cells 2-7 (nodes) loosely coupled by a local area network (LAN) 1. The number of cells which may be connected to the network is arbitrary and depends upon the user application. Each cell comprises at least a processor and memory, as will be discussed in greater detail with reference to FIG. 12 below. In addition, each cell may also include other units, such as a printer 8, operator display module (ODM) 9, mass memory module 13, and other I/O device 10.
With reference now to FIG. 2, a multiple-network distributed computer configuration is shown. A first local area network LAN 1 comprises several cells 2, 4, and 7. LAN 1 is coupled to a second local area network LAN 2 by means of an Intelligent Communications Module (ICM) 50. The Intelligent Communications Module provides a link between the LAN and other networks and/or remote processors (such as programmable controllers).
LAN 2 may comprise several cells (not shown) and may operate under the same LAN protocol as that of the present invention, or it may operate under any of several commercially available protocols, such as Ethernet; MAP, the Manufacturing Automation Protocol of General Motors Corp.; Systems Network Architecture (SNA) of International Business Machines, Inc.; SECS-II; etc. Each ICM 50 is programmable for carrying out one of the above-mentioned specific protocols. In addition, the basic processing module of the cell itself can be used as an intelligent peripheral controller (IPC) for specialized devices.
LAN 1 is additionally coupled to a third local area network LAN 3 via ICM 52. A process controller 55 is also coupled to LAN 1 via ICM 54.
A representative cell N (7, FIG. 2) comprises a processor 24 which, in a preferred embodiment, is a Motorola 68010 processor. Each cell further includes a read only memory (ROM) 28 and a random access memory (RAM) 26. In addition, each cell includes a Network Interface Module (NIM) 21, which connects the cell to the LAN, and a Bus Interface 29, which couples the cell to additional devices within a cell. While a minimal cell is capable of supporting two peripheral devices, such as an Operator Display Module (ODM) 41 and an I/O Module 44, additional devices (including additional processors, such as processor 27) can be provided within a cell. Other additional devices may comprise, for example, a printer 42, and a mass-storage module 43 which supports a hard disk and back-up device (floppy disk or streaming tape drive).
The Operator Display Module 41 provides a keyboard and screen to enable an operator to input information and receive visual information.
While a single cell may comprise all of the above units, in the typical user application individual cells will normally be dedicated to specialized functions. For example, one or more mass storage cells may be set up to function as data base servers. There may also be several operator consoles and at least one cell for generating hard-copy printed output. Either these same cells, or separate dedicated cells, may execute particular application programs.
The system is particularly designed to provide an integrated solution for factory automation, data acquisition, and other real-time applications. As such, it includes a full complement or services, such as a graphical output, windows, menus, icons, dynamic displays, electronic mail, event recording, and file management. Software development features include compilers, a window-oriented editor, a debugger, and performance-monitoring tools.
The local area network, as depicted in either FIG. 1 or FIG. 2, ties the entire system together and makes possible the distributed virtual machine model described below. The LAN provides high throughput, guaranteed response, reliability, and low entry cost. The LAN is also autonomous, in the sense that all system and applications software is unaware of its existence. For example, any Network Interface Module (e.g. NIM 21, FIG. 2) could be replaced without rewriting any software other than that which directly drives it.
The LAN interconnection medium may be twisted-pair or coaxial cable. Two channels (logically, two distinct networks) may be provided for reliability and for increased throughput.
The LAN architecture is a logical ring, in which an electronic "token" is constantly passed from cell to cell at high speed. The current holder of the token may use it to send a "frame" of data or may pass it on to the next cell in the ring. The NIM only needs to know the logical address and status of its immediately succeeding neighbor. The NIM's responsibility is limited to detecting the failure of that neighbor or the inclusion of a new neighbor. In general, adjustment to failed or newly added cells is automatic.
The network interface maps directly into the processor's memory. Data exchange occurs through a dual-ported buffer pool which contains a linked list of pending "frames". Logical messages, which vary in length, are broken into fixed-sized frames for transmission and are reassembled by the receiving NIM. Frames are sequence-numbered for this purpose. If a frame is not acknowledged within a short period of time, it is retransmitted a number of times before being treated as a failure.
As described above with reference to FIG. 2, the LAN may be connected to other LAN's operating under the same LAN protocol via so-called "bridgeways", or it may be connected to other types of LAN's via "gateways".
The computer operating system of the present invention operates upon processes, messages, and contexts, as such terms are defined herein. Thus this operating system offers the programmer a hardware abstraction, rather than a data or control abstraction.
Processes are referenced without regard to their physical location via a small set of message-passing primitives. As mentioned earlier, every process has both a unique system-generated identifier and a not necessarily unique name assigned by the programmer. The identifier provides quick direct access, while the name has a limited scope and provides symbolic, indirect access.
With reference to FIG. 3, an architectural model of the present invention is shown. The bottom, or hardware, layer 63 comprises a number of processors 71-76, as described below. The processors 71-76 may exist physically within one or more cells. The top, or software, layer 60 illustrates a number of processes P1-P10 which send messages m1-m6 to each other. The middle layer 61, labelled "virtual machine", isolates the hardware from the software, and it allows programs to be written as if they were going to be executed on a single processor. Conversely, programs can be distributed across multiple processors without having been explicitly designed for that purpose.
An important purpose of the virtual machine concept herein-disclosed is to provide the applications programmer with a simple, consistent model in which to design his system. This model, as mentioned above, is reduced to several elemental concepts: processes, messages, and contexts. As a consequence of this elemental model, hardware peculiarities are made transparent to the user, and changes in hardware configurations have no direct effect on the software.
As discussed earlier, a "process" is a self-contained package of data and executable procedures which operate on that data. The data is totally private and cannot be accessed by other processes. There is no concept of shared memory within the present invention. Execution of a process is strictly sequential. Multiple processes execute concurrently and must be scheduled by the operating system. The processes can be re-entrant, in which case only one copy of the code is loaded even if multiple instances are active.
Every process has a unique "process identifier number" (PID) by which it can be referenced. The PID is assigned by the system when the process is created and remains in effect until the process terminates. The PID assignment contains a randomizing factor which guarantees that the PID will not be re-used in the near future. The contents of the PID are irrelevant to the programmer but are used by the virtual machine to physically locate the process. A PID may be thought of as a "pointer" to a process.
Every process also has a "name" which is a variable-length string of characters assigned by the programmer. A name need not be unique, and this ambiguity may be used to add new services transparently and to aid in fault-tolerance.
FIG. 4 illustrates that the system-wide name space is partitioned into distinct subsets by means of "contexts" identified by reference numerals 90-92. A context is simply a collection of related processes whose names are not known outside-of-the context. Context 90, for example, contains processes A, a, a, b, c, d, and e. Context 91 contains processes B, a, b, c, and f. And context 92 contains processes C, a, c, d, and x.
One particular process in each context, called the "context process", is known both within the context and within the immediately enclosing one (referred to as its "parent context"). In the example illustrated in FIG. 4, processes A-C are context processes for contexts 90-92, respectively. The parent context of context 91 is context 90, and the present context of context 92 is context 91. Conceptually, the context process is located on the boundary of the context and acts as a gate into it.
Processes inside context 92 can reference any processes inside contexts 90 and 91 by name. However, processes in context 91 can only access processes in context 92 by going through the context process C. Processes in context 90 can only access processes in context 92 by going through context processes B and C.
The function of the context process is to filter incoming messages and either reject them or reroute them to other processes in its context. Contexts may be nested, allowing a hierarchy of abstractions to be constructed. A context must reside completely on one cell. The entire system is treated as an all-encompassing context which is always present and which is the highest level in the hierarchy. In essence, contexts define localized protection domains and greatly reduce the chances of unintentional naming conflicts.
If appropriate, a process inside one context can be "connected" to one inside another context by exchanging PID's, once contact has been established through one or the other of the context processes. Most process servers within the present invention function that way. Initial access is by name. Once the desired function (such as a window or file) is "opened", the user process and the service communicate directly via PID's.
A "message" is a variable-length buffer (limited only by the processor's physical memory size) which carries information between processes. A header, inaccessible to the programmer, contains the destination name and the sender's PID. By convention, the first field in a message is a null-terminated string which defines the type of message (e.g., "read", "status", etc.) Messages are queued to the receiving process when they are sent. Queuing ensures serial access and is used in preference to semaphores, monitors, etc.
Messages provide the mechanism by which hardware transparency is achieved. A process located anywhere in the virtual machine can send a message to any other process if it knows its name. Transparency applies with some restrictions across bridgeways (i.e., the interfaces between LAN's operating under identical network protocols) and, in general, not at all across gateways (i.e., the interfaces between LAN's operating under different network protocols) due to performance degradation. However, they could so operate, depending upon the required level of performance.
With reference now to FIG. 5, the relationship of external events to processes will now be described. The virtual machine makes devices look like processes. For example, when an interrupt occurs in an external device 101, the virtual machine kernel 61 queues an interrupt message 103 to a specific process 104, known as an "external event service process" (EESP), functioning as the device manager. For efficiency, the message is pre-allocated once and circulates between the EESP and the kernel. The message contains just enough information to indicate the occurrence of the event. The EESP performs all hardware-specific functions related to the event, such as setting control registers, moving data 105 to a user process 106, transmitting "Read" messages from the user process 106, etc., and then "releasing" the interrupt.
To become an EESP, a process issues a "connect" primitive specifying the appropriate device register(s). It must execute a "disconnect" before it exits. Device-independence is achieved by making the message protocol between EESP's and applications processes the same wherever possible.
All inter-process communication is via messages. Consequently, most of the virtual machine primitives are concerned with processing messages. The virtual machine kernel primitives are the following:
ALLOC--request allocation of a (message) buffer of a given size.
FREE--request deallocation of a given message buffer.
PUT--send a message to a given destination (by name or PID).
GET--wait for and dequeue the next incoming message, optionally from a specific process (by PID).
FORWARD--pass a received message through to another process.
CALL--send a message, then wait for and dequeue the reply.
REPLY--send a message to the originator of a given message.
ANY- MSG--returns "true" if the receive queue is not empty, else returns "false"; optionally, checks if any messages from a specific PID are queued.
To further describe the function of the kernel primitives, ALLOC handles all memory allocations. It returns a pointer to a buffer which can be used for local storage within the process or which can be sent to another process (via PUT, etc.). ALLOC never "fails", but rather waits until enough memory is freed to satisfy the request.
The PUT primitive queues a message to another process. The sending process resumes execution as soon as the message is queued.
FORWARD is used to quickly reroute a message but maintain information about the original sender (whereas PUT always makes the sending process the originator of the message).
REPLY sends a message to the originator of a previously received message, rather than by name or PID.
CALL essentially implements remote subroutine invocations, causing the caller to suspend until the receiver executes a REPLY. Subsequently, the replied message is dequeued out of sequence, immediately upon arrival, and the caller resumes execution.
The emphasis is on concurrently, so that as many processes as possible are executed in parallel. Hence neither PUT nor FORWARD waits for the message to be delivered. Conversely, GET suspends a process until a message arrives and dequeues it in one operation. The ANY- MSG primitive is provided so that a process may determine whether there is anything of interest in the queue before committing itself to a GET.
When a message is sent by name, the destination process must be found in the name space. The search path is determined by the nesting of the contexts in which the sending process resides. From a given process, a message can be sent to all processes in its own context or (optionally) to those in any higher context. Refer to FIG. 6. The contexts are searched from the current one upward until a match is found or until the system context is reached. All processes with the same name in that context are then queued a copy of the message.
For example, with reference to FIG. 6, assume that in context 141 process y sends a message to ALL processes by the name x. Process y first searches within its own context 141 but finds no process x. The process y searches within the next higher context 131 (its parent context) but again finds no process x. Then process y searches within the next higher context 110 and finds a process x, identified by reference numeral 112. Since it is the only process x in context 110, it is the only recipient of the message from process y.
If process a in context 131 sends a message to ALL processes by the name x, it first searches within its own context 131 and, finding no processes x there, it then searches within context 110 and finds process x.
Assume that process b in context 131 sends a message to ALL processes by the name A. It would find process A (111) in context 110, as well as process A (122) which is the context process for context 121.
A process may also send a message to itself or to its context process without knowing either name explicitly.
The concept of a "logical ring" (analogous to a LAN) allows a message to be sent to the NEXT process in the system with a given name. The message goes to exactly one process in the sender's context, if such a process exists. Otherwise the parent context is searched.
The virtual machine guarantees that each NEXT transmission will reach a different process and that eventually a transmission will be sent to the logically "first" process (the one that sent the original message) in the ring, completing the loop. In other words, all processes with the same name at the same level can communicate with each other without knowing how many there are or where they are located. The logical ring is essential for distributing services such as a data base. The ordering of processes in the ring is not predictable.
For example, regarding FIG. 6, if process a (125) in context 121 sends a message to process a using the NEXT primitive, the search finds a first process a (124) in the same context 121. Process a (124) is marked as having received the message, and then process a (124) sends the message on to the NEXT process a (123) in context 121. Process a (123) is marked as having received the message, and then it sends the message on to the NEXT process a, which is the original sender process a (125), which knows not to send it further on, since it's been marked as having already received the message.
Sending messages directly by PID obviates the need for a name search and ignores context boundaries. This is known as the DIRECT mode of transmission and is the most efficient. For example, process A (111) sends a message in the DIRECT mode to process y in context 141.
If a process sends a message in the LOCAL transmission mode, it sends it only to a process having the given name in the sender's own context.
In summary, including the DIRECT transmission mode, there are five transmission modes which can be used with the PUT, FORWARD, and CALL primitives:
ALL--to all processes with the given name in the first context which contains that name, starting with the sender's context and searching upwards through all parent contexts.
LOCAL--to all processes with the given name in the sender's context only.
NEXT--to the next process with the given name in the same context as the sender, if any; otherwise it searches upwards through all parent contexts until the name is found.
LEVEL--sends to "self" (the sending process) or to "context" (the context process corresponding to the sender's context); "self" cannot be used with CALL primitive.
DIRECT--sent by PID.
Messages are usually transmitted by queueing a pointer to the buffer containing the message. A message is only copied when there are multiple destinations or when the destination is on another cell.
The operating system of the present invention consists of a kernel, which implements the primitives described above, plus a set of processes which provide process creation and termination, time management (set time, set alarm, etc.) and which perform cell start-up and configuration. Drivers for devices are also implemented as process (EESP's), as described above. This allows both system services and device drivers to be added or replaced easily. The operating system also supports swapping and paging, although both are invisible to applications software.
Until known distributed computer systems, that of the present invention does not use a distinct "name server" process to resolve names. Name searching is confined to the kernel, which has the advantage of being much faster.
A minimal bootstrap program resides permanently (in ROM) on every cell, e.g. ROM 28 in cell N of FIG. 2. The bootstrap program executes automatically when a cell is powered up and begins by performing basic on-board diagnostics. It then attempts to find and start an initial system code module which comprises the entire kernel, and EESP's for the clock, disk (if required), and NIM (if required). The module is sought on the first disk drive on the cell, if any. If there isn't a disk, and the cell is on the LAN, a message will be sent out requesting the module. Failing that, the required software must be resident in ROM. System services for the clock and for process creation, an initialization program, and a minimal file system, are also built into the module. The initialization program sets up all of the kernel's internal tables and then calls predefined entry points in each of the preloaded services (file management, etc.). The net result is that EESP's for the attached devices are scheduled to run, and the cell is available.
In general, there exists a template file describing the initial software and hardware for each cell in the system. The template defines a set of initial processes (usually one per service) which are scheduled immediately after the cell start-up. These processes then start up their respective subsystems. A cell configuration service on each cell sends configuration messages to each subsystem when it is being initialized, informing it of the devices it owns. Thereafter, similar messages are sent whenever a new device is added to the cell or a device fails or is removed from the cell.
Thus there is no well-defined meaning for "system up" or "system down"--as long as any cell is active, the system as a whole may be considered to be "up". Cells can be shut down or started up dynamically without affecting other cells on the network. The same principle applies, in a limited sense, to peripherals. Devices which can identify themselves with regard to type, model number, etc. can be added or removed without operator intervention. The operating system cannot maintain a global status of the system, nor does it attempt to centralize control of the entire system.
The present invention allows the user to store and retrieve data at several levels of abstraction. At various levels it provides device-independence, transparency, multiple views of the same data and support for transaction processing. Transparency means that a process need not know where a file is stored in order to access it. It also means that the file can be moved to another device without affecting the process. Only as many levels as are required for a particular application need by included in the system.
Referring now to FIG. 7, the lowest level of data management is the physical disk layer 153, which is completely hidden from all applications software 155. Immediately above this level are virtual disks 152 which define an interface in terms of linear arrays of 1K blocks, regardless of the actual medium. Although the usual medium is disk, RAM may also be used (for temporary files) to improve performance. Three types of messages are supported at this level: "initial", to format the virtual disk, and "read" and "write" to access specific blocks.
The third level, disk management 151, organizes data within a virtual disk by means of indices. A disk index is a file at this level and is viewed as an extensible linear array of bytes. Messages are accepted to initialize the disk, allocate and delete indices, and read and write indices. The latter two functions operate starting at a given byte offset for a given byte length. An index is automatically extended when a request references a location outside the current limits. Physical storage is allocated only when data is actually written. Optional data caching is supported at the disk management level on a per cell basis.
File management 150 is layered on top of disk management 151 and introduces the concept of a "file system". A file system is a collection of named files (or named indices, in terms of the disk management layer 151). The name space constitutes a flat (single-level) directory which is allocated when the file system is initialized. A name may be up to 64 characters long and is hashed into the directory. Unnamed files are useful for building complex disk structures which are logically linked to each other, such as a hierarchical file directory or a database, or for temporary files which only the creator will use.
Transparency is supported only at the file management level 150 and above. It is used by simply omitting the file system name from the request (NEW, DELETE, RENAME, or OPEN). In this case, the request is forwarded through all file systems until the given file name is found.
The highest level 154 of data management deals in terms of "metaphors", which implement application-specific views of the data. A relational database is one example of a metaphor. Complex operations such as multi-user synchronization and record- or field-locking may be implemented at this level. The present invention supports two built-in views of the data: "plain" files, which are superficially equivalent to UNIX™ files, and a relational database.
FIG. 8 illustrates the design of the data management software up to the plain-file level. Each active (mounted) filed system 165 is represented by a file management context 160. The set of all such contexts form a logical ring for purposes of message transmission; in other words, they all have the same name ("file- mgt"). The actual name of the file system (stored on the disk 166 at initialization) is known only to the context process.
In the plain-file metaphor, there is exactly one process for each open file, acting as a server for that file. That process (an instance of "fil- access") can be located in the appropriate file management context, or any application can create its own private copy of the process. The process allows standard file management functions (NEW, DELETE, RENAME, OPEN, and CLOSE) plus SEEK, LOCK (lock the entire file against access by processes other than the owner) and UNLOCK. Note that a given file process is only opened once, by its owner. If not locked, any other processes which known its name or PID can read and write the file. Protection is provided through normal process name-scoping. Protection via passwords or a similar mechanism are in general unsupported unless supported by another metaphor.
The human interface (HI) of the present invention provides a set of tools with which an end user can construct a package specific to his applications requirements. Such a package is referred to as a "metaphor", since it reflects the user's particular view of the system. Multiple metaphors can be supported concurrently. One representative metaphor is, for example, a software development environment.
The purpose of the HI metaphor is to allow consistent, integrated access to the data and functions available in the system. Since users' perceptions of the system are based largely on the way they interact with it, it is important to provide an interface with which they feel comfortable. The HI allows a systems designer to create a model consisting of objects that are familiar to the end user and a set of actions that can be applied to them.
The fundamental concept of the HI is that of the "picture". All visually-oriented information, regardless of interpretation, is represented by picture. A picture (such as a diagram, report, menu, icon, etc.) is defined in a device-independent format which is recognized and manipulated by all programs in the HI and all programs using the HI. It consists of "picture elements", such as "line", "arc", and "text", which can be stored compactly and transferred efficiently between processes. All elements have common attributes like color and fill pattern. Most also have type-specific attributes, such as typeface and style for text. Pictures are drawn in a large "world" co-ordinate system composed of "virtual pixels".
Because all data is in the form of pictures, segments of data can be freely copied between applications, e.g., from a live display to a word processor. No intermediate format or conversion is required. One consequence of this is that the end user or original equipment manufacturer (OEM) has complete flexibility in defining the formats of windows, menus, icons, error messages, help pages, etc. All such pictures are stored in a library rather than being built into the software and so are changeable at any time without reprogramming. A comprehensive editor is available to define and modify pictures on-line.
All interaction with the user's environment is through either "virtual input" or "virtual output" devices. A virtual input device accepts keyboards, mice, light pens, analog dials, pushbuttons, etc. and translates them into text, cursor-positioning, action, dial, switch, and number messages. All physical input devices must map into this set of standard messages. Only one process, an input manager for the specific device, is responsible for performing the translation. Other processes can then deal with the input without being dependent on its source.
Similarly, a virtual output manager translates standard output messages to the physical representation appropriate to a specific device (screen, printer, plotter, etc.) A picture drawn on any terminal or by a process can be displayed or printed on any device, subject to the physical limitations of that device.
With reference to FIG. 9, two "pictures" are illustrated--picture A (170) and picture B (174).
The concept of a "view" is used to map a particular rectangular area of a picture to a particular device. In FIG. 9, picture A is illustrated as containing at least one view 171, and picture B contains at least one view 175. Views can be used, for example, to partition a screen for multiple applications or to extract page-sized subsets of a picture for printing.
If the view appears on a screen it is contained in a "window". With reference again to FIG. 9, view 171 of picture A is mapped to screen 176 as window 177, and view 175 of picture B is mapped as window 178.
The HI allows the user to dynamically change the size of the window, move the window around on the screen, and move the picture under the window to view different parts of it (i.e., scroll in any direction). If a picture which is mapped to one or more windows changes, all affected views of that picture on all screens are automatically updated. There is no logical limit to the number of sizes of windows on a particular screen. Since the system is distributed, it's natural for pictures and windows to be on different cells. For example, several alarm displays can share a single, common picture.
The primary mechanism for interacting with the HI is to move the cursor tot he desired object and "select" it by pressing a key or button. An action may be performed automatically upon selection or by further interaction, often using menus. For example, selecting an icon usually activates the corresponding application immediately. Selecting a piece of text is often followed by selection of a command such as "cut" or "underline". Actions can be dynamically mapped to function keys on a keyboard so that pressing a key is equivalent to selecting an icon or a menu item. A given set of cursors (the cursor changes as it moves from one application picture to another), windows, menus, icons, and function keys define a "metaphor".
The HI builds on the above concepts to provide a set of distributed services. These include electronic mail, which allows two or more users at different terminals in communicate with each other in real time or to queue files for later delivery, and a forms manage for data entry. A subclass of windows called "virtual terminals" provides emulation of standard commercially available terminals.
FIG. 10 shows the different levels of the HI and data flow through them. Arrows 201-209 indicate the most common paths, while arrows 210-213 indicate additional paths. The interface can be configured to leave out unneeded layers for customized applications. The philosophy behind the HI design dictates one process per object. That is, a process is created for each active window, picture, input or output device, etc. As a result, the processes are simplified and can be distributed across cells almost arbitrarily.
An error management service is provided to catch errors and report them to the appropriate process(es). It serves a foundation upon which more sophisticated diagnostics and/or recovery schemes may be constructed. The system can intercept processor internal exceptions (bus and address errors, "trap" instructions, etc.), external exceptions (such as a spurious interrupts), device faults, and software-defined errors. The latter category is open-ended and comprises unexpected termination of a process, the result of a diagnostic program, or in general any error detected by the kernel or by any process. Failure to find the destination of a transmitted message is one example. While internal exceptions can be associated with the particular process which caused the error, external exceptions are independent, although they may directly impact one or more processes.
In summary, the prime functions of the error management service are to: (1) classify and log errors, (2) generate notification messages, (3) accept requests to configure the service and specify options, (4) accept software error messages from other subsystems, and (5) terminate affected processes, if required. Item (3) above allows applications and services to indicate that they want to know about specific errors or classes of errors. Options include automatic logging, automatic display on the operator's terminal, automatic suspension (for debugging) or abortion of the offending process, and automatic dumping of the process image to a file. The default actions, if no options have been specified, are termination, logging and display. Any outstanding request can be cancelled at any time.
The HI logging service provides the facility to store error messages in chronological file, maintain a hard-copy log, and create a dynamic display of errors, ordered by time, priority, class, etc. The debugger is often invoked upon occurrence of a process error to examine the process' state for clues.
FIG. 11 shows a conceptual representation illustrating the relationship between contexts and processes, in terms of context processes, process control blocks (PCB's), and process has tables (PHT's). FIG. 11 also illustrates the concept of nested context. For example, process A is a context process for the context comprising processes A-E. Process C is a context process for the context comprising processes C', F, and G. Process E is a context process for the context comprising processes H and I. And process D is a context process for the context comprising processes D and D'.
FIG. 12 shows a slightly different conceptual representation of the identical nested contexts illustrated in FIG. 11. As seen in FIG. 12, the context 401 comprising processes C, C', F, and G is contained within the context 400 comprising processes A-E. Also the context 403 comprising processes E, H, and I is contained within context 400. Likewise, the context 402 comprising processes D and D' is contained within context 400.
Referring again to FIG. 11, process A comprises a portion 300 of memory space, which includes a process control block (PCB) 320, which contains the starting member address of process A's process hash table (PHT) 301. PHT 301 is a table containing the starting memory addresses of each of the processes B-E contained within context 400 (FIG. 12), i.e., the context for which process A is the context process. Thus one location of the PHT 301 points to the starting memory address 302 of process B. Another location of PHT 301 points to the start of process C.
Process C, being a context process for context 401 (FIG. 12), also contains a PCB 321, which points to the start of process C's PHT 306. PHT 306 contains the starting addresses of processes C', F, and G.
Another location of PHT 301 points to the start of process E. Process E is context process for context 403 (FIG. 12), so its PCB 322 contains the start of process E's PHT 307. PHT 307 contains the starting addresses of processes H and I.
Another location of PHT 301 points to the start of process D. Process D includes the starting address 308 of process D'.
With reference still to FIG. 11, the manner in which messages are communicated between processes of identical name contained within the same context will now be described with regard to the transmission mode NEXT (refer to the section above entitled "Interprocess Communication" for a further discussion of this transmission mode).
Regarding transmission mode NEXT, the usual procedure (i.e., when the sending process and receiving processes have different names) is to first search for the destination process by name within the sender's context. If the destination process isn't found there, then the search continues in the next higher context (i.e., the parent context), then in the parent's parent context, etc. The first process with the specified name in the first context level where at least one match is found will receive the message.
Where transmission mode NEXT is used to communicate between processes having the same name, a slightly different procedure governs. If the sending process is the only process with the specified name within its context, then it will also be the receiver of the message.
If there are several processes with the specified name in the sender's context, then the next one listed in the PHT of the context process will receive the message first. This process then retransmits the message, again using the transmission mode NEXT, and the message goes to the next process, if any, listed in the PHT of the context process. This procedure continues until all processes with the same name within the same context have received the message, and the message has wrapped around and been received by the sending process.
To illustrate, assume, for example, that process C' wants to send a message to process(es) C. The process hash table (PHT) 306 of the context process C is searched, locating the starting address 310 of process C', and the message is sent back to process C'. There are no other processes named C in context 401 (FIG. 12), so the message has wrapped around and is received by the sending process C'.
Assume now that process C is sending a message to process(es) C. The PHT 301 of the context process A is searched, locating the starting address of process C, and the message is sent to process C. Again, since C is the only process within context 400, the message wraps around to C.
Assume that process D wants to send a message to process(es) D. First the PHT 301 of the context process A is searched, locating the starting addressed 308 of process D', which is within the same context as process D, so the message is delivered to process D'.
Lastly, suppose that process D' wishes to send a message to process(es) D. The PHT 301 of the context process A is searched, locating the starting address 305 of process D, so the message is delivered to process D.
Programs Listings A-F contain a "C" language implementation of the concepts relating to message transmission among processes as described hereinabove.
The data structures PCB (process control block) and PHT (process hash table) are declared in Program Listing F, lines 30-31 and defined in Program Listing C, lines 50-101. In Program Listing C, line 52 represents the pointer of a context process to its process hash table, and line 53 is a link between processes in the same context that have the same hash index (hash collisions).
In Program Listing A, lines 38-45 describe the creation of a process-context hierarchy, as shown in FIG. 11. Processes are created one at a time, their user-assigned name is hashed, and the resulting index is used to insert the process into the process hash table of its parent. Hash collisions within a context are linked in the order of their creation. Lines 66-73 describe the removal of a process from the process-context hierarchy, when that process terminates its execution.
In Program Listing B, lines 274-288 describe the "C" language implementation of the LOCAL transmission mode. The search starts in the PHT of the parent process (if the sender is a process) or in the sender's own PHT (if it is a context process). A copy of the message is delivered to each of the processes with the specified name in this context. The sender process is excluded from the search.
In Program Listing B, lines 274-391 describe the "C" language implementation of the ALL transmission mode. The search starts in the PHT of the parent process (if the sender is a process) or in the sender's own PHT (if it is a context process). A copy of the message is delivered to each of the processes with the specified name in the first parent context where at least one destination is found. The sender process is excluded from the search.
In Program Listing B, lines 473-503 describe the "C" language implementation of the NEXT transmission mode. The search starts in the PHT of the parent process, and the message is delivered to the first process with the specified name in the first parent context where at lest one destination is found. The search includes the sender process.
In Program Listing B, lines 476-491, in particular, describe the implementation of the logical ring, according to which a message is sent to each process with the same name in the same context. The "logical ring" procedure is used in transmission mode NEXT only, whenever the name of the destination process is the same as the name of the sender process. In this case the search starts with the next process with the same hash index in the sender's context, and it "wraps around" at the end of the linked list (i.e. continues with the first entry with the same hash index in the same PHT). If there is only one process (i.e., the sender process) with the given name in that context, then the sender process will receive the message.
In Program Listing B, lines 636-641 describe the "C" language implementation of the LEVEL transmission mode. The parent of a process is found using the pointer in the PCB (line 51 in Program Listing C).
It will be apparent to those skilled in the art that the herein disclosed invention may be modified in numerous ways and may assume many embodiments other than the preferred form specifically set out and described above. Accordingly, it is intended by the appended claims to cover all modifications of the invention which fall within the true spirit and scope of the invention. ##SPC1##
Kolnick, Frank C., Kun, Andrew I., Mansfield, Bruce M.
| Patent | Priority | Assignee | Title |
| 10437627, | Nov 25 2014 | The Research Foundation for The State University of New York | Multi-hypervisor virtual machines |
| 11003485, | Nov 25 2014 | The Research Foundation for The State University | Multi-hypervisor virtual machines |
| 11809891, | Jun 01 2018 | The Research Foundation for The State University of New York | Multi-hypervisor virtual machines that run on multiple co-located hypervisors |
| 5276879, | Oct 31 1989 | Hewlett-Packard Company | Portable, resource sharing file server using co-routines |
| 5305461, | Apr 03 1992 | INTERNATIONAL BUSINESS MACHINES CORPORATION A NY CORP | Method of transparently interconnecting message passing systems |
| 5361366, | Dec 26 1989 | Hitachi, Ltd. | Computer equipped with serial bus-connected plural processor units providing internal communications |
| 5363121, | Jun 29 1990 | International Business Machines Corporation | Multiple protocol communication interface for distributed transaction processing |
| 5421004, | Sep 24 1992 | International Business Machines Corporation | Hierarchical testing environment |
| 5519875, | Aug 08 1991 | Hitachi, Ltd. | Distributed processing system for modules, each having modularized objects |
| 5544316, | Sep 24 1992 | International Business Machines Corporation | Method and system for optionally registering a local process to allow participation in a single system semantic |
| 5640584, | Dec 12 1994 | TERADATA US, INC | Virtual processor method and apparatus for enhancing parallelism and availability in computer systems |
| 5666533, | Sep 06 1991 | International Business Machines Corporation | Program execution management using process enclaves which define the scope of high-level language semantics and threads improving cooperation between processes written in multiple languages |
| 5729682, | Jun 07 1995 | International Business Machines Corporation | System for prompting parameters required by a network application and using data structure to establish connections between local computer, application and resources required by application |
| 5737605, | Oct 12 1993 | International Business Machines Corporation | Data processing system for sharing instances of objects with multiple processes |
| 5765153, | Jan 03 1996 | International Business Machines Corporation | Information handling system, method, and article of manufacture including object system authorization and registration |
| 5809506, | Jan 22 1996 | International Business Machines Corporation | Method for creating an object base of persisent application objects in an object oriented programming environment and apparatus related thereto |
| 5832261, | Nov 28 1991 | Fujitsu Limited | Barrier synchronizing mechanism for a parallel data processing control system |
| 5867708, | Nov 20 1995 | International Business Machines Corporation | System, method, and article of manufacture for adding concurrency to a binary class in an object oriented system |
| 5873092, | Dec 14 1995 | International Business Machines Corporation | Information handling system, method, and article of manufacture including persistent, distributed object name services including shared properties |
| 5898855, | Sep 20 1993 | Hitachi, Ltd. | Control method for virtual machine running time in virtual machine system |
| 6029169, | May 01 1997 | HANGER SOLUTIONS, LLC | Universal software structure for representing model structures |
| 6073157, | Sep 06 1991 | International Business Machines Corporation | Program execution in a software run-time environment |
| 6108689, | Oct 11 1996 | International Business Machines Corporation | Method and system for processing messages in a distributed computing environment |
| 6279028, | Dec 08 1995 | RPX Corporation | Operating system having a mechanism for handling a group of related processes residing on separate machines |
| 6782538, | Dec 14 1995 | International Business Machines Corporation | Object oriented information handling system including an extensible instance manager |
| 8405662, | Jul 04 2006 | ITI Scotland Limited | Generation of video |
| 8863015, | Jan 19 2006 | Raytheon Company | Multi-monitor, multi-JVM java GUI infrastructure with layout via XML |
| 8938796, | Sep 20 2012 | Case secure computer architecture | |
| 9122633, | Sep 20 2012 | Case secure computer architecture | |
| 9798567, | Nov 25 2014 | The Research Foundation for The State University of New York | Multi-hypervisor virtual machines |
| Patent | Priority | Assignee | Title |
| 4031512, | May 29 1975 | Unisys Corporation | Communications network for general purpose data communications in a heterogeneous environment |
| 4374409, | Nov 30 1973 | Compagnie Honeywell Bull | Method of and system using P and V instructions on semaphores for transferring data among processes in a multiprocessing system |
| 4413318, | Nov 20 1980 | International Business Machines Corporation | Use of nodes to uniquely identify processes |
| 4423414, | Aug 27 1981 | Unisys Corporation | System and method for name-lookup in a local area network data communication system |
| 4430651, | Aug 27 1981 | Unisys Corporation | Expandable and contractible local area network system |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Apr 15 1988 | Motorola, Inc. | (assignment on the face of the patent) | / | |||
| May 11 1988 | COMPUTER X, INC | MOTOROLA COMPUTER X, INC | CHANGE OF NAME SEE DOCUMENT FOR DETAILS MAY 6, 1988 | 005584 | /0116 | |
| Oct 23 1990 | MOTOROLA COMPUTER X, INC | Motorola Inc | ASSIGNMENT OF ASSIGNORS INTEREST | 005535 | /0346 | |
| Dec 31 2007 | Motorola, Inc | EMERSON NETWORK POWER - EMBEDDED COMPUTING, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 020540 | /0714 |
| Date | Maintenance Fee Events |
| Jan 30 1995 | M183: Payment of Maintenance Fee, 4th Year, Large Entity. |
| Mar 09 1995 | ASPN: Payor Number Assigned. |
| Dec 14 1998 | M184: Payment of Maintenance Fee, 8th Year, Large Entity. |
| Dec 30 2002 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
| Date | Maintenance Schedule |
| Sep 10 1994 | 4 years fee payment window open |
| Mar 10 1995 | 6 months grace period start (w surcharge) |
| Sep 10 1995 | patent expiry (for year 4) |
| Sep 10 1997 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Sep 10 1998 | 8 years fee payment window open |
| Mar 10 1999 | 6 months grace period start (w surcharge) |
| Sep 10 1999 | patent expiry (for year 8) |
| Sep 10 2001 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Sep 10 2002 | 12 years fee payment window open |
| Mar 10 2003 | 6 months grace period start (w surcharge) |
| Sep 10 2003 | patent expiry (for year 12) |
| Sep 10 2005 | 2 years to revive unintentionally abandoned end. (for year 12) |