US5659686A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of routing a message to multiple data processing nodes along a tree-shaped path
Assignee: Unisys Corp
•
Filing: 1994-09-22
•
Granted: 1997-08-19
•
Expires: 2014-09-22
Abstract
Abstract In a parallel processor, a plurality of data processing nodes are intercoupled through an array of message routing circuits. Each message routing circuit has multiple input channels on which messages are received and multiple output channels on which messages are sent. A message on an input channel of any one particular message routing circuit contains a header followed by data with the header consisting of a sequence of control characters which route the data. Depending on the control character sequence that is received on an input channel, the data is sent to one, two, or three output channels and each such data transmission is preceded by a respective modified header which is generated from the header on the input channel. By sequentially performing this message processing in a series of message routing circuits, the data is delivered to multiple nodes along a tree-shaped path.
Inventors
- 👤 ChiYeh Hou
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 20:26
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
241 words
A method of passing a message through a message routing circuit which has multiple input channels and multiple output channels; said method including the steps of: examining said message, as it is received on one of said input channels, to determine that said message contains a series of control characters followed by data; identifying in said series of control characters, spaced apart pairs of start-branch and end-branch control characters which delineate a lead header and a trail header as well as at least one nested subheader, and where to identify the end of said lead and trail headers, the substep of counting each pair of start-branch and end-branch control characters is performed; selecting a first output channel solely in response to said control characters in one of said headers and storing a second one of said headers; modifying said first one of said headers to reflect said selection of said first output channel and sending the modified first one of said headers on said first output channel; storing said data while simultaneously sending said data on said first output channel after said modified first one of said headers; selecting a second output channel solely in response to said control characters in the stored second one of said headers and modifying that same header to reflect said selection of said second output channel; and, sending the modified second one of said headers followed by said stored data on said second output channel.
Claim 2
Independent Claim
241 words
A method of passing a message through a message routing circuit which has multiple input channels and multiple output channels; said method including the steps of: examining said message, as it is received on one of said input channels, to determine that said message contains a series of control characters followed by data; identifying in said series of control characters, spaced apart pairs of start-branch and end-branch control characters which delineate a lead header and a trail header as well as at least one nested subheader, and where to identify the end of said lead and trail headers, the substep of counting each pair of start-branch and end-branch control characters is performed; selecting a first output channel solely in response to said control characters in one of said headers and storing a second one of said headers; modifying said first one of said headers to reflect said selection of said first output channel and sending the modified first one of said headers on said first output channel; storing said data while simultaneously sending said data on said first output channel after said modified first one of said headers; selecting a second output channel solely in response to said control characters in the stored second one of said headers and modifying that same header to reflect said selection of said second output channel; and, sending the modified second one of said headers followed by said stored data on said second output channel.
Claim 3
Dependent Claim
18 words
A method according to claim 1 wherein said first output is selected in response to said lead header.
Claim 4
Dependent Claim
18 words
A method according to claim 1 wherein said first output is selected in response to said trail header.
Claim 5
Dependent Claim
57 words
A method according to claim 1 which further includes the substeps of identifying a destination control character at the start of said lead header which indicates that a destination for said message has been reached, and identifying a start-branch control character immediately after said destination control character which indicates that said trail header occurs in said message.
Claim 6
Dependent Claim
64 words
A method according to claim 1 which further includes the substeps of identifying said lead header as consisting of a sequence of characters which begins with a destination control character and stops with an end-branch control character, and identifying said trail header as consisting of a sequence of characters which begins immediately after said end-branch control character and stops with a start-data control character.
Claim 7
Dependent Claim
49 words
A method according to claim 1 wherein said lead header includes multiple pairs of start-branch and end-branch control characters with each such pair indicating the presence of a nested subheader; and wherein to find the end of said lead header, the substep of counting each such pair is performed.
Claim 8
Dependent Claim
60 words
A method according to claim 1 wherein said lead header starts with a destination control character which has a particular value that indicates the message has reached a selected destination, followed immediately by a start-branch control character followed immediately by another destination control character, and wherein said first output channel is selected in response to the latter destination control character.
Claim 9
Dependent Claim
116 words
A method according to claim 1 wherein said lead header starts with a destination control character, which has a particular value that indicates the message has reached a selected destination, followed immediately by a start-branch control character followed immediately by another destination control character, and wherein said modified lead header as sent on said first output channel is formed by the substeps of--a) removing said destination control character and a branch control character from the start of said lead header, b) modifying said immediately following destination control character to reflect the selection of said first output channel, and, c) replacing an end-branch control character at the end of said lead header with a start-data control character.
Claim 10
Dependent Claim
43 words
A method according to claim 1 wherein said trail header begins with a destination control character which follows immediately after an end-branch control character in said lead header, and wherein said first output channel is selected in response to said destination control character.
Claim 11
Dependent Claim
45 words
A method according to claim 1 wherein said modified trail header as sent on said first output channel is formed by the substep of modifying a destination control character at the start of said trail header to reflect the selection of said first output channel.
Claim 12
Dependent Claim
42 words
A method according to claim 1 wherein said trail header includes multiple pairs of start-branch and end-branch control characters with each such pair indicating the presence of a nested subheader; and wherein all such pairs remain unchanged in said modified trail header.
Claim 13
Dependent Claim
49 words
A method according to claim 1 and further including the substeps of identifying a destination control character, at the start of said lead header, as being a particular one of two different destination control characters; and, sending said stored data to a predetermined third output channel in response thereto.
Claim 14
Dependent Claim
25 words
A method according to claim 1 wherein all of said steps are performed by digital logic circuits under the control of a digital state machine.
Claim 15
Dependent Claim
38 words
A method according to claim 1 wherein on at least two of said input channels, respective messages are received at the same time and wherein for each such message, said steps are respectively performed at the same time.
References Cited (Backward Citations)
US4598400A
Cited
US4814973A
Cited
US4933933A
Cited
US5117420A
Cited
US5111198A
Cited
US5105424A
Cited
US5347450A
Cited
US5175733A
Cited
US5500860A
Cited
US5440548A
Cited
US5309433A
Cited
US5436893A
Cited
US5425021A
Cited
US5483522A
Cited
US5487064A
Cited
US5511168A
Cited
US5546596A
Cited
US5513322A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-08-18 | 2001-02-17 | 2001-08-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-08-18 | 2005-02-17 | 2005-08-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-08-18 | 2009-02-17 | 2009-08-19 | $7700.00 | Window Closed / Lapsed |