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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bull, J.M.: Feedback Guided Loop Scheduling: Algorithms and Experiments. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, p. 377. Springer, Heidelberg (1998)
Bull, J.M., Ford, R.W., Dickinson, A.: A Feedback Based Load Balance Algorithm for Physics Routines in NWP. In: Proceedings of Seventh ECMWF Workshop on the Use of Parallel Processors in Meteorology. World Scientific, Singapore (1996)
Bull, J.M., Ford, R.W., Freeman, T.L., Hancock, A.: A Theoretical Investigation of Feedback Based Load Balance Algorithm. In: Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing. SIAM Press, Philadelphia (1999)
Eager, D.L., Zahorjan, J.: Adaptive Guided Self-Scheduling, Technical Report 92-01-01, Department of Computer Science and Engineering, University of Washington (1992)
Hummel, S.F., Schonberg, E., Flynn, L.E.: Factoring: A Practical and Robust Method for Scheduling Parallel Loops. Communications of the ACM 35(8), 90–101 (1992)
Lucco, S.: A Dynamic Scheduling Method for Irregular Parallel Programs. In: Proceedings of ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, San Francisco, CA, pp. 200–211 (1992)
Markatos, E.P., LeBlanc, T.J.: Using Processor Affinity in in Loop Scheduling on Shared Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 5(4), 379–400 (1994)
Polychronopoulos, C.D., Kuck, D.J.: Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers. IEEE Transactions on Computers C-36(12), 1425–1439 (1987)
Subramanian, S., Eager, D.L.: Affinity Scheduling of Unbalanced Workloads. In: Proceedings of Supercomputing 1994, pp. 214–226. IEEE Comp. Soc. Press, Los Alamitos (1994)
Tabirca, T., Freeman, L.T., Tabirca, S.: A Theoretical Application of Feedback Guided Dynamic Loop Scheduling. In: Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools and Applications for Cluster Computing. LNCS, vol. 2325, pp. 287–292. Springer, Heidelberg (2001)
Tabirca, T., Freeman, L.T., Tabirca, S., Yang, T.L.: An Application of Feedback Guided Dynamic Loop Scheduling to the Shortest Path Problem. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2002), pp. 1786–1789. CSREA Press, Bogart (2002)
Tabirca, T., Freeman, L.T., Tabirca, S., Yang, T.L.: Feedback Guided Dynamic Loop Scheduling; A Theoretical Approach. In: Pinkston, T.M. (ed.) Proceedings of the 2001 ICPP Workshops, pp. 115–121. IEEE Computer Society Press, Los Alamitos (2001)
Tabirca, T., Tabirca, S., Freeman, L.T., Yang, T.: An O(p+logp) Algorithm for the Discrete FGDLS. In: Proceedings of The 2003 International Conference on Parallel Processing, ICPP-HPSECA 2003, Taiwan, pp. 164–170 (2003)
Tzen, T.H., Ni, L.M.: Trapezoid Self-Scheduling Scheme for Parallel Computers. IEEE Trans. on Parallel and Distributed Systems 4(1), 87–98 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tabirca, S., Tabirca, T., Yang, L.T. (2005). Convergence of the Discrete FGDLS Algorithm. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_29
Download citation
DOI: https://doi.org/10.1007/11557654_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)