Dynamic Bus Arbitration Using Remaining Time and Data Size

The patent implements dynamic priority adjustment where the arbiter continuously monitors the number of times each master has accessed the bus and modifies priority levels accordingly. High-priority masters temporarily reduce their priority after sufficient access, allowing low-priority masters to access the bus, creating a time-varying priority scheme that balances bandwidth assurance with fair access time distribution.

The arbitration system incorporates feedback mechanisms where the arbiter counts bus access occurrences for each master and uses this information to adjust future arbitration decisions. The system feeds back access statistics to the priority determination logic, enabling adaptive priority assignment that responds to actual bus utilization patterns and ensures both bandwidth guarantees and reasonable access times for all masters.

The system transitions from static equal-priority round robin to dynamic priority arbitration where priority levels change based on historical access patterns. Masters that have accessed the bus fewer times receive higher priority, while those with sufficient access see their priority reduced, creating a dynamic balancing mechanism that maintains fairness while allowing bandwidth-intensive masters to receive adequate resources.

The arbitration system changes the priority parameter dynamically based on access count statistics. Instead of maintaining constant equal priorities, the system modifies priority values as a function of accumulated access history, enabling the same arbitration framework to adapt between fairness-oriented and bandwidth-assurance-oriented behavior based on current system state.

The arbitration system implements self-adjusting priority levels that automatically respond to bus access patterns without external intervention. The arbiter autonomously monitors access counts and modifies priorities based on predefined criteria, eliminating the need for complex external control logic or manual configuration while achieving weighted bandwidth allocation through simple count-based decision rules.

The system uses simple parameter changes (access count increments and threshold comparisons) to achieve complex bandwidth allocation behavior. Instead of implementing sophisticated weighted scheduling algorithms, the patent modifies priority parameters based on basic counting logic, reducing control complexity while maintaining effective bandwidth distribution according to master requirements.