Method and system for processing planned tasks
A technology for planning tasks and task processing, applied in the direction of multi-programming devices, etc., can solve the problem of low processing efficiency, achieve the effect of improving processing efficiency and saving resource occupancy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0047] figure 1 Shown is a flow chart of a method for processing a planned task in the present invention, including the following steps:
[0048] S101. Receive scheduled task information submitted by a user, and cache the scheduled task information;
[0049] Taking the situation mentioned in the background technology as an example, the user wants the system to execute task1 at 10:00, task2 at 11:00, task3 at 13:00, and task4 at 14:00, and input the scheduled task information into the system. The information should at least include the execution time of the task and the specific execution method of the task. After the system receives the scheduled task information submitted by the user, it can cache the information, for example, in the form of text or list. At this time, the task queue of the system is empty, and S102 is further executed.
[0050] S102, according to the execution time of each planned task, add the task with the earliest execution time to the task queue;
[...
Embodiment 2
[0063] This embodiment will describe a processing method for adding a planned task.
[0064] Users can add new scheduled tasks during system operation. When the system receives the user's new scheduled task information, it will compare the running time t0 of the new task with the running time t1 of the first task in the current task queue. If t0 is earlier than t1, the newly added task will be The task is added to the task queue, otherwise, the task information is cached.
[0065] For example, the current task queue is shown in Table 3. The user adds a task task5 that needs to be executed at 10:50. Since the running time of task5 is earlier than the running time of task3 in the current queue, the system will add the information of task5 to In the task queue, as shown in Table 4:
[0066] the moment
Task
10:50
task5
11:00
task2
[0067] Table 4
[0068] The follow-up system can still process according to the steps described in ...
Embodiment 3
[0070] This embodiment will describe a processing method for deleting a scheduled task.
[0071] After the system receives the user's scheduled task deletion information, it processes it according to the following process:
[0072] Determine whether the task to be deleted is a task in the current task queue. If not, directly delete the task information from the cache. If yes, delete the task from the task queue, and further judge whether there are other tasks in the task queue, if yes, do not perform any action, if not, execute S102.
[0073] Assuming that the current task queue is as shown in Table 3, the system receives the instruction to delete task2, and deletes the relevant information of task2 from the task queue. At this time, there are no other tasks in the task queue, so execute S102 and continue to delete the current The task with the earliest execution time in the cache is added to the task queue.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 