Patent US4820626A successfully refreshed from Google Patents.
US4562539A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data processing system
Assignee: Fujitsu Services Ltd
•
Filing: 1983-02-17
•
Granted: 1985-12-31
•
Expires: 2003-02-17
Abstract
Abstract A data processing system comprising multiple processing nodes each containing a processor and a data store. The store holds local data, and also holds copies of shared data required by the node. This reduces conflict between the nodes in accessing the shared data. When one node updates the shared data, it sends an update message to all the other nodes over a transmission link. The processor is then free to continue processing. When the message reaches the other nodes, it updates the other copies of the shared data, so as to ensure consistency. Each node receives messages from the link in the same order, and this defines a unique chronological order for the updates, even though the nodes are asynchronous. A node is temporarily suspended if an update occurs out of this correct chronological order.
Inventors
- 👤 Nigel L. Vince
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 08:02
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
209 words
A data processing system comprising a plurality of processing nodes interconnected by data transmission means for receiving messages from the nodes and delivering the messages in the same sequence to all the nodes including the nodes which originated the messages, each node comprising: (a) a data store holding data items unique to the node and also holding a copy of each of a plurality of shared data items, (b) a data processor coupled to the data store for reading and updating data items in the store, (c) means responsive to the processor updating a shared data item, for generating a message containing the updated value of the data item and its address, (d) means for transmitting the message over the transmission means, (e) means for receiving messages from the transmission means, (f) means responsive to the reception of a message originating from another node, for updating the shared data item identified by the address contained in the message, (g) means for producing a signal whenever a message has been generated by the node but has not yet been received back from the transmission means, and (h) means operative upon reception of a message originating from another node, while said signal is present, for temporarily suspending operation of the processor.
Claim 2
Dependent Claim
209 words
A data processing system comprising a plurality of processing nodes interconnected by data transmission means for receiving messages from the nodes and delivering the messages in the same sequence to all the nodes including the nodes which originated the messages, each node comprising: (a) a data store holding data items unique to the node and also holding a copy of each of a plurality of shared data items, (b) a data processor coupled to the data store for reading and updating data items in the store, (c) means responsive to the processor updating a shared data item, for generating a message containing the updated value of the data item and its address, (d) means for transmitting the message over the transmission means, (e) means for receiving messages from the transmission means, (f) means responsive to the reception of a message originating from another node, for updating the shared data item identified by the address contained in the message, (g) means for producing a signal whenever a message has been generated by the node but has not yet been received back from the transmission means, and (h) means operative upon reception of a message originating from another node, while said signal is present, for temporarily suspending operation of the processor.
Claim 3
Dependent Claim
56 words
A system according to claim 1 wherein the signal producing means comprises: (a) a counter, (b) means for incrementing the counter whenever a message is generated by the node, (c) means for decrementing the counter whenever the node receives a message originating from itself, and (d) means for generating said signal when the counter is non-zero.
Claim 4
Dependent Claim
23 words
A system according to claim 1 wherein each node includes a first-in first-out buffer for holding a queue of generated messages awaiting transmission.
Claim 5
Dependent Claim
56 words
A system according to claim 3 wherein the signal producing means comprises: (a) a counter, (b) means for incrementing the counter whenever a message is added to said buffer, (c) means for decrementing the counter whenever the node receives a message originating from itself, and (d) means for generating said signal when the counter is non-zero.
Claim 6
Dependent Claim
30 words
A system according to claim 1 wherein the transmission means comprises a ring network having means for permitting only one message at a time to be present on the ring.
Claim 7
Dependent Claim
18 words
A system according to claim 1 wherein said address contained in each said message is a virtual address.
Claim 8
Independent Claim
255 words
A method of operating a data processing system comprising a plurality of processing nodes, each node including a data store and a data processor coupled to the store, and data transmission means for receiving messages from the nodes and delivering the messages in the same sequence to all the nodes, the method comprising the steps: (a) storing local data items unique to individual nodes in the data stores of the respective nodes, (b) storing copies of shared data items in the data stores of respective nodes, (c) whenever the processor in one node updates the copy of a shared data item held in the data store of that node, generating in said one node a message containing the updated value of the shared data item and its address, and making a record that a message has been generated, (d) transmitting the message from said one node over the link to all the nodes, including said one node, (e) enabling the processor in said one node to continue processing without waiting for the message to reach the other nodes, (f) when the message is received by the other nodes, updating the copies of the shared data item held in the data stores of those other nodes, (g) when the message is received back from the link by said one node, canceling said record, and (h) in the event that a message originating from another node is received by said one node while said record is present, temporarily suspending operation of the processor in said one node.
Claim 9
Independent Claim
255 words
A method of operating a data processing system comprising a plurality of processing nodes, each node including a data store and a data processor coupled to the store, and data transmission means for receiving messages from the nodes and delivering the messages in the same sequence to all the nodes, the method comprising the steps: (a) storing local data items unique to individual nodes in the data stores of the respective nodes, (b) storing copies of shared data items in the data stores of respective nodes, (c) whenever the processor in one node updates the copy of a shared data item held in the data store of that node, generating in said one node a message containing the updated value of the shared data item and its address, and making a record that a message has been generated, (d) transmitting the message from said one node over the link to all the nodes, including said one node, (e) enabling the processor in said one node to continue processing without waiting for the message to reach the other nodes, (f) when the message is received by the other nodes, updating the copies of the shared data item held in the data stores of those other nodes, (g) when the message is received back from the link by said one node, canceling said record, and (h) in the event that a message originating from another node is received by said one node while said record is present, temporarily suspending operation of the processor in said one node.
Claim 10
Dependent Claim
41 words
A system according to claim 7 wherein each node includes a counter, and wherein the step of making a record that a message has been generated comprises incrementing the counter, and the step of canceling said record comprises decrementing the counter.
References Cited (Backward Citations)
US3845474A
Cited
US3889237A
Cited
US4019176A
Cited
US4007450A
Cited
US4136386A
Cited
US4385351A
Cited
US4322795A
Cited
US4491946A
Cited
US4445174A
Cited
US4432057A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-12-30 | 1989-07-01 | 1989-12-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-12-30 | 1993-07-01 | 1993-12-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-12-30 | 1997-07-01 | 1997-12-31 | $7700.00 | Window Closed / Lapsed |