Scheduling Unit-Time Tasks with Limited Resources
Proceedings of the Sagamore Computer Conference on Parallel Processing
Bounds on scheduling with limited resources
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
SCHEDULING TASK SYSTEMS WITH RESOURCES
SCHEDULING TASK SYSTEMS WITH RESOURCES
Toward a theory of transactional contention managers
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Data-Dependency Graph Transformations for Instruction Scheduling
Journal of Scheduling
| Hi-index | 0.00 |
Minimum execution time scheduling of unit execution time (UET) task systems with resources has been the subject of several papers over the past few years. Because such scheduling problems are, in general, NP-hard, a variety of heuristic methods for producing schedules have been studied, among them, critical path scheduling. The strongest results to date have been for systems where there is no processor constraint. These results may be utilized for systems with a processor constraint by treating the processors as an additional resource. Unfortunately, in those cases where the number of processors is close to the number of resources, this results in an upper bound which is somewhat misleading. In this paper we investigate the performance of critical path scheduling for UET task systems with resources and a fixed number of processors. An upper bound for the worst case performance of critical path scheduling is given. This bound depends both on the number of processors and on the number of different resources. Moreover, we show that this is the best possible (asymptotic) upper bound.