A decomposition approach to non-preemptive real-time scheduling |
| |
Authors: | Xiaoping Yuan Manas C Saksena Ashok K Agrawala |
| |
Affiliation: | (1) IBM, 27709 Research Triangle Park, North Carolina;(2) Department of Computer Science, University of Maryland, 20742 College Park, MD |
| |
Abstract: | Consider the problem of scheduling a set ofn tasks on a uniprocessor such that a feasible schedule that satisfies each task's time constraints is generated. Traditionally, researchers have looked at all the tasks as a group and applied heuristic or enumeration search to it. We propose a new approach called thedecomposition scheduling where tasks are decomposed into a sequence of subsets. The subsets are scheduled independently, in the order of the sequence. It is proved that a feasible schedule can be generated as long as one exists for the tasks. In addition, the overall scheduling cost is reduced to the sum of the scheduling costs of the tasks in each subset.Simulation experiments were conducted to analyze the performance of decomposition scheduling approach. The results show that in many cases decomposition scheduling performs better than the traditional branch-and-bound algorithms in terms of scheduling cost, and heuristic algorithms in terms of percentage of finding feasible schedules over randomly-generated task sets. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|