Invention Grant
- Patent Title: Selective constant complexity dismissal in task scheduling
-
Application No.: US13478196Application Date: 2012-05-23
-
Publication No.: US09052950B2Publication Date: 2015-06-09
- Inventor: Yariv Bachar , Ilai Harsgor-Hendin , Ehud Meiri , Oded Sonin
- Applicant: Yariv Bachar , Ilai Harsgor-Hendin , Ehud Meiri , Oded Sonin
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Griffiths & Seaton PLLC
- Main IPC: G06F9/46
- IPC: G06F9/46 ; G06F9/48

Abstract:
A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch.
Public/Granted literature
- US20120233620A1 SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING Public/Granted day:2012-09-13
Information query