Arrangement and method of arbitration for a resource with shared user request signals and dynamic priority assignment

• US 5,623,672 A
• Filed: 12/23/1994
• Issued: 04/22/1997
• Est. Priority Date: 12/23/1994
• Status: Expired due to Term

• Current Assignee: Cirrus Logic Incorporated
• Original Assignee: Cirrus Logic Incorporated
• Inventors: Popat, Kaushik L.
• Primary Examiner(s): Harvey, Jack B.
• Assistant Examiner(s): PHAN, RAYMOND NGAN
• Application Number:
  US08/363,039
• Time in Patent Office: 851 Days
• Field of Search: 395/725, 395/732, 395/297, 395/304, 395/865, 395/293, 395/291, 395/200.15, 395/295, 395/296, 395/302, 395/303, 395/731, 395/729
• US Class Current: 710/240
• CPC Class Codes: G06F 13/362 with centralised access control

Abstract

A method and apparatus for arbitration among users for a resource has a single shared user request line over which each of the users asserts request signals for use of the resource. Dynamic priority assignment is provided, in which the sequence of users is changed as a function of the last user to use the resource. A time multiplexed format for arbitration is followed, with each user keeping track of which user'"'"'s turn it is to request use of the resource. This prevents starvation of an individual user and allows great flexibility in assigning priority to the users, while reducing pin counts and signal traces.

Claims

1. A shared resource arrangement comprising:

a shared resource;

a plurality of users coupled to the resource;

arbitration logic for arbitrating among the users for use of the resource, the arbitration logic allowing the users to make requests over a single shared request line in a given sequence of said users, and changing said sequence to a new sequence of said users after each use of the resource by one of the users, the requests being for use of the resource.

2. The arrangement of claim 1, wherein the users follow each other in a same defined order within each sequence, the arbitration logic assigning a first position within each said new sequence to the user that follows in said order the user which has most recently used the resource.

3. The arrangement of claim 1, wherein each user has means for generating request signals to the arbitration logic during an arbitration cycle of the arbitration logic.

4. The arrangement of claim 1, wherein the users follow each other in an order defined by a mixed round robin and fixed priority format, in which a group of users has fixed priority over another group of users in each of the sequences, and the users are assigned priority within each group of users such that the last user in the group to use the resource has the lowest priority of that group.

5. The arrangement of claim 1, wherein the users follow each other in an order defined by a round robin between groups and fixed priority within a group, in which a group of users are assigned priority over another group of users such that the last group of users to use the resource has the lowest priority among groups, and the users are assigned a fixed priority within each group of users.

6. The arrangement of claim 1, wherein the users follow each other in an order defined by round robin between groups and round robin within a group, in which a group of users are assigned priority over another group of users such that the last group of users to use the resource has the lowest priority among groups, and the users are assigned priority within each group of users such that the last user in the group to use the resource has the lowest priority of that group.

7. The arrangement of claim 1, wherein the users follow each other in a fixed priority.

8. The arrangement of claim 1, wherein the resource is a bus and the users are bus masters.

9. The arrangement of claim 1, further comprising a single shared request line that couples all of the users together, the arbitration logic receiving said requests over said request line and responding to the received request.

10. The arrangement of claim 3, wherein each user has means for monitoring request signals generated by the other users and a turn counter for tracking a user number associated with the user that is currently allowed to make a request for use of the resource.

11. The arrangement of claim 4, wherein a user belongs to more than one group, and has multiple internal levels of request priority.

12. The arrangement of claim 5, wherein a user belongs to more than one group, and has multiple internal levels of request priority.

13. The arrangement of claim 6, wherein a user belongs to more than one group, and has multiple internal levels of request priority.

14. The arrangement of claim 9, wherein the requests are time multiplexed with the individual users assigned to different time slots in said given sequence.

15. The arrangement of claim 10, wherein each user has means for generating frame signals to the arbitration logic that indicate use of the resource by one of the users.

16. The arrangement of claim 14, wherein the arbitrating for a next use of the resource occurs in parallel with a current use of the resource by one of the users.

17. The arrangement of claim 15, wherein the arbitration logic includes means for resetting the turn counter of each user to a predetermined initial state.

18. The arrangement of claim 17, wherein each user includes means for incrementing the turn counter synchronously with the turn counters of the other users during each cycle of the shared resource arrangement until the means for monitoring detects a request signal generated by one of the users.

