Abstract
Is the owner-computes style of parallelism, captured in a variety of data parallel languages, attractive as a paradigm for designing explicitly parallel codes? This question gives rise to a number of others. Will such use be unwieldy? Will the resulting code run well? What can such an approach offer beyond merely replicating, in a more labor intensive way, the services and coverage of data parallel languages? We investigate these questions via a simple example and a “real world” case study developed using C-Linda, an explicit parallel programming language formed by the merger of C with the Linda 1 coordination language. The results demonstrate owner-computes is an effective design strategy in Linda.
We are grateful to the Digital Equipment Corporation for providing the network of DEC-station 5000s, to the Oak Ridge National Laboratory for access to an iPSC/860, and to Alliant for access to an FX/2800.
This work was supported in part by AFOSR grant 91-0098 and NSF grant CCR-8657615.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Bjornson, N. Carriero, D. Gelernter, T. Mattson, and A. Sherman. Experience with Linda: Notes from the bandwagon. Reserach report, Yale University Department of Computer Science, Aug. 1991.
L. D. Cagan, N. J. Carriero, and S. A. Zenios. Pricing mortgage-backed securities with network Linda. Technical Report 516F, Scientific Computing Associates, Inc., New Haven, CT, Jan. 1992.
N. Carriero and D. Gelernter. How to Write Parallel Programs: A Guide to the Perplexed. ACM Comput. Surv., 21(3), Sept. 1989. Extended version published by MIT Press, Fall 1990.
N. Carriero and D. Gelernter. A foundation for advanced compile-time analysis of Linda programs. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. MIT Press, Cambridge, 1991.
S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng. An overview of the Fortran D programming system. Technical Report TR91-154, Rice University Department of Computer Science, Mar. 1991.
P. J. Hatcher, A. J. Lapadula, R. R. Jones, M. J. Quinn, and R. J. Anderson. A production quality C* compiler for hypercube multicomputers. In Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 73–82, 1991.
J. M. Hutchinson and S. A. Zenios. Financial simulations on a massively parallel Connection Machine. International Journal of Supercomputer Applications, 5(2):27–45, 1991.
J. R. Rose and G. L. Steele Jr. C*: An extended c language for data parallel programming. Technical Report Series PL87-5, Thinking Machines Corporation, Cambridge, Massachusetts, Mar. 1987.
Thinking Machines Corporation, Cambridge, Massachusetts. Programming in C *, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carriero, N., Gelernter, D. (1993). Data parallelism and Linda. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1992. Lecture Notes in Computer Science, vol 757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57502-2_45
Download citation
DOI: https://doi.org/10.1007/3-540-57502-2_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57502-3
Online ISBN: 978-3-540-48201-7
eBook Packages: Springer Book Archive