Patent US6408002B1 successfully refreshed from Google Patents.
US6408002B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Torus routing element error handling and self-clearing with missing or extraneous control code feature
Assignee: Fujitsu Siemens Computers Inc
•
Filing: 1998-06-24
•
Granted: 2002-06-18
•
Expires: 2018-06-24
Abstract
Abstract In a massively parallel processing (MPP) system, bandwidth efficiency and message packet latency rates are improved by providing routing elements that detect, isolate and identify various routing errors. More specifically, system lock-up, caused by corrupted message packets, can be prevented by analyzing a given sequence of message packet codes and words as they are received by an input buffer associated with a routing element. By analyzing the sequence, it is possible to determine whether a tail code fails to arrive in the prescribed sequence. If a tail code has been received in a way that is inconsistent with an expected sequence, all of the message packet codes and words received at the buffer can be discarded until a valid message packet start code is received.
Inventors
- 👤 Marc Alan Quattromani
- 👤 Jeffery L. Moll
- 👤 Mark S. Myers
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 06:21
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/06; G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368; G06F15/17381
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
194 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, a method for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet contains a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said method comprising the steps of: analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; determining whether a start code fails to arrive in a sequence that is consistent with an expected sequence; and discarding all codes and words received at the input buffer until a valid start code is received; determining whether a start code is received by the input buffer in a sequence that is inconsistent with the expected sequence; if it is determined that a start code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, inserting a tail code into the message packet just prior to the start code, wherein the tail code indicates that the message packet is corrupted.
Claim 2
Dependent Claim
194 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, a method for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet contains a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said method comprising the steps of: analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; determining whether a start code fails to arrive in a sequence that is consistent with an expected sequence; and discarding all codes and words received at the input buffer until a valid start code is received; determining whether a start code is received by the input buffer in a sequence that is inconsistent with the expected sequence; if it is determined that a start code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, inserting a tail code into the message packet just prior to the start code, wherein the tail code indicates that the message packet is corrupted.
Claim 3
Dependent Claim
35 words
The method of claim 1 further comprising the step of: routing the message packet to its intended destination within the network, wherein the error indication in the tail code will be detected at the destination.
Claim 4
Dependent Claim
33 words
The method of claim 1 , wherein the extraneous start code indicates the beginning of a second message packet, and wherein the second message packet is routed to a destination within the network.
Claim 5
Dependent Claim
136 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, a method for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet contains a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said method comprising the steps of: analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; determining whether a tail code fails to arrive in a sequence that is consistent with an expected sequence; generating a tail code that indicates the message packet is corrupted; and inserting the generated tail code into the message packet; and routing the message packet to its intended network destination.
Claim 6
Dependent Claim
136 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, a method for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet contains a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said method comprising the steps of: analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; determining whether a tail code fails to arrive in a sequence that is consistent with an expected sequence; generating a tail code that indicates the message packet is corrupted; and inserting the generated tail code into the message packet; and routing the message packet to its intended network destination.
Claim 7
Dependent Claim
71 words
The method of claim 4 further comprising the steps of: determining whether a tail code has been received by the input buffer in a sequence that is inconsistent with the expected sequence; and if it is determined that a tail code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, routing the message packet terminated by the extraneous tail to a network destination.
Claim 8
Dependent Claim
26 words
The method of claim 5 further comprising the step of: identifying the message packet as a corrupted message packet in accordance with an error check code.
Claim 9
Dependent Claim
36 words
The method of claim 5 further comprising the step of: discarding all codes and words received by the input buffer following the extraneous tail code, until a valid start code is received by the input buffer.
Claim 10
Dependent Claim
211 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, an apparatus for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet includes a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said apparatus: logic means for analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; code detection means for determining whether a start code fails to arrive in a sequence that is consistent with an expected sequence; and error avoidance means for discarding all codes and words received at the input buffer until a valid start code is received; second code detection means for determining whether a start code is received by the input buffer in a sequence that is inconsistent with the expected sequence; if it is determined that a start code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, code generation means for inserting a tail code into the message packet just prior to the extraneous start code, wherein the tail code indicates that the message packet is corrupted.
Claim 11
Dependent Claim
211 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, an apparatus for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet includes a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said apparatus: logic means for analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; code detection means for determining whether a start code fails to arrive in a sequence that is consistent with an expected sequence; and error avoidance means for discarding all codes and words received at the input buffer until a valid start code is received; second code detection means for determining whether a start code is received by the input buffer in a sequence that is inconsistent with the expected sequence; if it is determined that a start code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, code generation means for inserting a tail code into the message packet just prior to the extraneous start code, wherein the tail code indicates that the message packet is corrupted.
Claim 12
Dependent Claim
35 words
The apparatus of claim 8 further comprising: routing means for transmitting the message packet to its intended destination within the network, wherein the error indication in the tail code will be detected at the destination.
Claim 13
Dependent Claim
39 words
The apparatus of claim 8 , wherein the extraneous start code indicates the beginning of a second message packet, and wherein said apparatus further comprises routing means for transmitting the second message packet to a destination within the network.
Claim 14
Dependent Claim
149 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, an apparatus for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet includes a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said apparatus comprising: logic means for analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; code detection means for determining whether a tail code fails to arrive in a sequence that is consistent with an expected sequence; code generation means for generating a tail code that indicates the message packet is corrupted; and means for inserting the generated tail code into the message packet; and routing means for transmitting the message packet to its intended network destination.
Claim 15
Dependent Claim
149 words
In a parallel processing system that includes a network of inter-connected message packet routing elements, an apparatus for preventing system lock-up caused by corrupted message packets, wherein an uncorrupted message packet includes a start code at the beginning of the message packet, followed by one or more data words, and a tail code at the end of the message packet, said apparatus comprising: logic means for analyzing a sequence in which message packet codes and words are received by an input buffer associated with a routing element; code detection means for determining whether a tail code fails to arrive in a sequence that is consistent with an expected sequence; code generation means for generating a tail code that indicates the message packet is corrupted; and means for inserting the generated tail code into the message packet; and routing means for transmitting the message packet to its intended network destination.
Claim 16
Dependent Claim
78 words
The apparatus of claim 11 further comprising: second code detection means for determining whether a tail code has been received by the input buffer in a sequence that is inconsistent with the expected sequence; and if it is determined that a tail code has been received by the input buffer in a sequence that is inconsistent with the expected sequence, second routing means for transmitting the message packet terminated by the extraneous tail code to a network destination.
Claim 17
Dependent Claim
25 words
The apparatus of claim 12 further comprising: means for identifying the message packet as a corrupted message packet in accordance with an error check code.
Claim 18
Dependent Claim
38 words
The apparatus of claim 12 further comprising: error avoidance means for discarding message packet codes and words received by the input buffer following the extraneous tail code, until a valid start code is received by the input buffer.
References Cited (Backward Citations)
US6217234B1
Cited
US6055618A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-06-17 | 2005-12-17 | 2006-06-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-06-17 | 2009-12-17 | 2010-06-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-06-17 | 2013-12-17 | 2014-06-18 | $7700.00 | Window Closed / Lapsed |