Data parallelism and Linda

  • N. Carriero
  • D. Gelernter
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 757)

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.

Keywords

coordination languages data parallel languages explicit parallelism Linda 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCG+91]
    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.Google Scholar
  2. [CCZ92]
    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.Google Scholar
  3. [CG89]
    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.Google Scholar
  4. [CG91]
    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.Google Scholar
  5. [HKK+91]
    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.Google Scholar
  6. [HLJ+91]
    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.Google Scholar
  7. [HZ91]
    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.Google Scholar
  8. [RS87]
    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.Google Scholar
  9. [TMC90]
    Thinking Machines Corporation, Cambridge, Massachusetts. Programming in C *, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • N. Carriero
    • 1
  • D. Gelernter
    • 1
  1. 1.Yale UniversityNew Haven

Personalised recommendations