19. The arrangement of claim 18, wherein each user includes means for holding the turn counter at the user number associated with the user that generated the request signal.

20. The arrangement of claim 19, wherein each user includes means for releasing the turn counter synchronously with the turn counters of the other users upon the generation of one of said frame signals, said means for incrementing again incrementing the turn counter synchronously in response to the release of the turn counter.

21. The arrangement of claim 20, wherein the users follow each other in a same defined order within each sequence, the arbitration logic assigning a first position within each said new sequence to the user that follows in said order the user which has most recently used the resource, and wherein the means for incrementing starts incrementing at the user number of said user that follows the user which has most recently used the resource.

22. A shared resource arrangement comprising:

a shared resource;

a plurality of users coupled to the resource;

a central arbiter coupled to the plurality of users for arbitrating among the users for use of the resource, the arbiter having a given sequence in which the users are permitted to request use of the resource over a single shared request line, the arbiter changing said sequence to a new sequence after each use of the resource by one of the users.

23. The arrangement of claim 22, further comprising a single shared request line and a single shared acknowledge line, each coupling all of the users to the central arbiter, the central arbiter receiving said requests over said request line and producing acknowledgements of said requests over said acknowledge line.

24. The arrangement of claim 22, wherein each user has means for generating request signals to the arbiter during an arbitration cycle of the arbiter.

25. The arrangement of claim 22, wherein the users follow each other in a same defined order within each sequence, the arbiter assigning a first position within each said new sequence to the user that follows in said order the user which has most recently used the resource.

26. The arrangement of claim 22, wherein the users follow each other in an order defined by a mixed round robin and fixed priority format, in which a group of users has fixed priority over another group of users in each of the sequences, and the users of each group are assigned priority within that group such that the last user in the group to use the resource has the lowest priority of that group.

27. The arrangement of claim 23, wherein the requests are time multiplexed with the individual users assigned to different time slots in said given sequence.

28. The arrangement of claim 24, wherein each user has means for monitoring request signals generated by the other users and a turn counter for tracking a user number associated with the user that is currently allowed to make a request for use of the resource.

29. The arrangement of claim 22, wherein the resource is a bus and the users are bus masters.

30. The arrangement of claim 27, wherein the arbitrating for a next use of the resource occurs in parallel with a current use of the resource by one of the users.

31. The arrangement of claim 28, wherein the arbiter includes means for resetting the turn counter of each user to a predetermined initial state.

32. The arrangement of claim 30, wherein the users follow each other in a same defined order within each sequence, the arbiter assigning a first position within each said new sequence to the user that follows in said order the user which has most recently used the resource.

33. The arrangement of claim 31, wherein each user includes means for incrementing the turn counter synchronously with the turn counters of the other users during each cycle of the shared resource arrangement until the means for monitoring detects a request signal generated by one of the users.

34. The arrangement of claim 33, wherein each user includes means for holding the turn counter at the user number associated with the user that generated the request signal.

35. The arrangement of claim 34, wherein each user includes means for releasing the turn counter synchronously with the turn counters of the other users upon the production of said acknowledgement, said means for incrementing again incrementing the turn counter synchronously in response to the release of the turn counter.

36. A method of arbitrating among users for a shared resource, the method comprising:

a. assigning time slots to the users in a sequence;

b. sequencing through the time slots according to the sequence, each user able to issue a request only during the time slot assigned to that user;

c. accepting a request from a user issuing a request during the time slot assigned to said user and allowing the user to use the shared resource;

d. changing the sequence of users after use of the shared resource by the user allowed to use the shared resource; and

e. repeating steps b-d.

37. The method of claim 36, wherein the sequence is changed such that the users follow each other in a same defined order within each sequence, the step of changing the sequence including assigning a first position within each changed sequence to the user that follows in said order the user which has most recently used the resource.

38. The arrangement of claim 36, wherein the sequence is changed such that the users follow each other in an order defined by a mixed round robin and fixed priority format, in which a group of users has fixed priority over another group of users in each of the sequences, and the users are assigned priority within each group of users such that the last user in the group to use the resource has the lowest priority of that group.

39. The method of claim 36, wherein users are able to issue the request on a single request line, the accepting step comprising receiving the request from the single request line.