Skip to main content

Using a weak coherency model for a parallel Lisp

  • Virtual Shared Memory
  • Conference paper
  • First Online:
Book cover Distributed Memory Computing (EDMCC 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 487))

Included in the following conference series:

Abstract

The parallel language EDS Lisp has been designed for distributed memory machines. In this respect, it presupposes only a minimal required coherency in the storage view of parallel processes. This paper describes the coherency model of EDS Lisp and shows how the requirements of EDS Lisp can be realized using a weak coherency model on the parallel distributed memory EDS machine.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Borrmann, P. Istavrinos: “Store Coherency in a Parallel Distributed Memory Machine”; submitted to the Second European Distributed Memory Conference (EDMCC2), Münchem April 1991

    Google Scholar 

  2. C. Hammer, Th. Henties: “Parallel Lisp for a Distributed Memory Machine”; Lisp Europal Workshop “High Performance and Parallel Computing in Lisp” London November 1990

    Google Scholar 

  3. R. Halstead: “Multilisp: A Language for Concurrent Symbolic Computation”; ACM Transactions on Programming Languages and Systems, October 1985

    Google Scholar 

  4. P. Istavrinos, L. Borrmann: “A Process and Memory Model for a Parallel Distributed Memory Machine”; Joint Conference on Vector and Parallel Processing, Zürich Sep. 1990

    Google Scholar 

  5. L. Lamport: “Time, clocks and the ordering of events in a distributed system”; CACM Vol 21 pp. 558–564 1978

    Article  Google Scholar 

  6. K. Li, P. Hudak: “Memory Coherence in Shared Virtual Memory Systems”; 5th ACM Symp. on Principles of Distributed Computing, 1986

    Google Scholar 

  7. M. Radlhammer: “The Future of Futures”; Lisp Europal Workshop “High Performance and Parallel Computing in Lisp”, London November 1990

    Google Scholar 

  8. S. Steinberg, D. Allen, L. Bagnall, C. Scott: “The Butterfly Lisp System”; Proceedings of the August 1986 AAAAI, Volume 2, Philadelphia, PA, pp. 730

    Google Scholar 

  9. G. Steele: “Common LISP: The Language”; Digital Press, 1984

    Google Scholar 

  10. “Top Level Common Lisp Reference Manual”; Top Level Inc., Mass., USA, January 1990

    Google Scholar 

  11. M. Ward, P. Townsend, G. Watzlawik “EDS Hardware Architecture” Joint Conference on Vector and Parallel Processing, Zürich Sep. 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arndt Bode

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hammer, C., Henties, T. (1991). Using a weak coherency model for a parallel Lisp. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032921

Download citation

  • DOI: https://doi.org/10.1007/BFb0032921

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53951-3

  • Online ISBN: 978-3-540-46478-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics