Electrical computers and digital data processing systems: input/ – Input/output data processing – Input/output command process
Reexamination Certificate
2001-01-04
2004-04-27
Shin, Christopher B. (Department: 2182)
Electrical computers and digital data processing systems: input/
Input/output data processing
Input/output command process
C710S111000, C710S244000, C711S158000, C707S793000
Reexamination Certificate
active
06728792
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention generally relates to data processing systems, and more particularly relates to methods for servicing queuing requests while prioritizing queue items according to flexible queuing criteria.
2. Description of Related Art
Computing systems commonly utilize queuing when more work is requested in terms of tasks (jobs) than there are resources available to serve or process the work at the time of the job submission, or when the jobs have release dates before which they may not be served by the requested resource(s). A queuing system, however, should not be mistaken for a scheduling system. Instead, a queuing system is typically an integral part of a scheduling system, where the scheduling system determines the number of sort criteria, their respective ranges of values, and the scheduling policy based upon which jobs are retrieved from the queuing system and dispatched for processing.
Typically, a job queue has only one or a few sorting criteria, according to which it places the submitted jobs. For example, priority, job size, expected job duration, are common queuing criteria. There may be high, medium, and low job priorities and within each of these priorities, there may be a small job sub-queue and a large job sub-queue. Then, typically the overall queuing system may allocate job processing resources to each of these sub-queues according to a given schedule.
Unfortunately, since the number and type of queuing criteria for a queuing system is typically fixed in the software code, any attempt at customizing a computing system's queuing mechanisms requires significant technical and programming resources. Additionally, the internal structure of queue items usually is closely tied to the sorting and prioritizing algorithms for a specific queuing system. Hence, a customization of a system would also likely require re-formatting all queue items for a particular system. This is a costly endeavor that typically makes customization, such as to improve performance or to change queuing criteria of a queuing system, prohibitive for many computing systems.
Therefore a need exists to overcome the problems with the prior art as discussed above, and particularly for an improved queuing system that can be quickly and easily customized without necessarily having to change the queuing system software or re-formatting existing queue items.
REFERENCES:
patent: 5623693 (1997-04-01), Ashton et al.
patent: 5630123 (1997-05-01), Hogge
patent: 5706449 (1998-01-01), Liu et al.
patent: 5774121 (1998-06-01), Stiegler
patent: 6003101 (1999-12-01), Williams
patent: 6052147 (2000-04-01), Cheng
patent: 6055533 (2000-04-01), Hogge
patent: 6145031 (2000-11-01), Mastie et al.
patent: 6170042 (2001-01-01), Gaertner et al.
patent: 6301639 (2001-10-01), Cleavinger et al.
patent: 6421676 (2002-07-01), Krishnamurthy et al.
patent: 6442631 (2002-08-01), Neufeld et al.
Nisewaner Karna J.
Shin Christopher B.
LandOfFree
Priority queue with arbitrary queuing criteria does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Priority queue with arbitrary queuing criteria, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority queue with arbitrary queuing criteria will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3202389