Abstract
PELCR is an environment for λ-terms reduction on parallel/distributed computing systems. The computation performed in this environment is a distributed graph rewriting and a major optimization to achieve efficient execution consists of a message aggregation technique exhibiting the potential for strong reduction of the communication overhead. In this paper we discuss the interaction between the effectiveness of aggregation and the schedule sequence of rewriting operations. Then we present a Priority Based (BP) scheduling algorithm well suited for the specific aggregation technique. Results on a classical benchmark λ-term demonstrate that PB allows PELCR to achieve up to 88% of the ideal speedup while executing on a shared memory parallel architecture.
Chapter PDF
References
V. Danos, M. Pedicini, and L. Regnier. Directed virtual reductions. In M. B. D. van Dalen, editor, Computer Science Logic, 10th Int. Workshop, CSL’ 96, volume 1258 of Lecture Notes in Computer Science, pages 76–88. EACSL, Springer Verlag, 1997.
V. Danos and L. Regnier. Local and asynchronous beta-reduction (an analysis of Gi-rard’s EX-formula). In Logic in Computer Science, pages 296–306. IEEE Computer Society Press, 1993. Proceedings of the Eight Annual Symp. on Logic in Computer Science, Montreal, 1993.
J.-Y. Girard. Geometry of interaction 1: Interpretation of system F. In R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo, editors, Logic Colloquium’ 88, pages 221–260. North-Holland, 1989.
G. Gonthier, M. Abadi, and J.-J. Lévy. The geometry of optimal lambda reduction. In Proc. of 17th Annual ACM Symp. on Principles of Programming Languages, pages 15–26. Albuquerque, New Mexico, January 1992. ACM Press.
J. Sousa Pinto. Parallel implementation models for the lambda-calculus using the geometry of interaction. In 5th International Conference on Typed Lambda Calculi and Applications, pages 385–399. Krakow, Poland, May 2001. LNCS 2044.
J. Lamping. An algorithm for optimal lambda calculus reduction. In Proc. of 17th Annual ACM Symp. on Principles of Programming Languages, pages 16–30, San Francisco, California, January 1990. ACM Press.
M. Pedicini, and F. Quaglia. A Parallel implementation for optimal lambda-calculus reduction. In Proc. of 2nd ACM Int. Conference on Principles and Practice of Declarative Programming, pages 2–13, Montreal, Canada, September 2000. ACM Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedicini, M., Quaglia, F. (2002). Scheduling vs Communication in PELCR. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_89
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive