Distributed least choice first arbiter
US7006501B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 21, 2000 |
| Grant date | Feb 28, 2006 |
| Priority date | — |
| Expiry date | Oct 17, 2022 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F13/368
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A distributed arbiter prioritizes requests for resources based on the number of requests made by each requester. Each resource gives the highest priority to servicing requests made by the requester that has made the fewest number of requests. That is, the requester with the fewest requests (least number of choices) is chosen first. Resources may be scheduled sequentially or in parallel. If a requester receives multiple grants from resources, the requester may select a grant based on resource priority, which is inversely related to the number of requests received by a granting resource. In order to prevent starvation, a round robin scheme may be used to allocate a resource to a requester, prior to issuing grants based on requester priority.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.