System for performing asynchronous file operations requested by runnable threads by processing completion messages with different queue thread and checking for completion by runnable threads

• US 5,758,184 A
• Filed: 04/24/1995
• Issued: 05/26/1998
• Est. Priority Date: 04/24/1995
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Cutler, David N., Lucovsky, Mark H., Havens, Darryl E., Vert, John D., Wood, Steven R.
• Primary Examiner(s): Lee, Thomas C.
• Assistant Examiner(s): Ton, David
• Application Number:
  US08/428,314
• Time in Patent Office: 1,128 Days
• Field of Search: 395/200, 395/250, 395/700, 395/155, 395/427, 395/200.08, 395/674, 395/650, 395/826, 395/677
• US Class Current: 710/6
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

A technique for performing multiple simultaneous asynchronous input/output operations in a computer operating system. An input/output completion port object is created and associated with a file descriptor. When I/O services are requested on the file descriptor, completion is indicated by a message queued to the I/O completion port. A process requesting I/O services is not notified of completion of the I/O services, but instead checks the I/O completion port'"'"'s queue to determine the status of its I/O requests. The I/O completion port manages multiple threads and their concurrency.

Claims

1. In a computer system that includes a processor, an operating system and one or more application programs running on said computer system, the operating system being a multi-tasking operating system that supports execution of a plurality of processes with a plurality of runnable threads, where one or more of the runnable threads is used to execute an individual application program, the system further including a memory device coupled to the processor and accessible by said operating system, a method for performing asynchronous file operations comprising:

requesting one or more file operations from one or more of the runnable threads;

on completion of the requested file operation, adding a completion message to a queue object stored in said memory without notifying the runnable thread that requested the file operation, the queue object implementing a multi-tasking concurrency control with a fixed number of queue threads;

processing completion messages in the queue object with a queue thread that is different from the runnable thread which requested the file operation; and

from time to time checking the queue object from the runnable threads for information on completed file operations requested by the runnable threads.

2. The method of claim 1 in which retrieval of completion messages from the queue object is blocked while the number of queue threads used for said processing is at the fixed number of queue threads.

3. The method of claim 1 which includes responding from the queue object to said checking only if the multi-tasking concurrency control is met.

4. The method of claim 1 which includes formatting the completion messages to include data indicating a file handle to which the completed file operation relates, where the file handle is an index into a process-specific table and incorporates a set of access rights granted to a process that owns the handle.

5. The method of claim 1 which includes formatting the completion message to include data indicating the particular file operation that has been completed, the data including the number of bytes read or written, the number of file operation errors, and the file operation context which includes volatile data associated with the execution of the file operation.

6. The method of claim 1 which includes:

requesting a second file operation after requesting a first file operation;

completing the second requested file operation before completing the first requested file operation;

adding a completion message to the queue object relating to completion of the second file operation;

completing the first requested file operation after completion of the second requested file operation; and

adding a completion message to the queue object relating to completion of the first file operation;

wherein an application program can respond to completed file operations in the order completed rather than the order requested by checking the queue object.

7. The method of claim 6 in which the ordering of completion messages in the queue object affects the order of runnable threads used for application program execution.

8. The method of claim 1 which includes:

checking the object queue from an application program; and

responding to completed file operations in the order of their completion, as determined by the ordering of completion messages in the object queue, rather than the original order of the file operation requests.

9. The method of claim 1 in which the requested file operation is executed as part of an existing runnable thread, rather than as a new, independent runnable thread dedicated to the file operation thereby limiting the number of new independent runnable threads allocated by the operating system for completing the file operation requests.

10. The method of claim 1 which includes checking the queue from the application program, where the checking is completed without the application program immediately entering a blocking wait state, and wherein notification of completed file operations is provided to the application as a response to its own inquiry, rather than as an operating system interrupt to awaken the application program.

11. The method of claim 1 in which the requested file operations are any of:

read, write, lock, query information or set information.

12. A computer readable medium having stored therein instructions for causing a computer to perform the method of claim 1.

13. The method of claim 1 wherein the queue object includes two queues:

a first-in-first-out queue for storing the completion messages and a last-in-first-out queue for storing blocked runnable threads.

14. The method of claim 1 further comprising the application programs using the completion messages to determine the state of the file operation and initiate any subsequent actions based on the state of the file operation.

15. The method of claim 1 further comprising:

checking the queue object from an individual runnable thread for information on a requested file operation; and

allowing the individual runnable thread to access information in the queue object for the requested file operation only when the number of queue threads is no more than the fixed number of queue threads used for the multi-tasking concurrency control, and there is a completion message for the requested file operation.

16. The method of claim 1 wherein the fixed threshold number of queue threads in the queue object for multi-tasking concurrency control is specified when the queue object is created, and cannot be altered until the queue object is deleted.

17. In a computer system that includes a processor, an operating system and a plurality of application programs, the operating system being a multi-tasking operating system that supports execution of a plurality of processes with runnable threads which are used to execute the plurality of application programs, a method of performing asynchronous file operations comprising:

creating an input/output completion queue;

creating a plurality of file handles for a plurality of runnable threads desiring to use the services of the input/output completion queue, where the file handle is an index into a process-specific table and incorporates a set of access rights granted to processes that own the handles created for selected ones of the runnable threads; and

associating the plurality of file handles with the input/output completion queue, thereby providing access to input/output services for each of the plurality of runnable threads.

18. A computer readable medium having stored therein instructions for causing a computer to perform the method of claim 17.

19. In a computer system that includes a processor, an operating system and a plurality of application programs, the operating system being a multi-tasking operating system that supports execution of a plurality of processes with a plurality of runnable threads which are used to execute the plurality of application programs, a method of providing concurrency control in a queue object, comprising:

allocating a queue object having a blocked thread queue and a multi-tasking concurrency control, the multi-tasking concurrency control including a fixed number of queue threads;

requesting a service from the queue object from a runnable thread; and

determining whether a first queue thread is available at a first time to process the service request by checking the multi-tasking concurrency control,

and if so, providing the requested service with the first queue thread,

and if not, blocking the runnable thread by placing the runnable thread in the blocked thread queue until a second queue thread is available at a second time, and then

providing the requested service with the second queue thread, and removing the runnable thread from the blocked thread queue.

20. A computer readable medium having stored therein instructions for causing a computer to perform the method of claim 19.

21. The method of claim 19 wherein runnable threads placed in the blocked thread queue are unblocked in a last-in-first-out order.

22. The method of claim 19 further comprising:

providing an executive process in the operating system which dynamically tracks the number of available queue threads using the multi-tasking concurrency control;

determining from the executive process when a first runnable thread is blocked, whether a second runnable thread in the blocked thread queue can unblocked, and if so,

unblocking the second runnable thread, thereby keeping the number of threads in the blocked thread queue at a constant number and preventing the operating system from completing an operating system context switch for the first blocked thread.

23. The method of claim 19 further comprising:

determining whether any blocked threads in the blocked thread queue have been blocked longer than a predetermined threshold time, and if so,

allowing the operating system to swap the operating system resources occupied by the blocked threads which have been blocked longer than a predetermined threshold time secondary storage, thereby increasing the number of operating system resources available to other runnable threads.