Feedback Guided Dynamic Loop Scheduling; A Theoretical Approach

Authors:
Affiliations:
Venue:
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Year:
2001

Citing 0
Cited 3

Feedback guided dynamic loop scheduling: convergence of the continuous case

The Journal of Supercomputing - Special issue: Parallel and distributed processing and applications
Enhanced loop coalescing: a compiler technique for transforming non-uniform iteration spaces

ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Convergence of the discrete FGDLS algorithm

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In this paper we review existing loop scheduling algorithms and also describe the feedback-guided dynamic loop scheduling (FGDLS) algorithm that was proposed in Bull et al. [2] and Bull [1]. The FGDLS algorithm uses a feedback mechanism to schedule a parallel loop within a sequential outer loop. It has been shown to perform well for scheduling problems for which the load associated with the parallel loop changes relatively slowly as the outer sequential loop executes. However the question of convergence of the FGDLS algorithm has remained an open question. In this paper we are able to establish sufficient conditions (essentially requiring that the workload does not change too rapidly with loop iteration count) for the (global) convergence of a continuous analogue of the feedback-guided algorithm.