← Back to Patent Explorer
EP0118670A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Priority system for channel subsystem

Assignee: International Business Machines Corp
•
Filing: 1984-01-17
•
Granted: —
•
Expires: 2004-01-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A priority circuit handles requests by three components of a data processing system for access to several resources of the system that can be accessed one at a time on each operating cycle of the system. A logic circuit receives requests by the requesters (30-32) and grants access (64-66) to one requester on a priority basis. The logic circuit has means (39, 62, 63) for establishing a particular priority sequence, and the priority circuit includes means (69,72,73) for stepping the logic circuit through a cycle of different priority sequences. In a repeating cycle of these steps, each requester is given the highest priority at least once. The stepping means (72) is responsive to a control code to establish a particular stepping sequence. In a longer sequence, the lowest priority requester is given the highest priority once and higher priority requesters are given the highest priority several times so that in a complete cycle of steps the requesters have a different relative priority. In shorter cycles, the lowest priority requester is still given highest priority once and the higher priority requesters are given highest priority a few times so that in the shorter cycles the lowest priority requester has a higher relative priority. The priority circuit also includes means (48-53) for matching a request for a resource with the availability of the resource so that a requester contends for priority only if the resource is in fact available.

Inventors

  • 👤 Robert Stanley Capowski
  • 👤 Terrence Keith Zimmerman

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-31 08:41
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/20; G06F13/16; G06F13/18

Claims Analysis

Total Claims: 7
Claim 1
Independent Claim 265 words
Priority system for use in the channel subsystem of a data processing system providing a selectable relative priority between secondary data stagers and an I/O processor for access to the system resources, including logic circuits and lines for granting an operating cycle to a requester on the basis of one of a plurality of priority sequences among the requesters, stepping means for stepping the circuit means through the cycle of priority sequences, and means for changing the stepping sequence, characterized by means for signaling the availability of the resources (33-37), means for signaling a request for one or more of said resources by a requester (30-32), and means (48-53) for matching the requests and the availability signals and signaling a generalized request (line 39) by the requester if a match is found, by means responsive to a generalized request (39, 62, 63) for granting access (64-66) to a requester on the basis of a selected one of all combinations of the priority sequences, means (72 and 73) for controlling said granting means to operate according to a particular priority sequence and for stepping said granting means through said combinations in a predetermined sequence in which one requester (IOP on line 63) has highest priority only once and another requester (SDSl on line 39 or SDS2 on line 62) has highest priority several times, and by means (69) for signaling said controlling means (72 and 73) to omit selected ones of the steps in which said one requester has highest priority, whereby the relative priority of the requesters over a cycle of steps is made variable.
Claim 2
Dependent Claim 265 words
Priority system for use in the channel subsystem of a data processing system providing a selectable relative priority between secondary data stagers and an I/O processor for access to the system resources, including logic circuits and lines for granting an operating cycle to a requester on the basis of one of a plurality of priority sequences among the requesters, stepping means for stepping the circuit means through the cycle of priority sequences, and means for changing the stepping sequence, characterized by means for signaling the availability of the resources (33-37), means for signaling a request for one or more of said resources by a requester (30-32), and means (48-53) for matching the requests and the availability signals and signaling a generalized request (line 39) by the requester if a match is found, by means responsive to a generalized request (39, 62, 63) for granting access (64-66) to a requester on the basis of a selected one of all combinations of the priority sequences, means (72 and 73) for controlling said granting means to operate according to a particular priority sequence and for stepping said granting means through said combinations in a predetermined sequence in which one requester (IOP on line 63) has highest priority only once and another requester (SDSl on line 39 or SDS2 on line 62) has highest priority several times, and by means (69) for signaling said controlling means (72 and 73) to omit selected ones of the steps in which said one requester has highest priority, whereby the relative priority of the requesters over a cycle of steps is made variable.
Claim 3
Dependent Claim 255 words
A priority system for a data processing system according to claim 1, characterized by circuit means for each requester (30-32) for matching requests for access to one or more resources (33-37) with the availability of resources, and means for signaling a general request for the associated requester when a match has been found, by means responsive to the general request signals from each of the requesters (30-32) for granting access to one requester, by a plurality of signal lines (39, 62, 63, 69) and means (Fig. 2) for producing a signal on the lines one at a step in a first predetermined sequence in which each line carries a signal for one step of resource allocation in a repeating cycle of steps, each line corresponding to a particular sequence of priority among the requesters, by said first sequence being longer than the number of combinations of the requesters whereby certain sequences of priority appear more than once in a cycle and different requesters have different priority to resource access during a cycle, by logic means responsive to said signal lines and to said general requests to grant access to one of the requesters in a priority sequence that is established by the particular line carrying a signal for a step, and by means for controlling said means for producing a signal on said lines to operate in a second predetermined sequence in which there are fewer steps than in said first sequence and the relative priority of the requesters during a complete cycle is changed.
Claim 4
Dependent Claim 41 words
The priority system of Claim 2 wherein said means for producing a signal on said lines includes means for producing a signal on a line to grant access to the lowest priority requester on at least one step in each cycle.
Claim 5
Dependent Claim 25 words
The priority system of Claim 3 wherein said means for producing a signal comprises a sequential circuit having a state for each of said lines.
Claim 6
Dependent Claim 23 words
The priority system of Claim 4 wherein said means for controlling includes means for changing the sequence of states in said sequential circuit.
Claim 7
Dependent Claim 23 words
The priority system of Claim 5 wherein said means for controlling includes means for receiving a multi-bit code defining the sequence of states.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag