Back to results
US 2004/0210696 A1Published application
Method and apparatus for round robin resource arbitration
OwnerMichael J. Meyer, Drew Wingard +1inventors
InventorsMichael J. Meyer, Drew Wingard, Wolf-Dietrich Weber
Life of this patent
Estimating the term…
Abstract
A method and apparatus for a round robin resource arbitration scheme is described. An apparatus to provide round robin token arbitration comprises at least two token arbiters, each token arbiter associated with a node to which at least two sub-trees are connected, each sub-tree comprising a token arbiter or a finite state machine requestor.
Claims28
An apparatus to provide round robin token arbitration comprising:
- at least two token arbiters, each token arbiter associated with a node to which at least two sub-trees are connected, each sub-tree comprising a token arbiter or a requestor.
An arbiter for a system-on-a-chip (SOC) comprising:
- a root token arbiter having at least two downstream connectors to receive sub-trees;
- a token arbiter coupled to one of the connectors of the root token arbiter, the token arbiter having at least two downstream connectors to receive sub-trees;
- wherein each sub-tree comprises a token arbiter or a requestor.
An arbiter comprising:
- a first token arbiter to receive a local requester and at least a second token arbiter;
- a second token arbiter coupled to the first token arbiter, the second token arbiter to receive at least two requesters.
A system-on-a-chip (SOC) comprising:
- a plurality of logical units;
- a shared resource accessed by the plurality of logical units;
- an arbitration logic to arbitration the shared resource, the arbitration logic comprising:
- a finite state machine associated with each of the plurality of logical units, to generate requests for the shared resource and indicate to the logical unit when the shared resource is available for use;
- the finite state machines tied together in a tree structure using token arbiters, each token arbiter having associated with it at least two sub-trees, a sub-tree comprising the finite state machine or another token arbiter.
2 more elements
A tree-structured arbiter comprising:
- a plurality of finite state machines comprising leaf nodes of the tree-structured arbiter, each finite state machine associated with a requestor, the finite state machine passing a state upstream with a two-wire connection;
- a plurality of token arbiters comprising a root node and branch nodes, a token arbiter to receive a two-wire connection from a finite state machine, the token arbiter to determine when to grant the token to the finite state machine.
Dependencies are inferred from the claim text.