Linked list based least recently used arbiter
Assignee3Com Corporation
InventorYehuda Moyal
Life of this patent
Estimating the term…
Loading patent…
Assignee3Com Corporation
InventorYehuda Moyal
Estimating the term…
An arbiter utilizing a link list to arbitrate access between multiple data sources and a single destination. The arbiter is of the least recently used type whereby the data source that has not sent data for the longest time is given the highest priority. The arbiter provides an arbitration function in a simple manner and at high speeds. The arbiter utilizes a Non Empty Source Queue (NESQ) list that comprises only sources that are non empty, i.e., that have data ready to send. If a source queue chosen for data transmission still has data to send, it is placed at the end of the NESQ list. When a source queue becomes empty after the transmission of data, the source index is removed from the linked list. Conversely, when a source queue that was previously empty receives a new packet it is added to the end of the linked list.
An arbiter for managing data flow between a plurality of input sources and an output destination, comprising:
An arbiter for managing data flow between a plurality of input sources and an output destination, comprising:
Dependencies are inferred from the claim text.