Browse Prior Art Database

Bus Arbiter With Dynamic Priority Adjustment

IP.com Disclosure Number: IPCOM000038322D
Original Publication Date: 1987-Jan-01
Included in the Prior Art Database: 2005-Jan-31
Document File: 2 page(s) / 39K

Publishing Venue

IBM

Related People

Malmquist, CA: AUTHOR [+2]

Abstract

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.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Bus Arbiter With Dynamic Priority Adjustment

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. The rotating arbiter [*] parcels out highest priority with a frequency proportional to the number of slots in the priority array dedicated to a particular subunit. This scheme uses some additional hardware with software to support the reading of the subunit activity registers, the analysis of the activity, and the final writing of the priority array. Reference C. A. Malmquist and J.
D. Wilson, "Bus Arbiter

with Selectable Rotating Highest Priority," IBM

Technical Disclosure Bulletin 27, 7B, 4470-4471

(December 1984).

1

Page 2 of 2

2

[This page contains 3 pictures or other non-text objects]