Method, system, and memory for scheduling and cancelling tasks

• US 20070256075A1
• Filed: 05/01/2006
• Published: 11/01/2007
• Est. Priority Date: 05/01/2006
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Denis, Martin
• Application Number:
  US11/414,216
• Publication Number:
  US 20070256075A1
• Time in Patent Office: Days
• US Class Current: 718/102
• CPC Class Codes: G06F 9/4843 by program, e.g. task dispatcher, supervisor, operating system

Abstract

A memory, system and method for task scheduling and execution, the memory containing a data structure including a scheduling file containing tasks scheduled for execution, and a cancelling file containing references to tasks which execution is cancelled. A scheduler module reads the scheduled tasks of the scheduling file and the cancelled tasks of the cancelling file, and triggers execution of the scheduled tasks not referenced in the cancelling file. The data structure may comprise a plurality of pairs of scheduling and cancelling files, each pair being associated with a time interval. When the scheduler module receives from an application module a task scheduling request for scheduling a task, it writes the task in the task scheduling file. When the scheduler module further receives a task cancelling request for cancelling of the task, it writes the task in the task cancelling file.

Claims

1. A memory containing a scheduling data structure for storing scheduled tasks, the data structure comprising:

a scheduling file containing a plurality of tasks scheduled for execution; and

a cancelling file containing a reference to at least one task of the plurality of tasks of the scheduling file which execution is to be cancelled.

2. The memory claimed in claim 1, wherein the reference to the least one task comprises the at least one task.

3. The memory as claimed in claim 2, wherein the scheduling file and the cancelling file contain tasks which are scheduled for execution and respectively cancelled from execution within a predetermined time interval.

4. The memory as claimed in claim 2, wherein the data structure further comprises a plurality of pairs of one scheduling file and one cancelling file, wherein each pair is associated with a predetermined time interval in which limits are comprised execution times of tasks contained in that pair of one scheduling file and one cancelling file.

5. The memory claimed in claim 2, wherein the memory comprises a file system on a hard disk drive support, the data structured being saved onto the file system.

6. A scheduling system comprising:

a memory containing a scheduling data structure that includes;

a scheduling file containing a plurality of tasks scheduled for execution; and

a cancelling file containing a reference to at least one task of the plurality of tasks of the first scheduling file which execution is to be cancelled; and

a scheduler module in communication with the memory, the scheduler module being operative to read the plurality of tasks scheduled for execution of the scheduling file, to further read the reference to the at least one task of the cancelling file, and to trigger execution of the scheduled tasks of the scheduling file that are not referenced in the cancelling file.

7. The scheduling system claimed in claim 6, wherein the reference to the least one task comprises the at least one task.

8. The scheduling system as claimed in claim 7, wherein the scheduling file and the cancelling file contain tasks which are scheduled for execution and respectively cancelled from execution within a predetermined time interval.

9. The scheduling system as claimed in claim 7, wherein the data structure further comprises a plurality of pairs of one scheduling file and one cancelling file, wherein each pair is associated with a predetermined time interval in which limits are comprised execution times of tasks contained in that pair of one scheduling file and one cancelling file.

10. The scheduling system claimed in claim 7, wherein the memory comprises a file system on a hard disk drive support, the data structured being saved onto the file system.

11. The scheduling system claimed in claim 7, wherein for triggering the execution, the scheduler module subtracts the at least one task read from the cancelling file from the plurality of tasks scheduled for execution read from the scheduling file.

12. The scheduling system claimed in claim 8, wherein the scheduler module reads a current time, and wherein the predetermined time interval immediately follows the current time.

13. The scheduling system claimed in claim 6, further comprising:

an application module operatively connected to the scheduler module, the scheduler module receiving from the application module a task scheduling request that requests the scheduling of a task and responsive to the receipt of the task scheduling request, the scheduler module writes the task in the task scheduling file, the scheduler module further receiving a task cancelling request requesting the cancelling of the task, and responsive to the task cancelling request writes the task in the task cancelling file.

14. The scheduling system claimed in claim 13, wherein the scheduler module extracts from the task scheduling request an execution time of the task and identifies based on the execution time the task scheduling file where the task is to be written, and also extracts from the task cancelling request an execution time of the task and identifies based on the execution time the task cancelling file where the task is to be written.

15. A method for task scheduling and execution comprising the steps of:

a. reading scheduled tasks from a task scheduling file;

b. reading cancelled task from a task cancelling file; and

c. triggering execution of scheduled tasks which are not also cancelled tasks.

16. The method claimed in claim 15, further comprising the step of:

d. prior to step c., subtracting the cancelled tasks from the scheduled tasks.

17. The method claimed in claim 15, wherein the task scheduling file and the task cancelling file contain tasks which are scheduled for execution and respectively cancelled from execution within a predetermined time interval, and the method further comprises the step of:

d. reading a current time;

wherein the predetermined time interval immediately follows the current time.

18. The method as claimed in claim 15, wherein the task scheduling file and the task cancelling file are comprised in a data structure that comprises a plurality of pairs of one scheduling file and one cancelling file, wherein each pair being associated with a predetermined time interval in which limits are comprised execution times of tasks contained in that pair of one scheduling file and one cancelling file.

19. The method claimed in claim 15, wherein the task scheduling file and the task cancelling file are saved in a file system on a hard disk drive support.

20. The method claimed in claim 15, further comprising prior to step a., the steps of:

d. creating a data structure comprising the task scheduling file and the task cancelling file;

e. receiving a task scheduling request that requests the scheduling of a task;

f. writing the task in the task scheduling file;

g. receiving a task cancelling request that requests the cancelling of the task; and

h. writing the task in the task cancelling file.

21. The method claimed in claim 20, wherein:

step f. comprises extracting from the task scheduling request an execution time of the task and identifying based on the execution time the task scheduling file where the task is to be written; and

step h. comprises extracting from the task cancelling request an execution time of the task and identifying based on the execution time the task cancelling file where the task is to be written.