US5047925A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Logical ring in a virtual single machine
Assignee: Smart Embedded Computing Inc
•
Filing: 1988-04-15
•
Granted: 1991-09-10
•
Expires: 2008-04-15
Abstract
Abstract 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.
Inventors
- 👤 Andrew I. Kun
- 👤 Frank C. Kolnick
- 👤 Bruce M. Mansfield
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:38
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
129 words
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.
Claim 2
Independent Claim
129 words
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.
Claim 3
Independent Claim
161 words
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.
Claim 4
Independent Claim
161 words
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.
Claim 5
Dependent Claim
37 words
The method of communicating between processes recited in claim 2, said method further comprising the steps of: (e) repeating step (d) until all identically-named processes in said one context have received said message, including said first process.
Claim 6
Dependent Claim
36 words
The method of communicating between processes recited in claim 2 wherein said one context contains no identically-named process other than said first process, and wherein in step (d) said message is sent to said first process.
Claim 7
Dependent Claim
144 words
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.
Claim 8
Dependent Claim
144 words
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.
Claim 9
Dependent Claim
37 words
The data processing system recited in claim 5, wherein if said searching means indicates that said one context contains no identically-named process other than said first process, said sending means sends said message to said first process.
Claim 10
Dependent Claim
166 words
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.
Claim 11
Dependent Claim
166 words
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.
Claim 12
Dependent Claim
71 words
The data processing system recited in claim 7, and further comprising: 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.
Claim 13
Dependent Claim
37 words
The data processing system recited in claim 8, wherein if said searching means indicates that said one context contains no identically-named process other than said first process, said control means sends said message to said first process.
Claim 14
Independent Claim
92 words
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.
Claim 15
Independent Claim
92 words
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.
Claim 16
Dependent Claim
49 words
The method of communicating between processes recited in claim 10, comprising the steps of: (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.
Claim 17
Dependent Claim
41 words
The method of communicating between processes recited in claim 11, said method further comprising the steps of: (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.
Claim 18
Dependent Claim
36 words
The method of communicating between processes recited in claim 10 wherein said one context contains no identically-named process other than said first process, and wherein the step (b) said message is sent to said first process.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-09 | 1995-03-11 | 1995-09-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-09 | 1999-03-11 | 1999-09-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-09 | 2003-03-11 | 2003-09-10 | $7700.00 | Window Closed / Lapsed |