Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
On the complexity of list scheduling algorithms for distributed-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
A comparison of list schedules for parallel processing systems
Communications of the ACM
Operating Systems Theory
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A new model for allocating resources to scheduled lightpath demands
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the nonpreemptive case, preemptive task scheduling in a distributed system has not received much attention. In this paper we present a low-cost algorithm, called the Preemptive Task Scheduling algorithm (PTS), which is intended for compile-time scheduling of coarse-grain problems in a preemptive distributed-memory system. We show that PTS combines the low-cost of the algorithms for the nonpreemptive case with a simpler runtime support, while the output performance is still at a level comparable to the non-preemptive schedules.