Multiprocessor scheduling: An extension of the MULTIFIT algorithm
β Scribed by Chung-Yee Lee; J.David Massey
- Publisher
- Society of Manufacturing Engineers
- Year
- 1988
- Tongue
- English
- Weight
- 612 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0278-6125
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisfies certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of proc
In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite