Convergence of the discrete FGDLS algorithm

Authors:
Sabin Tabirca;Tatiana Tabirca;Laurence T. Yang
Affiliations:
Computer Science Department, University College Cork, Cork, Ireland;Computer Science Department, University College Cork, Cork, Ireland;Computer Science Department, St. Francis Xavier University, Antigonish, Canada
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 10
Cited 0

Guided self-scheduling: A practical scheduling scheme for parallel supercomputers

IEEE Transactions on Computers
Factoring: a method for scheduling parallel loops

Communications of the ACM
A dynamic scheduling method for irregular parallel programs

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Affinity scheduling of unbalanced workloads

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers

IEEE Transactions on Parallel and Distributed Systems
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
A Theoretical Application of Feedback Guided Dynamic Loop Scheduling

IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
An Application of Feedback Guided Dynamic Loop Scheduling to the Shortest Path Problem

PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 4
Feedback Guided Dynamic Loop Scheduling: Algorithms and Experiments

Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Feedback Guided Dynamic Loop Scheduling; A Theoretical Approach

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Feedback-Guided Dynamic Loop Scheduling (FGDLS) algorithm [1] is a recent dynamic approach to the scheduling of a parallel loop within a sequential outer loop. Earlier papers have analysed convergence under the assumption that the workload is a positive, continuous, function of a continuous argument (the iteration number). However, this assumption is unrealistic since it is known that the iteration number is a discrete variable. In this paper we extend the proof of convergence of the algorithm to the case where the iteration number is treated as a discrete variable. We are able to establish convergence of the FGDLS algorithm for the case when the workload is monotonically decreasing.