Queue with segments for task management
AssigneeHewlett-Packard Development Company, L.P.
InventorMykel John Kramer
Life of this patent
Estimating the term…
Abstract
A method that includes configuring a queue into a plurality of segments, wherein each segment is associated with a depth factor which defines number of entries of task elements capable of being added in each segment, and wherein each segment is associated with a requirement factor; generating a plurality of task elements, each task element having an importance factor; and if a value of an importance factor of a task element is at least equal to a value of a requirement factor of a segment with an available entry to add the task element, then adding the task element in the entry of the segment.
Claims20
An electronic device, comprising:
- a queue implemented in hardware to be configured to have a queue data structure to support a plurality of entries to add task elements;
- and
- a queue management module implemented in hardware to:
- configure the queue into a plurality of segments, wherein each segment is associated with a depth factor which defines a number of entries of task elements capable of being added in each segment, wherein the queue initially has no task elements and any task element satisfying a requirement factor of one of the plurality of segments is capable of being placed on an entry of the one of the plurality of segments, and wherein each segment is associated with a requirement factor;
- generate a plurality of task elements, each task element having an importance factor, wherein after the task elements have been added to the queue, a minimum importance factor required for a new task element to be added to the queue increases;
- and
- when a value of an importance factor of a task element is at least equal to a value of the requirement factor of a segment with an available entry to add the task element, then add the task element in the available entry of the segment.
A method of managing a queue in an electronic device, the method comprising:
- configuring, by a processor, the queue into a plurality of segments, wherein each segment is associated with a depth factor which defines a number of entries of task elements capable of being added in each segment, and wherein each segment is associated with a requirement factor;
- generating, by the processor, a plurality of task elements, each task element having an importance factor;
- increasing, by the processor, a minimum importance factor required for a new task element to be added to the queue after the task elements are added to the queue;
- and
- when a value of an importance factor of a task element is at least equal to a value of the requirement factor of a segment with an available entry to add the task element, then adding, by the processor, the task element in the available entry.
A non-transitory computer-readable medium having computer executable instructions stored thereon to manage a queue, the instructions are executable by a processor to:
- configure the queue into a plurality of segments, wherein each segment is associated with a depth factor which defines a number of entries of task elements capable of being added in each segment, and wherein each segment is associated with a requirement factor;
- generate a plurality of task elements, each task element having an importance factor;
- increase a minimum importance factor required for a new task element to be added to the queue after the task elements are added to the queue;
- when a value of an importance factor of a task element is at least equal to a value of the requirement factor of a segment with an available entry to add the task element, then add the task element in the available entry;
- and
- not accept a task element with a lower importance factor in a segment with a higher requirement factor relative to the lower importance factor until the queue catches up or a depth of the queue increases because work satisfying a higher requirement is requested.
Dependencies are inferred from the claim text.