A fast and scalable scheduling algorithm for distributed memory systems
Authors:
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 60-63
Abstract
The inter-processor communication time is a major bottleneck for distributed memory systems (DMSs) and can be reduced by having an efficient task partitioning and scheduling strategy. The paper deals with the scheduling issues and presents an algorithm to schedule tasks onto DMSs. The complexity of this algorithm is O(V/sup 2/), where Vr is the number of nodes of the directed acyclic graph (DAG). This algorithm has been applied to some practical DAGs and the results obtained using this algorithm are very promising.Keywords
This publication has 5 references indexed in Scilit:
- SDBS: a task duplication based optimal scheduling algorithm2002
- A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systemsIEEE Transactions on Parallel and Distributed Systems, 1995
- A Comparison of Multiprocessor Scheduling Heuristics1994
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974