Skip to main content

Decoupled Interconnection of Distributed Memory Models

  • Conference paper
Principles of Distributed Systems (OPODIS 2003)

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

Included in the following conference series:

Abstract

In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the original systems and the interconnection system (that is, they are decoupled) and consider systems implemented with invalidation and propagation.

We first show that only fast memory models can be interconnected. We then show that causal and pRAM systems can be interconnected if they fulfill some restrictions, and for these cases, we present protocols to interconnect them. Finally, we present a protocol to interconnect cache systems.

This work has been partially supported by the Spanish MCyT under grants TIC2001-1586-C03-01 and TIC2001-1586-C03-02, the Comunidad de Madrid under grant 07T/0022/2003, and the Universidad Rey Juan Carlos under grant PPR-2003-37.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adve, S.V.: Designing Memory Consistency Models for Shared-Memory Multiprocessors. PhD thesis, University of Wisconsin-Madison (1993)

    Google Scholar 

  2. Ahamad, M., Bazzi, R., John, R., Kohli, P., Neiger, G.: The power of processor consistency. In: Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, pp. 251–260 (1993)

    Google Scholar 

  3. Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation and programming. Distributed Computing 9(1), 37–49 (1995)

    Article  MathSciNet  Google Scholar 

  4. Attiya, H., Friedman, R.: Limitations of fast consistency conditions for distributed shared memories. Information Processing Letters 57, 243–248 (1996)

    Article  MATH  Google Scholar 

  5. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, New York (1998)

    Google Scholar 

  6. Attiya, H., Welch, J.L.: Sequential consistency versus linearizability. ACM Transactions on Computer Systems 12(2), 91–122 (1994)

    Article  Google Scholar 

  7. Bershad, B.N., Zekauskas, M.J., Sawdon, W.A.: The Midway distributed shared memory system. In: COMPCON (1993)

    Google Scholar 

  8. Cholvi, V.: Formalizing Memory Models. PhD thesis, Department of Computer Science, Polytechnic University of Valencia (December 1994)

    Google Scholar 

  9. Cholvi, V.: Specification of the behavior of memory operations in distributed systems. Parallel Processing Letters 8(4), 589–598 (1998)

    Article  MathSciNet  Google Scholar 

  10. Fernández, A., Jiménez, E., Cholvi, V.: On the interconnection of causal memory systems. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, July 2000, ACM, New York (2000)

    Google Scholar 

  11. Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., Hennessy, J.: Memory consistency and event ordering in scalable shared-memory multiprocessors. In: Proceedings of the 17th Annual International Symposium on Computer Architecture, May 1990, pp. 15–26. ACM, New York (1990)

    Chapter  Google Scholar 

  12. Goodman, J.R.: Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherence Interface Working Group (March 1989)

    Google Scholar 

  13. Iftode, L., Singh, J., Li, K.: Scope consistency: A bridge between release consistency and entry consistency. In: Proc. of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (1996)

    Google Scholar 

  14. Jiménez, E., Fernández, A., Cholvi, V.: Decoupled Interconnection of Distributed Memory Models. Technical Report TR-GSYC-2003-2, Universidad Rey Juan Carlos (October 2003), http://gsyc.escet.urjc.es/publicaciones/tr

  15. Keleher, P.: Distributed Shared Memory Using Lazy Consistency. PhD thesis, Rice University (1994)

    Google Scholar 

  16. Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers 28(9), 690–691 (1979)

    Article  MATH  Google Scholar 

  17. Lamport, L.: On interprocess communication: Parts I and II. Distributed Computing 1(2), 77–101 (1986)

    Article  MATH  Google Scholar 

  18. Lipton, R.J., Sandberg, J.S.: PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Princeton University, Department of Computer Science (September 1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiménez, E., Fernández, A., Cholvi, V. (2004). Decoupled Interconnection of Distributed Memory Models. In: Papatriantafilou, M., Hunel, P. (eds) Principles of Distributed Systems. OPODIS 2003. Lecture Notes in Computer Science, vol 3144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27860-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27860-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27860-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics