Variable length arbitration

Patent metadata

Field	Value
Publication number	US-9507742-B2
Application number	US-201213450173-A
Country	US
Kind code	B2
Filing date	Apr 18, 2012
Priority date	Apr 20, 2011
Publication date	Nov 29, 2016
Grant date	Nov 29, 2016

Abstract

In one embodiment, a method determines a plurality of categories for requests for a shared resource being shared by a plurality of entities. A request for the resource is received from an entity in the plurality of entities. The method determines a category in the plurality of categories for the received request. If the received request is determined to be in a first category, the method dispatches the received request to a first arbitration scheme configured to determine an arbitration decision in a first time cycle. If the received request is determined to be in a second category, the method dispatches the received request to a second arbitration scheme configured to determine an arbitration decision in a second time cycle of a different length from the first time cycle.

First claim

What is claimed is:

1. A method comprising:
determining a plurality of categories for requests for a shared resource being shared by a plurality of entities;
receiving a plurality of requests for the resource from the plurality of entities;
determining a category in the plurality of categories for each of the plurality of requests;
providing a first set of requests and a second set of requests from among the plurality of requests, wherein the first set of requests is determined to be in a first category and the second set of requests is determined to be in a second category;
dispatching the first set of requests to a first arbitration scheme, wherein the first arbitration scheme implements a first arbitration algorithm configured to use a first number of clock cycles to determine a first arbitration decision, wherein the first number of clock cycles corresponds to a first amount of time used by the first arbitration scheme to determine the first arbitration decision, and wherein the first arbitration decision identifies a first request to be granted from among the first set of requests; and
dispatching the second set of requests to a second arbitration scheme, wherein the second arbitration scheme implements a second arbitration algorithm configured to use a second number of clock cycles to determine a second arbitration decision, wherein the first number of clock cycles and the second number of clock cycles are different, wherein the second number of clock cycles corresponds to a second amount of time, different from the first amount of time, used by the second arbitration scheme to determine the second arbitration decision, and wherein the second arbitration decision identifies a second request to be granted from among the second set of requests.

2. The method of claim 1 , wherein the first number of clock cycles is fixed and the second number of clock cycles is variable.

3. The method of claim 1 , wherein:
the first number of clock cycles is variable and the second number of clock cycles is variable, and
the first number of clock cycles is less than the second number of clock cycles.

4. The method of claim 1 , wherein the first number of clock cycles is less than the second number of clock cycles.

5. The method of claim 1 , wherein the first arbitration scheme comprises:
arbitrating between the first set of requests to determine the first request, wherein the first request is determined in the first number of clock cycles.

6. The method of claim 5 , wherein arbitrating comprises:
receiving the first set of requests at at least one arbiter;
determining a sub-winner at the at least one arbiter; and
providing the sub-winner as the first request.

7. The method of claim 1 , wherein the second arbitration scheme comprises:
arbitrating between the second set of requests to determine a plurality of sub-winner requests in a first clock cycle from among the second number of clock cycles; and
arbitrating between the plurality of sub-winner requests to determine the second request, wherein the second request is determined in a second clock cycle from among the second number of clock cycles.

8. The method of claim 7 , wherein:
arbitrating between the second set of requests comprises:
receiving portions of the second set of requests at a first level of arbiters;
arbitrating between the portion of the second set of requests to determine a sub-winner at each of the first level of arbiters; and
arbitrating between the plurality of sub-winner requests comprises:
receiving the sub-winner request from each of the first level of arbiters at a second level arbiter; and
arbitrating between the received sub-winner request to determine the second request from the determined sub-winners at the second level arbiter.

9. The method of claim 1 , further comprising:
providing a third set of requests from among the plurality of requests, wherein the third set of requests are determined to be in a third category; and
evaluating a factor associated with a third request from among the third set of requests to determine if the third request should be dispatched to the first arbitration scheme or the second arbitration scheme.

10. The method of claim 9 , wherein evaluating the factor comprises using a weighting or status associated with the third request to determine whether to dispatch the third request to the first arbitration scheme or the second arbitration scheme.

11. The method of claim 10 , wherein the weighting comprises information relating to previously granted requests and the status is associated with a priority or latency associated with the third request.

12. An apparatus, comprising:
logic configured to receive a plurality of requests for a shared resource from a plurality of entities;
logic configured to determine a category in a plurality of categories for each of the plurality of requests, wherein the plurality of categories are for the shared resource being shared by the plurality of entities;
logic configured to provide a first set of requests and a second set of requests from among the plurality of requests, wherein the first set of requests is determined to be in a first category and the second set of requests is determined to be in a second category;
logic configured to dispatch the first set of requests to a first arbitration scheme, wherein the first arbitration scheme implements a first arbitration algorithm configured to use a first number of clock cycles to determine a first arbitration decision, wherein the first number of clock cycles corresponds to a first amount of time used by the first arbitration scheme to determine the first arbitration decision, and wherein the first arbitration decision identifies a first request to be granted from among the first set of requests; and
logic configured to dispatch the second set of requests to a second arbitration scheme, wherein the second arbitration scheme is configured to use a second number of clock cycles to determine a second arbitration decision, wherein the first number of clock cycles and the second number of clock cycles are different, wherein the second number of clock cycles corresponds to a second amount of time, different from the first amount of time, used by the second arbitration scheme to determine the second arbitration decision, and wherein the second arbitration decision identifies a second request to be granted from among the second set of requests.

13. The apparatus of claim 12 , wherein the first number of clock cycles is fixed and the second number of clock cycles is variable.

14. The apparatus of claim 12 , wherein:
the first number of clock cycles is variable and the second number of clock cycles is variable, and
the first number of clock cycles is less than the second number of clock cycles.

15. The apparatus of claim 13 , wherein the first number of clock cycles is less than the second number of clock cycles.

16. The apparatus of claim 12 , wherein the first arbitration scheme comprises:
logic configured to arbitrate between the first set of requests to determine the first request, wherein the first request is determined in the first number of clock cycles.

17. The apparatus of claim 16 , wherein the logic configured to arbitrate comprises:
logic configured to receive the first set of requests at at least one arbiter;
logic configured to determine a sub-winner at the at least one arbiter; and
logic configured to provide the sub-winner as the first request.

18. The apparatus of claim 12 , wherein the second arbitration scheme comprises:
logic c

Assignees

• Zhu Jun
• Cao Joseph Jun
• Lu Sheng
• Marvell World Trade Ltd

Inventors

• Zhu Jun
• Cao Joseph Jun
• Lu Sheng

Classifications

• H03K17/62

  Switching arrangements with several input- output-terminals, e.g. multiplexers, distributors (logic circuits H03K19/00; code converters H03M5/00, H03M7/00) · CPC title

• G06F13/362 Primary

  with centralised access control · CPC title

• G06F12/00

  Accessing, addressing or allocating within memory systems or architectures (digital input from, or digital output to record carriers, e.g. to disk storage units, G06F3/06) · CPC title

• G06F13/14 Primary

  Handling requests for interconnection or transfer · CPC title