Computer system using a queuing system and method for managing a queue and heterogeneous data structures

• US 20040049516A1
• Filed: 09/09/2003
• Published: 03/11/2004
• Est. Priority Date: 04/09/1998
• Status: Abandoned Application

• Current Assignee: Jay C. Brinkmeyer
• Original Assignee: Jay C. Brinkmeyer
• Inventors: Brinkmeyer, Jay C.
• Application Number:
  US10/658,182
• Publication Number:
  US 20040049516A1
• Time in Patent Office: Days
• US Class Current: 707/100
• CPC Class Codes: G06F 2209/548 Queue
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users

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.

Claims

1. A computer system using a queuing system for managing a queue, said queuing system 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.

2. The queuing system of claim 1, wherein each generic queue header includes a pointer to a next generic queue header, a pointer to a previous generic queue header, and a pointer to the attached data structure.

3. The queuing system of claim 2, wherein each generic queue header includes a dynamic queue header.

4. The queuing system of claim 2, wherein each generic queue header includes a static queue header.

5. The queuing system of claim 1, wherein the plurality of queue function calls includes operations such as insert, remove, search and remove, search and insert, search only and peek.

6. The queuing system of claim 1, wherein each link connecting a pair of the generic queue headers is unidirectional.

7. The queuing system of claim 1, wherein each link connecting a pair of the generic queue headers is bi-directional.

8. The queuing system of claim 1, wherein each data structure includes a search key field, and one of the generic 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.

9. The queuing system of claim 1, wherein said queuing system is used in an operating system or driver.

10. A queuing system used in an intelligent 120 driver of a computer system for managing a queue, said 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 action function calls for controlling operations of the plurality of queue headers.

11. The queuing system of claim 10, wherein each queue header includes a pointer to a next queue header, a pointer to a previous queue header and a pointer to the attached data structure.

12. The queuing system of claim 11, wherein each queue header includes a dynamic queue header.

13. The queuing system of claim 11, wherein each queue header includes a static queue header.

14. The queuing system of claim 10, wherein the plurality of queue action function calls includes operations such as insert, remove, search and remove, search and insert, search only and peek.

15. The queuing system of claim 10, wherein each link connecting a pair of the queue headers is unidirectional.

16. The queuing system of claim 10, wherein each link connecting a pair of the queue headers is bi-directional.

17. The queuing system of claim 10, wherein each data structure includes 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.

18. A method for managing a queue having a plurality of queue headers within a computer system comprising the steps 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.

19. The method of claim 18, wherein the step of attaching includes the following steps:

configuring each data structure for a specific transaction; and

allocating each configured data structure to one of the queue headers including a dynamic queue header.

20. The method of claim 18, wherein the step of controlling includes inserting an additional data structure onto one of the plurality of queue headers.

21. The method of claim 19, wherein the step of controlling includes removing one of the attached data structures from one of the plurality of queue headers.

22. The method of claim 18, wherein the step of controlling includes searching the attached data structures having a search key field using a search command and removing the searched data structure satisfying the search command.

23. The method of claim 18, wherein the step of controlling includes 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.

24. The method of claim 18, wherein the step of controlling includes peeking in a predetermined order at the attached data structures.

25. The method of claim 18, wherein the step of controlling includes 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.