Algorithm for Arbitration Priority Adjustment
Original Publication Date: 1986-Nov-01
Included in the Prior Art Database: 2005-Mar-09
An algorithm is used with an arbiter that can dynamically adjust its priority scheme to compensate for changing conditions at a common facility. Facilities to be used with this algorithm include a bus arbiter with Selectable Rotating Highest Priority which references a new location in the PRIORITY ARRAY after every request/grant and elevates the subunit whose address is found in this new location to highest priority, a Priority Array that includes at least one entry for each subunit (identified by its address), the more entries, i.e., addresses for a particular subunit causes that subunit to be elevated to highest priority a larger percentage of the time, and an Activity Register that gives a measure of starvation.