Abstract
There exist transformations of PRAM programs with predictable communication behavior to existing architectures. We extend the class of tractable programs to those with communication depending on the input. First, we define this class of programs. Second, we give source code transformations to simplify the programs and to eliminate indirect addresses and conditionals. Third, we show how to derive the communication behavior statically. Fourth, we show how to compute the mapping at compile time. Finally, we give upper time bounds for execution on existing architectures.
An extended version of the paper can be obtained via “World Wide Web”: http://i44www.info.uni-karlsruhe.de/∼loewe
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
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.
B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In LNCS 854, Parallel Processing: CONPAR'94-VAPP VI, pages 254–264. Springer, 1994.
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 Handbook of Theoretical Computer Science Vol. A, pages 871–941. MIT-Press, 1990.
W. Löwe and W. Zimmermann. On finding optimal clusterings of task graphs. In Aizu International Symposium on Parallel Algorithm/Architecture Synthesis. IEEE Computer Society Press, 1995.
C.H. Papadimitrou and M. Yannakakis. Towards an architectureindependent 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. The automatic worst case analysis of parallel programs: Simple parallel sorting and algorithms on graphs. Technical Report TR-91-045, International Computer Science Institute, August 1991.
Wolf Zimmermann and Holger Kumm. On the implementation of virtual shared memory. In Programming Models for Massively Parallel Computers, pages 172–178, 1993.
W. Zimmermann and W. Löwe. An approach to machine-independent parallel programming. In LNCS 854, Parallel Processing: CONPAR'94-VAPP VI, pages 277–288. Springer, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löwe, W. (1995). Optimization of PRAM-programs with input-dependent memory access. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020469
Download citation
DOI: https://doi.org/10.1007/BFb0020469
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive