Global to push GA events into
skip to main content

Title: Eliminating livelock by assigning the same priority state to each message that is inputted 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.
Inventors:
 [1]
  1. (Los Alamos, NM)
Issue Date:
OSTI Identifier:
869628
Assignee:
United States of America as represented by United States (Washington, DC) LANL
Patent Number(s):
US 5369745
Contract Number:
W-7405-ENG-36
Research Org:
Los Alamos National Laboratory (LANL), Los Alamos, NM
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/