Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals
Abstract
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.
- Inventors:
- Issue Date:
- OSTI Identifier:
- 6835530
- Patent Number(s):
- 5369745
- Application Number:
- PPN: US 7-860391
- Assignee:
- Dept. of Energy, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 30 Mar 1992
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER NETWORKS; DATA TRANSMISSION; PERFORMANCE; TIME DELAY; TIME DEPENDENCE; COMMUNICATIONS; 990200* - Mathematics & Computers
Citation Formats
Faber, V. Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals. United States: N. p., 1994.
Web.
Faber, V. Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals. United States.
Faber, V. Tue .
"Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals". United States.
@article{osti_6835530,
title = {Eliminating livelock by assigning the same priority state to each message that is input into a flushable routing system during N time intervals},
author = {Faber, V},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1994},
month = {11}
}