Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals
Livelock-free message routing is provided in a network of interconnected nodes that is flushable in time T. An input message processor generates sequences of at least N time intervals, each of duration T. An input register provides for receiving and holding each input message, where the message is assigned a priority state p during an nth one of the N time intervals. At each of the network nodes a message processor reads the assigned priority state and awards priority to messages with priority state (p-1) during an nth time interval and to messages with priority state p during an (n+1) th time interval. The messages that are awarded priority are output on an output path toward the addressed output message processor. Thus, no message remains in the network for a time longer than T. 4 figures.
- DOE Contract Number:
- W-7405-ENG-36
- Assignee:
- Dept. of Energy, Washington, DC (United States)
- Patent Number(s):
- US 5369745; A
- Application Number:
- PPN: US 7-860391
- OSTI ID:
- 6835530
- Resource Relation:
- Patent File Date: 30 Mar 1992
- Country of Publication:
- United States
- Language:
- English
Similar Records
Eliminating livelock in flushable routing networks
Identifying messaging completion in a parallel computer by checking for change in message received and transmitted count at each node