Patent JPS533178A successfully refreshed from Google Patents.
Patent US1935577A successfully refreshed from Google Patents.
Patent US3068461A successfully refreshed from Google Patents.
Patent US4893231A successfully refreshed from Google Patents.
US4893231A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multi-node data processing system
Assignee: Fujitsu Services Ltd
•
Filing: 1987-09-11
•
Granted: 1990-01-09
•
Expires: 2007-09-11
Abstract
Abstract Multi-node data processing apparatus is described, in which the nodes are interconnected by multiple transmission links. Before a node can transmit a message, it must acquire a unique transmission sequence number (TSN) which it appends to the message when transmitted. Each node receives messages from all the links, and organizes them into strict TSN order before processing. This ensures that all the nodes process all the messages in the same sequence. The TSN may be acquired, for example, from a special ring interconnecting all the nodes.
Inventors
- 👤 Donald Bell
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 11:22
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17337
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
85 words
Data processing apparatus comprising: (a) a plurality of data processing nodes, (b) a plurality of data transmission links for carrying messages between the nodes, and (c) allocation means common to all the nodes, for allocating a single global sequence of transmission sequence numbers to messages transmitted by the nodes, each message being allocated a transmission sequence number unique to that message, (d) each node comprising means for reorganizing all of the message received from all the transmission links into order of their transmission sequence numbers.
Claim 2
Dependent Claim
85 words
Data processing apparatus comprising: (a) a plurality of data processing nodes, (b) a plurality of data transmission links for carrying messages between the nodes, and (c) allocation means common to all the nodes, for allocating a single global sequence of transmission sequence numbers to messages transmitted by the nodes, each message being allocated a transmission sequence number unique to that message, (d) each node comprising means for reorganizing all of the message received from all the transmission links into order of their transmission sequence numbers.
Claim 3
Dependent Claim
115 words
Apparatus according to claim 1 wherein said means for organizing messages received from the transmission links into order of their transmission sequence numbers comprises: (a) a plurality of first-in-first-out buffers connected to receive messages from the transmission links into order of their transmission sequence numbers comprises: (b) a counter for holding an expected sequence number, (c) comparison means for comparing the expected sequence number held in the counter with the transmission sequence number held in each of said plurality of first-in-first-out buffers, and (d) means operative upon detection of a match by said comparison means for reading out a message from the first-in-first-out buffer holding the transmission sequence number that matches the expected sequence number.
Claim 4
Dependent Claim
132 words
Data processing apparatus comprising (a) a plurality of data processing nodes, (b) a plurality of data transmission links for carrying messages between the nodes, (c) a transmission path linking all the nodes together in a ring, and (d) means for circulating transmission sequence numbers around said transmission path, wherein each node comprises: (e) means for transmitting a message on one of said data transmission links, (f) means for acquiring a transmission sequence number from said transmission path for each transmitted message, the transmission sequence number being unique to the message, and for transmitting that number along with the message, (g) means for receiving messages from all said data transmission links, and (h) means for reorganizing all of the messages received from all the transmission links into order of their transmission sequence numbers.
Claim 5
Dependent Claim
132 words
Data processing apparatus comprising (a) a plurality of data processing nodes, (b) a plurality of data transmission links for carrying messages between the nodes, (c) a transmission path linking all the nodes together in a ring, and (d) means for circulating transmission sequence numbers around said transmission path, wherein each node comprises: (e) means for transmitting a message on one of said data transmission links, (f) means for acquiring a transmission sequence number from said transmission path for each transmitted message, the transmission sequence number being unique to the message, and for transmitting that number along with the message, (g) means for receiving messages from all said data transmission links, and (h) means for reorganizing all of the messages received from all the transmission links into order of their transmission sequence numbers.
References Cited (Backward Citations)
US3597549A
Cited
US3597549B1
Cited
US3732543A
Cited
US3879710A
Cited
US4295206A
Cited
US4363093A
Cited
US4432054A
Cited
US4412285A
Cited
US4543630A
Cited
US4545043A
Cited
US4530051A
Cited
US4653048A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-01-08 | 1993-07-10 | 1994-01-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-01-08 | 1997-07-10 | 1998-01-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-01-08 | 2001-07-10 | 2002-01-09 | $7700.00 | Window Closed / Lapsed |