Skip to main content

Learning from our Successes

  • Conference paper
  • 62 Accesses

Part of the book series: NATO ASI Series ((NATO ASI F,volume 106))

Abstract

There are successes in the field of explicit parallel systems. Linda1 is an example. We defend this claim by listing some non-trivial requirements for success and showing how Linda fills the bill.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ahmed and D. Gelernter. A CASE environment for parallel programming. In Proc. Fifth International Workshop on Computer-Aided Software Engineering, July 1992.

    Google Scholar 

  2. 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. 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. N. Carriero and D. Gelernter. Linda in context. Commun. ACM, 32(4):444–458, Apr. 1989.

    Article  Google Scholar 

  5. N. Carriero and D. Gelernter. Coordination languages and their significance. Commun. ACM, 35(2):97–107, Feb. 1992.

    Article  Google Scholar 

  6. M. Factor. The Process Trellis Software Architecture for Parallel, Real-Time Monitors. PhD thesis, Yale University Department of Computer Science, 1990. In preparation.

    Google Scholar 

  7. D. Gelernter and D. Kaminsky. Supercomputing out of recycled garbage: Preliminary experience with piranha. In Sixth ACM International Conference on Supercomputing, pages 417–427, July 1992.

    Google Scholar 

  8. D. Turner. Recursion Equations as a Programming Language. In P. H. John Darlington and D. Turner, editors, Functional Programming and its Applications: An Advanced Course, pages 1–28. Cambridge University Press, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carriero, N., Gelernter, D. (1993). Learning from our Successes. In: Kowalik, J.S., Grandinetti, L. (eds) Software for Parallel Computation. NATO ASI Series, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58049-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58049-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63453-6

  • Online ISBN: 978-3-642-58049-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics