A two-stage dynamic fair arbitration method and system for multi-source concurrent requests

By employing a two-level dynamic fair arbitration method, the request source is divided into a high-bandwidth data group and a control command group. Intra-group polling and fixed-priority arbitration are used, while inter-group dynamic priority arbitration is executed in parallel. This solves the request blocking and starvation problems in multi-source concurrent systems, and achieves efficient, fair and real-time request processing.

CN122432091APending Publication Date: 2026-07-21HUNAN ZHIXUANXIN MICRO TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
HUNAN ZHIXUANXIN MICRO TECHNOLOGY CO LTD
Filing Date
2026-06-24
Publication Date
2026-07-21

AI Technical Summary

Technical Problem

Existing technologies cannot simultaneously achieve efficiency, fairness, and real-time performance in multi-master, multi-source concurrent digital systems. A single arbitration strategy cannot adapt to the differentiated needs of different types of request sources, and there is a lack of starvation detection and fairness recovery mechanisms, leading to request blocking and data source starvation.

Method used

A two-level dynamic fair arbitration method is adopted, which divides the request source into at least two arbitration groups, and uses intra-group round-robin and fixed-priority arbitration strategies respectively. The first-level arbitration is executed in parallel, and the final winning request is selected through dynamic priority arbitration. The request suspension time is monitored in real time and a fairness restoration mechanism is triggered to increase the priority and adjust the inter-group arbitration strategy.

Benefits of technology

It achieves a system throughput of 3.6 GB/s in a 10-source concurrent scenario, reduces the average transmission latency to 18 clock cycles, achieves a fairness index of up to 0.92, reduces the request packet loss rate to 0%, controls the response latency of high-priority requests to within 2 clock cycles, and supports cross-platform adaptation for 2 to 32 request sources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122432091A_ABST
    Figure CN122432091A_ABST
Patent Text Reader

Abstract

The application belongs to the technical field of integrated circuit design and on-chip bus arbitration, and particularly relates to a two-stage dynamic fair arbitration method and system for multiple-source concurrent requests, which aims to solve the problems that the existing single arbitration strategy cannot consider fairness and real-time performance, lacks starvation guarantee, and has low scheduling efficiency. The application divides multiple-source requests into at least two arbitration groups, each group performs first-stage intra-group arbitration in parallel, and outputs the winning request in the group; the second stage adopts a dynamic priority arbitration strategy to make a decision on all winning requests in the group, and outputs the final winner. Meanwhile, the request suspension duration of each request source is monitored in real time, and when any request source exceeds a preset starvation threshold, the priority of the request source in the group and between groups is increased, and a timeout forced scheduling mechanism is triggered. Through the two-stage parallel architecture and closed-loop feedback, the application realizes a constant arbitration delay of 2 clock cycles, a zero packet loss rate, and a highest fairness index of 0.92, and can be universally adapted to various multi-master device digital systems.
Need to check novelty before this filing date? Find Prior Art