Balancing mechanisms in ordered lists of dispatch queues in a computational device
AssigneeInternational Business Machines Corporation
InventorsSeamus J. Burke, Trung N. Nguyen, Louis A. Rasor
Life of this patent
Estimating the term…
Abstract
A plurality of dispatch queues corresponding to a plurality of processing entities are maintained, wherein each dispatch queue includes one or more task control blocks or is empty, and wherein an ordered list of dispatch queues is maintained for each processing entity of the plurality of processing entities. A state for each of the plurality of dispatch queues is determined and the determined state is compared to a desired state for the plurality of dispatch queues. A task control block is moved from one dispatch queue to another dispatch queue, in response to the comparing of the determined state to the desired state for the plurality of dispatch queues.
Claims20
A method, comprising:
- maintaining a plurality of dispatch queues corresponding to a plurality of processing entities, wherein each dispatch queue includes one or more task control blocks or is empty, and wherein an ordered list of dispatch queues is maintained for each processing entity of the plurality of processing entities;
- determining a state for each of the plurality of dispatch queues and comparing the determined state to a desired state for the plurality of dispatch queues;
- and
- moving a task control block from one dispatch queue to another dispatch queue, in response to the comparing of the determined state to the desired state for the plurality of dispatch queues.
A system, comprising:
- a memory;
- and
- a processor coupled to the memory, wherein the processor performs operations, the operations comprising:
- maintaining a plurality of dispatch queues corresponding to a plurality of processing entities, wherein each dispatch queue includes one or more task control blocks or is empty, and wherein an ordered list of dispatch queues is maintained for each processing entity of the plurality of processing entities;
- determining a state for each of the plurality of dispatch queues and comparing the determined state to a desired state for the plurality of dispatch queues;
- and
- moving a task control block from one dispatch queue to another dispatch queue, in response to the comparing of the determined state to the desired state for the plurality of dispatch queues.
A computer program product, the computer program product comprising a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code configured to perform operations, the operations comprising:
- maintaining a plurality of dispatch queues corresponding to a plurality of processing entities, wherein each dispatch queue includes one or more task control blocks or is empty, and wherein an ordered list of dispatch queues is maintained for each processing entity of the plurality of processing entities;
- determining a state for each of the plurality of dispatch queues and comparing the determined state to a desired state for the plurality of dispatch queues;
- and
- moving a task control block from one dispatch queue to another dispatch queue, in response to the comparing of the determined state to the desired state for the plurality of dispatch queues.
Dependencies are inferred from the claim text.