초록 ▼

A method and system for priority arbitration in a computer environment having a shared resource capable of servicing a plurality of devices. In one embodiment, the present invention assigns an initial priority order to the plurality of devices such that those devices have priorities which are distin

A method and system for priority arbitration in a computer environment having a shared resource capable of servicing a plurality of devices. In one embodiment, the present invention assigns an initial priority order to the plurality of devices such that those devices have priorities which are distinct. The present invention then identifies those of the plurality of devices which have issued service requests to the shared resource in a first clock cycle as requesting devices. Provided that there are more than one requesting device in the first clock cycle, the present invention selects one of the requesting devices to be serviced by the shared resource in a second clock cycle following the first clock cycle, where the selected device has the highest of the priorities among the requesting devices based on the initial priority order. The present invention also reassigns the priorities among the plurality of devices such that the selected device is assigned the lowest one of the priorities. This embodiment of the present invention thus provides a novel method and system for single cycle priority arbitration which is fair and which does not require extra memory storage for its implementation.

대표청구항 ▼

1. A method for priority arbitration in a computer environment having a shared resource capable of servicing a plurality of devices, said method comprising the steps of:a) assigning an initial priority order to said plurality of devices such that said plurality of devices have priorities which are d

1. A method for priority arbitration in a computer environment having a shared resource capable of servicing a plurality of devices, said method comprising the steps of:a) assigning an initial priority order to said plurality of devices such that said plurality of devices have priorities which are distinct; b) identifying a plurality of requesting devices from among said plurality of devices, each of said plurality of requesting devices having issued a service request for said shared resource in a first clock cycle; c) provided that there are more than one of said plurality of requesting devices in said first clock cycle, selecting one of said plurality of requesting devices to be serviced by said shared resource in a second clock cycle following said first clock cycle, said selected device having the highest of said priorities among said plurality of requesting devices based on said initial priority order; d) reassigning said priorities among said plurality of devices such that said selected device is assigned the lowest one of said priorities; d1) identifying those of said plurality of devices having said priorities lower than that of said selected device before said step d); d2) reassigning said priorities among said plurality of devices such that those of said plurality of devices identified in said step d1) are assigned the highest ones of said priorities; d3) identifying those of said plurality of devices having said priorities higher than that of said selected device before said step d); and d4) reassigning said priorities among said plurality of devices such that those of said plurality of devices identified in said step d3) are assigned those ones of said priorities which are lower than said priorities of those of said plurality of devices identified in said step d1).