Electrical computers and digital data processing systems: input/ – Access arbitrating
Reexamination Certificate
1999-12-16
2004-01-13
Gaffin, Jeffrey (Department: 2182)
Electrical computers and digital data processing systems: input/
Access arbitrating
C710S014000, C710S022000, C710S028000, C710S040000, C710S107000, C710S111000, C710S310000
Reexamination Certificate
active
06678774
ABSTRACT:
TECHNICAL FIELD
The present invention relates in general to shared resource access arbitration and in particular to methods and systems for providing flexibility to match the needs of a plurality of agents or requesters, each attempting to use a shared and common resource, such as memory in a data processing system.
BACKGROUND
An arbiter controls the granting of access to a shared resource, such as memory or a communication bus, among a number of agents or requesters. In the case of a memory resource, such requesters could include central processing units (CPUs), screen refresh DMA (direct memory access) processor, 3D drawing block DMA processor, 2D drawing block DMA processor, USB Interface, Ethernet Interface, and so forth. Each of these units contend for the common resource, but the requirements of each agent or requestor may change in accordance with the type of data processing being accomplished at any given time.
Known current methods for performing the arbitration task typically use complicated and inflexible scheduling techniques or else use extremely simple schemes that do not adapt well to changing system load. Examples of such techniques are designated in the art as “round robin,” fixed priority, multilevel priority, requester priorities that change based on the previous winner of the arbitrated resource, and so forth. One complicated arbitration system has dynamically switched between different ones of some of the aforementioned arbitration schemes depending upon system requirements at a given time.
It would be desirable to have a simple arbitration scheme that provides inherent flexibility to changing system requirements for a given set of agents or resource requesters while still allowing the addition of further agents where necessary to perform newly assigned tasks.
SUMMARY OF THE INVENTION
The present invention comprises a list driven arbitration method that can operate in at least two modes. In a boot mode, a list is used comprising all possible requesters and the arbiter uses a simple technique, such as “round robin,” to allocate the shared resource during the system initialization process. After initialization, the different or second list used specifies specific agents that will be allowed to access the shared resource. This second list, which typically will designate fewer unique agents than the boot list, can be dynamically changed, both as to agents named and as to interpretation of the list to allow great flexibility in accordance with system load requirements.
REFERENCES:
patent: 4787033 (1988-11-01), Bomba et al.
patent: 5148545 (1992-09-01), Herbst et al.
patent: 5303382 (1994-04-01), Buch et al.
patent: 5649206 (1997-07-01), Allen
patent: 5664121 (1997-09-01), Cerauskis
patent: 5729702 (1998-03-01), Creedon et al.
patent: 5987549 (1999-11-01), Hagersten et al.
patent: 6311249 (2001-10-01), Min et al.
patent: 6349297 (2002-02-01), Shaw et al.
patent: WO9635173 (1996-11-01), None
Farooq Mohammad O.
Gaffin Jeffrey
Koninklijke Philips Electronics , N.V.
LandOfFree
Shared resource arbitration method and apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Shared resource arbitration method and apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shared resource arbitration method and apparatus will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3238968