Arbitration circuitry

Abstract

Arbitration circuitry is provided for allocating up to M resources to N requesters, where M≥2. The arbitration circuitry comprises group allocation circuitry to control a group allocation in which the N requesters are allocated to M groups of requesters, with each requester allocated to one of the groups; and M arbiters each corresponding to a respective one of the M groups. Each arbiter selects a winning requester from the corresponding group, which is to be allocated a corresponding resource of the M resources. In response to a given requester being selected as the winning requester by the arbiter for a given group, the group allocation is changed so that in a subsequent arbitration cycle the given requester is in a different group to the given group.

Description

BACKGROUNDTechnical Field[0001]The present technique relates to the field of integrated circuits. More particularly, it relates to arbitration circuitry.Technical Background[0002]A computing system or integrated circuit may include at least one point at which there are a certain maximum number M of resources available for allocation to requesters and a certain maximum number N of requesters which may request allocation of a resource in a given arbitration cycle. In cases where the maximum number of resources N is greater than or equal to 2, there can be a design challenge in guaranteeing that any request is allocated to at most one resource.SUMMARY[0003]At least some examples provide arbitration circuitry for allocating resources to requesters, where a maximum number of resources that can be allocated to requesters in a given arbitration cycle is M, a maximum number of requesters requesting allocation of a resource in the given arbitration cycle is N, and M≥2; the arbitration circui...

AI Technical Summary

Benefits of technology

The present invention provides an arbitration circuitry and method for efficiently allocating resources to requesters. It allows a maximum number of resources to be allocated and allows for the allocation of resources to a different group of requests in each allocated cycle, ensuring a fair allocation of resources for future allocation cycles. This invention helps to manage and control resource allocation more effectively, improving the overall efficiency of the allocation process.

Problems solved by technology

In cases where the maximum number of resources N is greater than or equal to 2, there can be a design challenge in guaranteeing that any request is allocated to at most one resource.

Images