Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. M. Bull. Feedback guided loop scheduling: Algorithms and experiments. Proceedings of Euro-Par'98, Lecture Notes in Computer Science, Springer-Verlag, 1998.
J. M. Bull, R. W. Ford, T. L. Freeman, and D. J. Hancock. A theoretical investigation of feedback guided loop scheduling. Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM Press, 1999.
D. L. Eager and J. Zahorjan. Adaptive guided self-scheduling. Technical Report 92–01–01, Department of Computer Science and Engineering, University of Washington, 1992.
S. F. Hummel, E. Schonberg, and L. E. Flynn. Factoring: A practical and robust method for scheduling parallel loops. Communications of the ACM, 35(8):90–101, 1992.
S. Lucco. A dynamic scheduling method for irregular parallel programs. Proceedings of ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, CA, pp. 200–211, 1992.
P. E. Markatos and T. J. LeBlanc. Using processor affinity in loop scheduling on shared memory multipro-cessors. IEEE Transactions on Parallel and Distributed Systems, 5(4):379–400, 1994.
C. D. Polychronopoulos and D. J. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel supercomputers, IEEE Transactions on Computers, C-36(12):1425–1439, 1987.
S. Subramanian and D. L. Eager. Affinity scheduling of unbalanced workloads. Proceedings of Supercom-puting'94, pp. 214–226, IEEE Comp. Soc. Press, 1994.
T. Tabirca, S. Tabirca, L. Freeman, and T. Yang. Feedback guided dynamic loop scheduling; A theoretical approach. Proceedings of The 3rd Workshop on High Performance Scientific and Engineering Computing with Applications (HPSECA 2001), IEEE Computer Society Press, Valencia, Spain, 2001.
T. Tabirca, S. Tabirca, and L. Freeman. A convergence proof of FGDLS when the workload is monotonous. Proceeding of the International Symposium on Parallel and Distributed Computing, Lecture Notes in Com-puter Science, Springer-Verlag, Iasi, Romania, 2002.
T. H. Tzen and L. M. Ni. Trapezoid self-scheduling scheme for parallel computers. IEEE Trans. on Parallel and Distributed Systems, 4(1):87–98, 1993.
Y. Yang, C. Jin, and X. Zhang. Adaptively scheduling parallel loops in distributed shared-memory systems. IEEE Trans. on Parallel and Distributed Systems, 8(1):70–81, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tabirca, T., Freeman, L., Tabirca, S. et al. Feedback Guided Dynamic Loop Scheduling: Convergence of the Continuous Case. The Journal of Supercomputing 30, 151–178 (2004). https://doi.org/10.1023/B:SUPE.0000040613.43581.53
Issue Date:
DOI: https://doi.org/10.1023/B:SUPE.0000040613.43581.53