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
Adaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems
IEEE Transactions on Parallel and Distributed Systems
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
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
Hi-index | 0.00 |
In this article we present some theoretical results concerning the convergence of Feedback Guided Dynamic Loop Scheduling (FGDLS). This method was proposed by Bull (Proceedings of Euro-Par'98, Springer-Verlag, 1998) and further developed by Bull, Ford, Freeman and Hancock (Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM Press, 1999). Based on several synthetic examples it has been shown that the method performs well when the workload associated with the parallel loop changes relatively slowly (see Bull et al., 1999). However the question of convergence of the FGDLS method has remained an open question. In this paper we establish sufficient conditions for the convergence of the method.