Invention Grant
- Patent Title: Task dispatching based on composite queue size and upper and lower compare values
- Patent Title (中): 基于复合队列大小和上下比较值的任务调度
-
Application No.: US12569524Application Date: 2009-09-29
-
Publication No.: US08990821B2Publication Date: 2015-03-24
- Inventor: Robert A. Blackburn , Robert O. Dryfoos , Mark Gambino , Michael J. Shershin
- Applicant: Robert A. Blackburn , Robert O. Dryfoos , Mark Gambino , Michael J. Shershin
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Fleit Gibbons Gutman Bongini & Bianco PL
- Agent Jeffrey Giunta
- Main IPC: G06F9/46
- IPC: G06F9/46 ; G06F9/50

Abstract:
A method and system is disclosed for dispatching tasks to multiple processors that all share a shared memory. A composite queue size for multiple work queues each having an associated processor is determined. A queue availability flag is stored in shared memory for each processor work queue and is set based upon the composite queue size and the size of the work queue for that processor. Each queue availability flag indicates availability or unavailability of the work queue to accept new tasks. A task is placed in a selected work queue based on that work queue having an associated queue availability flag indicating availability to accept new tasks. The data associated with task dispatching is maintained so as to increase the likelihood that valid copies of the data remain present in each processor's local cache without requiring updating do to their being changed by other processors.
Public/Granted literature
- US20110078700A1 TASK DISPATCHING IN MULTIPLE PROCESSOR SYSTEMS Public/Granted day:2011-03-31
Information query