Abstract
Usually, scheduling algorithms are designed for task-graphs. Task-graphs model oblivious algorithms, but not iterative algorithms where the number of iterations is unknown (e.g. while-loops). We generalize scheduling techniques known for oblivious algorithms to iterative algorithms. We prove bounds for the execution time of such algorithms in terms of the optimum.
Chapter PDF
References
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pages 1–12, 1993. published in: SIGPLAN Notices (28) 7.
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78–85, 1996.
B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 253–264. Springer, 1994.
Jörn Eisenbiegler, Welf Löwe, and Andreas Wehrenpfennig. On the optimization by redundancy using an extended LogP model. In International Conference on Advances in Parallel and Distributed Computing (APDC’97), pages 149–155. IEEE Computer Society Press, 1997.
I. Foster. Design and Building Parallel Programs-Concepts and Tools for Parallel Software Engeneering. Addison-Wesley, 1995.
R.M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 871–941. MIT-Press, 1990.
R.M. Karp, A. Sahay, E.E. Santos, and K.E. Schauser. Optimal broadcast and summation in the LogP model. ACM-Symposium on Parallel Algorithms and Architectures, 1993.
W. Lwe, J. Eisenbiegler, and W. Zimmermann. Optimizing parallel programs on machines with fast communication. In 9.International Conference on Parallel and Distributed Computing Systems, pages 100–103, 1996.
Welf Löwe, Wolf Zimmermann, and Jörn Eisenbiegler. On linear schedules for task graphs for generalized LogP-machines. In Europar’97: Parallel Processing, volume 1300 of Lecture Notes in Computer Science, pages 895–904, 1997.
M. Philippsen. Optimierungstechniken zur bersetzung paralleler Programmiersprachen. PhD thesis, Universitt Karlsruhe, 1994. VDI-Verlag GmbH, Dsseldorf, 1994, VDI Fortschritt-Berichte 292, Reihe 10: Informatik.
M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1995.
H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computing. ACM-Press, NY, 1990.
W. Zimmermann and W. Löwe. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94-VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277–288. Springer, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löwe, W., Zimmermann, W. (1999). Scheduling Iterative Programs onto LogP-Machine. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_43
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive