Computer system using a queuing system and method for managing a queue and heterogeneous data structures
AssigneeHewlett-Packard Development Company, L.P.
InventorJay C. Brinkmeyer
Life of this patent
Estimating the term…
Abstract
A computer system using a queuing system and method for managing a queue having a plurality of generic queue headers connected together by a plurality of links in a predetermined manner. Each generic queue header may be attached to one of a plurality of data structures. The queuing system also includes a library of queue function calls for controlling the operations of each one of the plurality of generic queue headers.
Claims22
A computer system using a queuing system for managing a queue comprising:
- a plurality of generic queue headers;
- a plurality of links for connecting the generic queue headers in a predetermined manner;
- a plurality of data structures, each data structure attached to one of the generic queue headers;
- and
- a plurality of queue function calls for controlling operations of the plurality of generic queue headers,
- wherein each data structure comprises a search key field, and one of the queue function calls utilizes a search command to scan each data structure attached to one of the generic queue headers until the search command matches the search key field and the operation of the one of the queue function calls is performed.
A queuing system used in an intelligent I 2O driver of a computer system for managing a queue, the queuing system comprising:
- a plurality of queue headers;
- a plurality of links for connecting the queue headers in a predetermined manner;
- a plurality of data structures, each data structure attached to one of the queue headers;
- and
- a plurality of queue function calls for controlling operations of the plurality of queue headers,
- wherein each data structure comprises a search key field, and one of the queue action function calls utilizes a search command to scan each data structure attached to one of the queue headers until the search command matches the search key field and the operation of the one of the queue function calls is performed.
A method for managing a queue having a plurality of queue headers within a computer system comprising the acts of:
- attaching a plurality of data structures to the plurality of queue headers, where each data structure is attached to one of the plurality of queue headers;
- and
- controlling operations of the plurality of queue headers utilizing one of a plurality of queue function calls,
- wherein the act of controlling comprises searching the attached data structures having a search key field using a search command and removing the searched data structure satisfying the search command.
A method for managing a queue having a plurality of queue headers within a computer system comprising the acts of:
- attaching a plurality of data structures to the plurality of queue headers, where each data structure is attached to one of the plurality of queue headers;
- and
- controlling operations of the plurality of queue headers utilizing one of a plurality of queue function calls,
- wherein the act of controlling comprises searching the attached data structures having a search key field using a search command and inserting an additional data structure onto one of the plurality of queue headers.
A method for managing a queue having a plurality of queue headers within a computer system comprising the acts of:
- attaching a plurality of data structures to the plurality of queue headers, where each data structure is attached to one of the plurality of queue headers;
- and
- controlling operations of the plurality of queue headers utilizing one of a plurality of queue function calls,
- wherein the act of controlling comprises searching the attached data structures having a search key field using a search command and reporting a location of the attached data structure satisfying the search command.
A method of managing a queue comprising the acts of:
- creating a plurality of queue headers;
- linking the queue headers to form a queue;
- attaching at least one respective data structure to each of the plurality of queue headers;
- attaching a search key to one of the data structures;
- comparing the search key of each of the data structures against a search query until a match is found;
- and
- performing an operation on one of the plurality of queue headers when the match is found.
A system for managing a queue comprising:
- means for creating a plurality of queue headers;
- means for linking the queue headers to form a queue;
- means for attaching at least one respective data structure to each of the plurality of queue headers;
- means for attaching a search key to one of the data structures;
- means for comparing the search key of each of the data structures against a search query until a match is found;
- and
- means for performing an operation on one of the plurality of queue headers when the match is found.
A tangible medium comprising a computer program, the program comprising:
- a routine for creating a plurality of queue headers;
- a routine for linking the queue headers to form a queue;
- a routine for attaching at least one data structure to each of the plurality of queue headers;
- a routine for attaching a search key to the one of the data structures;
- a routine for comparing the search key of each of the data structures against a search query until a match is found;
- and
- a routine for performing an operation on one of the plurality of queue headers when the match is found.
Dependencies are inferred from the claim text.