Eliminating livelock by assigning the same priority state to each message that is inputted into a flushable routing system during N time intervals

Patent · 01 January 1994

OSTI ID:869628

Faber, Vance ^[1]

---

1. Los Alamos, NM

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.

• Research Organization: Los Alamos National Laboratory (LANL), Los Alamos, NM
• DOE Contract Number: W-7405-ENG-36
• Assignee: United States of America as represented by United States (Washington, DC)
• Patent Number(s): US 5369745
• OSTI ID: 869628
• Country of Publication: United States
• Language: English

Related Subjects

/709/370/710/
addressed
assigned
assigning
awarded
duration
eliminating
flushable
generates
holding
input
inputted
interconnected
interval
intervals
livelock
livelock-free
message
message routing
messages
network
nodes
nth
output
p-1
path
priority
processor
processor generates
provided
provides
reads
receiving
register
remains
routing
sequences
time
time interval
time intervals