|
Published Articles >> Table of Contents >> Abstract
28th Hawaii International Conference on System Sciences (HICSS'95)
p. 143
Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs
S. Ronngren, Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
B.A. Shirazi, Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375468
Send link to a friend
| Abstract |
|
The problem of allocating and scheduling real-time tasks, with precedence constraints and communication costs on a multiprocessor architecture in order to meet the timing constraints is known to be NP-complete. Due to the growing complexity of real-time applications there is a need to find scheduling methods that can handle large task sets in a reasonable time. Also, scheduling methods should consider precedence and exclusion relations in order to support parallelism within tasks and to resolve mutual exclusion situations. In this paper four heuristic scheduling algorithms are developed and evaluated. In particular clustering vs. non-clustering techniques are investigated with some interesting results.
|
 Additional Information
|
Index Terms- processor scheduling; real-time systems; resource allocation; multiprocessing systems; communication complexity; static multiprocessor scheduling; periodic real-time tasks; precedence constraints; communication costs; task allocation; multiprocessor architecture; timing constraints; NP-complete; scheduling methods; large task sets; exclusion relation; precedence relations; mutual exclusion; heuristic scheduling algorithms; clustering
Citation:
S. Ronngren, B.A. Shirazi,
"Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs,"
hicss,
p. 143,
28th Hawaii International Conference on System Sciences (HICSS'95),
1995
|
|
