Abstract
We discuss linear schedules of task-graphs under the communication cost model of the LogP-machine. In addition to our previous work, we consider also non-constant parameters L, o and g, i.e. we introduce messages of different sizes into the LogP-model. The main results of this work are the following: (i) in the LogP-model, less communication in linear schedules does not necessarily imply a better performance. (ii) We give an upper time bound on the execution time of linear clusterings. (iii) We give an efficient algorithm which computes linear clusterings with a minimum number of clusters.
Chapter PDF
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
A. Alexandrov, M. Ionescu, K. E. Schauser, and C. Scheimann. Loggp: Incorporating long messages into the logp-model — one step closer towards a realistic model for parallel computation. In 7th Annual Symposium on Parallel Algorithms and Architectures, pages 95–105. ACM Press, 1995.
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.
[CKP+96] 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.
A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4:686–701, June 1993.
J. E. Hopcroft and R. M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225–231, 1973.
R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser. Optimal broadcast and summation in the LogP model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 142–153. ACM, 1993.
W. Löwe, 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.
W. Löwe, M. Middendorf, and W. Zimmermann. Scheduling inverse trees under the communication model of the logp-machine. Theoretical Computer Science, 1997. Submitted, currently under revision.
W. Löwe and W. Zimmermann. On finding optimal clusterings in task graphs. In N. Mirenkov, editor, Parallel Algorithms/Architecture Synthesis pAs'95, pages 241–247. IEEE, 1995.
W. Löwe and W. Zimmermann. Programming data-parallel — executing process parallel. In P. Ritzson and L. Finmo, editors, Parallel Programming and Applications, pages 50–64. IOS Press, 1995.
C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.
T. Yang and A. Gerasoulis.DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951–967, 1994.
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
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löwe, W., Zimmermann, W., Eisenbiegler, J. (1997). On linear schedules of task graphs for generalized logp-machines. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002832
Download citation
DOI: https://doi.org/10.1007/BFb0002832
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive