Abstract
Currently, many parallel algorithms are defined for sharedmemory architectures. The prefered machine model for designing these algorithms is the PRAM. However, this model does not take into account properties of existing architectures. Recently, Culler et al. defined the LogP machine model which better reflects the behaviour of massively parallel computers. We discuss an important class of programs for sharedmemory architectures and show how they can be mapped to the LogP machine. We define this class and show how to compute the mapping at compile time. For this mapping a constant factor delay with respect to the optimal LogP execution time can be guaranteed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview 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 235–261, 1993.
R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, pages 85–94, 1990.
P. Flajolet, B. Salvy, and P. Zimmermann. Average case analysis of algorithms. Theoretical Computer Science, 1991.
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.
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.
C.H. Papadimitrou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2):322–328, 1990.
L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 945–971. MIT-Press, 1990.
Wolf Zimmermann. Autmatische Komplexitätsanalyse funktionaler Programme. Informatik-Fachberichte. Springer, 1990. Disseration at the Universität Karlsruhe, Fakultät für Informatik.
Wolf Zimmermann. Automatic worst case analysis of parallel programs. Technical Report TR-90-066, International Computer Science Institute, December 1990.
H. Zima. Supercompilers for Parallel and Vector Computers. Frontier Series. ACM Press, 1991.
Wolf Zimmermann and Holger Kumm. On the implementation of virtual shared memory. In Programming Models for Massively Parallel Computers, pages 172–178, 1993.
P. Zimmermann and W. Zimmermann. Automatic complexity analysis of divide-and-conquer algorithms. In Proceedings of the Sixth Internation Symposium on Computer and Information Sciences, pages 395–404, 1991. also available as INRIA-Report 1134, December 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zimmermann, W., Löwe, W. (1994). An approach to machine-independent parallel programming. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_25
Download citation
DOI: https://doi.org/10.1007/3-540-58430-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58430-8
Online ISBN: 978-3-540-48789-0
eBook Packages: Springer Book Archive