Method, system, and apparatus for an adaptive weighted arbiter
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-012/00
G06F-003/00
G06F-013/36
G06F-013/14
G06F-013/38
G06F-005/00
G06F-013/362
출원번호
US-0671971
(2003-09-25)
등록번호
US-7350003
(2008-03-25)
발명자
/ 주소
Gish,David W.
Massa,Don V.
출원인 / 주소
Intel Corporation
대리인 / 주소
Trop, Pruner & Hu, P.C.
인용정보
피인용 횟수 :
6인용 특허 :
12
초록▼
An adaptive weighted arbitration algorithm that is user configurable is discussed. The arbitration logic and algorithm considers past arbitration history events and is dynamic to allow for losing bidders to increase their probability of being selected to access the resource based on an accumulator v
An adaptive weighted arbitration algorithm that is user configurable is discussed. The arbitration logic and algorithm considers past arbitration history events and is dynamic to allow for losing bidders to increase their probability of being selected to access the resource based on an accumulator value and a weight value.
대표청구항▼
What is claimed is: 1. A method for arbitrating a resource comprising: setting n weight values for n bidders in a corresponding one of n registers; setting n accumulator values for the n bidders in a corresponding one of n accumulators, wherein the n accumulator values are based at least in part on
What is claimed is: 1. A method for arbitrating a resource comprising: setting n weight values for n bidders in a corresponding one of n registers; setting n accumulator values for the n bidders in a corresponding one of n accumulators, wherein the n accumulator values are based at least in part on the n weight value; granting one of the n bidders access to the resource based at least in part on the accumulator value, and then decrementing the selected bidder's accumulator value in the selected bidder's accumulator; and incrementing the accumulator value in the n-1 losing bidders' accumulators by one of a plurality of predetermined values, each of the predetermined values based on the accumulator value with respect to one of a plurality of portions of a range of accumulator values in which the corresponding n-1 losing bidder's accumulator value is present wherein a probability of the n-1 losing bidders for accessing the resource is increased based on a respective standing of the accumulator value within the accumulator values for the n-1 losing bidders, wherein the range of accumulator values is based on a quartile, the accumulator value is incremented by one if the accumulator value is within 76-99% of the range, the accumulator value is incremented by two if the accumulator value is within 51-75% of the range, the accumulator value is incremented by three if the accumulator value is within 26-50% of the range, the accumulator value is incremented by four if the accumulator value is within 0-25% of the range. 2. The method of claim 1 wherein the accumulator values are initially set to a midpoint of the range of accumulator values. 3. The method of claim 1, further comprising decrementing the selected bidder's accumulator value by a variable amount corresponding to the weight value for the selected bidder, or zero if the resulting accumulator value would be less than zero. 4. The method of claim 1, further comprising enabling a user to set the n weight values and the n accumulator values. 5. An apparatus to arbitrate access to a resource comprising: a plurality of n registers to store n weight values; a plurality of n accumulators to each receive a request to the resource and to accumulate and store n accumulator values wherein the n accumulator values are based at least in part on the n weight values; a comparator, coupled to the plurality of accumulators, to grant access to one of the requests based at least in part on the past history of granted requests and then accumulator values, wherein each accumulator is to increment or decrement the accumulator value on a per arbitration cycle basis in response to the grant access by the comparator, wherein the past history of granted requests is based on the accumulator's value being incremented if it was not granted access and is based on a quartile analysis as follows: the accumulator value is incremented by one if the accumulator value is within 76-99% of a range for the corresponding accumulator, the accumulator value is incremented by two if the accumulator value is within 51-75% of the range, the accumulator value is incremented by three if the accumulator value is within 26-50% of the range, the accumulator value is incremented by four if the accumulator value is within 0-25% of the range. 6. The apparatus of claim 5 wherein the comparator is to decrement the accumulator value of the accumulator that was granted access to their request in an amount corresponding to the n weight value associated with the accumulator if the resulting accumulator value would be greater than or equal to zero, otherwise the comparator is to decrement the accumulator value to zero. 7. The apparatus of claim 6 wherein the weight value for each accumulator is initially set according to a priority of the request. 8. The apparatus of claim 5 wherein a bidder that is to provide the request is either one of a modem, keyboard, video controller, serial port, or PCMCIA card, SONET interface, Ethernet Interface, content processor, encryption device, or compression device. 9. The apparatus of claim 5 wherein the resource may be an interconnect bus, memory text, or output buffer. 10. The apparatus of claim 5, wherein each of the plurality of n registers is coupled to a corresponding one of the plurality of n accumulators. 11. The apparatus of claim 5, wherein the n weight values and the n accumulator values are to be user configured. 12. An article comprising a storage medium storing instructions that, when executed result in: arbitrating a resource among a plurality of bidders, each one of the bidders with an accumulator value; and granting one of the plurality of bidders access to the resource based at least in part on the accumulator value, and then decrementing the selected bidder's accumulator value, and incrementing the accumulator value by a variable amount for the n-1 losing bidders, the variable amount based on a quartile analysis of the accumulator value with respect to a range of values for the accumulator value, wherein the accumulator value is incremented by a first value if the accumulator value is within a first quartile, the accumulator value is incremented by a second value if the accumulator value is within a second quartile, the accumulator value is incremented by a third value if the accumulator value is within a third quartile, and the accumulator value is incremented by a fourth value if the accumulator value is within a fourth quartile. 13. The article of claim 12 further comprising setting weight values for the plurality of bidders, wherein the weight values are initially set to a priority of each of the plurality of bidders. 14. A system comprising: a processor; a dynamic random access memory, coupled to the processor; a plurality of bidders to access a resource; an arbitration logic with a plurality of n registers to store n weight values to be configured by a user; a plurality of n accumulators to accumulate and store n accumulator values and to each receive a request from the plurality of bidders, wherein the n accumulator values are based at least in part on the n weight values and initial values of the n accumulator values are to be configured by the user; a comparator, coupled to the plurality of n accumulators, to grant access to one of the requests based at least in part on the past history of granted requests and the n accumulator values, wherein the arbitration logic is to decrement the accumulator value of the accumulator associated with the bidder that was granted access to its request in an amount corresponding to the weight value of the corresponding bidder if the resulting accumulator value would be greater than or equal to zero, otherwise the arbitration logic is to decrement the accumulator value to zero, wherein the arbitration logic is to perform a quartile analysis on each of the losing bidders such that the accumulator value associated with each of the losing bidders is incremented by one if the accumulator value is within 76-99% of a range for the corresponding accumulator, the accumulator value is incremented by two if the accumulator value is within 51-75% of the range, the accumulator value is incremented by three if the accumulator value is within 26-50% of the range, the accumulator value is incremented by four if the accumulator value is within 0-25% of the range.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (12)
Cheng Linda, Apparatus and method for limit-based arbitration scheme.
Arimilli Ravi Kumar ; Dodson John Steven ; Lewis Jerry Don ; Williams Derek Edward, Method and system for controlling access to a shared resource in a data processing system utilizing pseudo-random priori.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.