Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention

Authors:
Oliver Sinnen;Leonel Sousa
Affiliations:
-;-
Venue:
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Year:
2001

Citing 10
Cited 4

Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Introduction to algorithms

Introduction to algorithms
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Parallel Algorithms and Architectures

Parallel Algorithms and Architectures
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Benchmarking the Task Graph Scheduling Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Exploiting Unused Time Slots in List Scheduling Considering Communication Contention

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Optimal linear programming solutions for multiprocessor scheduling with communication delays

ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Reducing the solution space of optimal task scheduling

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the efficient utilisation of a parallel system a task must be divided into sub-task and these must be assigned to the system's resources. The temporal and spatial assignment of sub-task to the computing and communication resources of a parallel system is known as the scheduling problem. This article proposes a new scheduling heuristic, called Simple Contention Scheduling (SCS), for arbitrary processor architectures with the consideration of link contention. The properties of the algorithm are discussed and it is compared to other existing algorithms (DLS and BSA) for arbitrary processor architectures with the consideration of contention. The comparison is done for a large set of random graphs and different architectures. Experimental results show that, while having the same or lower complexity, SCS produces in most cases better results than the other algorithms.