Scheduling with Communication Delays and On-Line Disturbances

Authors:
Aziz Moukrim;Eric Sanlaville;Frédéric Guinand
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 8
Cited 2

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
List scheduling with and without communication delays

Parallel Computing
The complexity of scheduling trees with communication delays

Journal of Algorithms
Some models for scheduling parallel programs with communication delays

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Performance of Coffman-Graham schedules in the presence of unit communication delays

Discrete Applied Mathematics
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems

On Scheduling Task-Graphs to LogP-Machines with Disturbances

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Sensitivity bounds for machine scheduling with uncertain communication delays

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of scheduling tasks on multiprocessors. Two tasks linked by a precedence constraint and executed by two different processors must communicate. The resulting delay depends on the tasks and on the processor network. In our model an estimation of the delay is known at compile time; but disturbances due to network contention, link failures,... may occur at execution time. Algorithms computing separately the processor assignment and the sequencing on each processor are considered. We propose a partially on-line scheduling algorithm based on critical paths to cope with the possible disturbances. Some theoretical results and an experimental study show the interest of this approach compared with fully on-line scheduling.