초록 ▼

Resource allocation logic for a computer system including a plurality of processors which share access to, and control of, a plurality of resources, such as disk drive units or busses. The resource allocation logic coordinates the execution of requests received from the processors to avoid resource

Resource allocation logic for a computer system including a plurality of processors which share access to, and control of, a plurality of resources, such as disk drive units or busses. The resource allocation logic coordinates the execution of requests received from the processors to avoid resource sharing inefficiencies and deadlock situations. The allocation logic maintains a "request" queue for each processor, seeking to satisfy all requests quickly and fairly. The queues contain an entry corresponding to each request received from its corresponding processor and an identification of resources that are required by the entry's corresponding request. The allocation logic also maintains a "resources available" status array of resources which are not currently in use by any processors, or are not reserved for future use by any processors. The logic repeatedly compares each entry in the request queues with the entries in the resources available status array to detect an entry in the request queue identifying resources all of which are contained in the resources available status array. Once the allocation logic can satisfy a particular request, it signals a grant to the requesting processor for the resources requested. The requested resources are removed from the resources available status array. Upon conclusion of execution of the granted request, the resources are again released to the resource allocation logic for utilization by other resource requests. Additionally, each request queue contains a list age indicating the relative age of each request queue with respect to the other request queues, and each entry in the request queues includes a request age indicating the relative age of each entry in a request queue with respect to other entries in the request queue. In examining the request queues to identify I/O requests for execution, priority is awarded to entries based on the relative ages of the request queues and request queue entries.

대표청구항 ▼

[ What is claimed is:] [10.] In a disk array system including a plurality of disk array controllers and a plurality of disk drives and busses under the control of a plurality of processors, a method for coordinating the operation of said disk array controllers, said method comprising the steps of:(A

[ What is claimed is:] [10.] In a disk array system including a plurality of disk array controllers and a plurality of disk drives and busses under the control of a plurality of processors, a method for coordinating the operation of said disk array controllers, said method comprising the steps of:(A) establishing a request queue for each disk array controller, each request queue including an entry corresponding to an I/O request received by said disk array system, each entry including an identification of resources that are required by said entry's corresponding I/O request wherein said resources includes disk drives and busses within said disk array system;(B) maintaining a status array, said status array including an entry for each disk drive and bus which is not currently in use by any disk array controller and is not currently reserved for future use by any disk array controller;(C) systematically comparing each entry in said request queues with the entries in said status array to detect an entry in said request queues identifying resources all of which are contained in said status array;(D) granting control of resources identified by said entry detected in step C to the disk array controller associated with the request queue; and(E) executing the I/O request corresponding to the entry identified in step C.