Bus Arbiter With Dynamic Priority Adjustment
Original Publication Date: 1987-Jan-01
Included in the Prior Art Database: 2005-Jan-31
In the use of large-scale distributive processing, where realtime operation requires different subunits to compete for access from a shared facility, there is a need to adjust priorities in the allocation scheme to compensate for fluctuations of activity in a particular subunit or subunits. The following describes a scheme that allows a particular subunit's priority to be dynamically modified to accommodate these transient changes. After a variable time period, a processor reads the activity registers of subunits 1 through n, which indicate how busy the respective subunits are. The processor then loads the priority array, giving more slots in the array for subunits whose activity registers indicate a higher degree of activity.