A fast and scalable scheduling algorithm for distributed memory systems

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings.Seventh IEEE Symposium on Parallel and Distributed Processing pp. 60 - 63
Main Authors Darbha, S., Agrawal, D.P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Clustering algorithms
Communication networks
Cost function
Distributed computing
Optimal scheduling
Partitioning algorithms
Polynomials
Processor scheduling
Scheduling algorithm
Very large scale integration
Online AccessGet full text
ISBN9780818671951
0818671955
ISSN1063-6374
DOI10.1109/SPDP.1995.530665

Cover

More Information
Summary: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.
ISBN:9780818671951
0818671955
ISSN:1063-6374
DOI:10.1109/SPDP.1995.530665