| 摘要 |
An EDF scheduling method comprising the steps of: checking the number of tasks to be scheduled; allocating priorities to the tasks; updating current time as the lowest priority; and processing the tasks in a shortest-deadline-first order from the updated lowest priority on a temporal axis. A time indicator for indicating the lowest priority level is set in current time and corresponding tasks are searched towards a clockwise direction thus to process the firstly searched task firstly, thereby minimizing a runtime overhead by a priority re-allocation.
|
