Non-preemption of a group of interchangeable tasks in a computing device
First Claim
Patent Images
1. A method comprising:
- identifying a first task that is one of executing and scheduled to execute on a processor during a first time slice;
identifying a second task scheduled to be executed on the processor during a subsequent time slice immediately adjacent to the first time slice, the first time slice occurring before the subsequent time slice;
comparing the first task to the second task;
identifying whether the first task and the second task are interchangeable tasks based on the comparison, wherein interchangeable tasks share context information and belong to a common job;
executing the first task during the subsequent time slice in response to the first task and the second task being identified as interchangeable tasks;
assigning the first task and the second task to adjacent time slices in response to the first task and the second task being identified as interchangeable tasks; and
suppressing delivery of an interrupt signal at the end of the first time slice in response to the first task and the second task being identified as interchangeable tasks,wherein the first task executes during the subsequent time slice in response to the first task and the second task being identified as interchangeable tasks.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for non-preemption of interchangeable tasks is disclosed. The method for non-preemption of interchangeable tasks includes identifying a first task assigned to a first time slice, identifying a second task assigned to a subsequent time slice, comparing the first task to the second task, identifying whether the first task and the second task are interchangeable tasks, and executing the first task during the subsequent time slice in response to the first task and the second task being interchangeable. The first task may be currently executing on a processor or may be scheduled to execute on the processor.
-
Citations
11 Claims
-
1. A method comprising:
-
identifying a first task that is one of executing and scheduled to execute on a processor during a first time slice; identifying a second task scheduled to be executed on the processor during a subsequent time slice immediately adjacent to the first time slice, the first time slice occurring before the subsequent time slice; comparing the first task to the second task; identifying whether the first task and the second task are interchangeable tasks based on the comparison, wherein interchangeable tasks share context information and belong to a common job; executing the first task during the subsequent time slice in response to the first task and the second task being identified as interchangeable tasks; assigning the first task and the second task to adjacent time slices in response to the first task and the second task being identified as interchangeable tasks; and suppressing delivery of an interrupt signal at the end of the first time slice in response to the first task and the second task being identified as interchangeable tasks, wherein the first task executes during the subsequent time slice in response to the first task and the second task being identified as interchangeable tasks. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification