UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
List scheduling of general task graphs under LogP
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Grain Size Determination for Parallel Processing
IEEE Software
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Contention-Aware Communication Schedule for High-Speed Communication
Cluster Computing
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling
IEEE Transactions on Parallel and Distributed Systems
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
PDP '10 Proceedings of the 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing
Contention-aware scheduling with task duplication
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.