Eliminating livelock by assigning the same priority state to each message that is inputted 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.
- Inventors:
-
- Los Alamos, NM
- Issue Date:
- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- OSTI Identifier:
- 869628
- Patent Number(s):
- 5369745
- Assignee:
- United States of America as represented by United States (Washington, DC)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- W-7405-ENG-36
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- eliminating; livelock; assigning; priority; message; inputted; flushable; routing; time; intervals; livelock-free; provided; network; interconnected; nodes; input; processor; generates; sequences; duration; register; provides; receiving; holding; assigned; nth; reads; messages; p-1; interval; awarded; output; path; addressed; remains; processor generates; time interval; time intervals; message routing; /709/370/710/
Citation Formats
Faber, Vance. Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals. United States: N. p., 1994.
Web.
Faber, Vance. Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals. United States.
Faber, Vance. Sat .
"Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals". United States. https://www.osti.gov/servlets/purl/869628.
@article{osti_869628,
title = {Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals},
author = {Faber, Vance},
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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1994},
month = {1}
}
Works referenced in this record:
Time-Stamp Approach to Store-and-Forward Deadlock Prevention
journal, January 1987
- Blazewicz, J.; Brzezinski, J.; Gambosi, G.
- IEEE Transactions on Communications, Vol. 35, Issue 5
Architecture And Applications Of The HEP Multiprocessor Computer System
conference, July 1982
- Smith, Burton J.
- 25th Annual Technical Symposium, SPIE Proceedings
The chaos router: a practical application of randomization in network routing
journal, March 1991
- Konstantinidou, S.; Snyder, L.
- ACM SIGARCH Computer Architecture News, Vol. 19, Issue 1