Skip to main content

Low Cost Coherence Protocol for DSM Systems with Processor Consistency

  • Conference paper
Computer and Information Sciences - ISCIS 2003 (ISCIS 2003)

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

Included in the following conference series:

Abstract

Modern Distributed Shared Memory (DSM) systems offer high speed application processing by allowing to use relaxed consistency models, such as processor consistency. Unfortunately, most of the existing coherence protocols implementing relaxed consistency in multiprocessors or loosely couples clusters use write-update strategy which incurs large communication overhead, and therefore is impractical for most distributed applications. This paper presents a new home-based coherence protocol for DSM systems with processor consistency. The protocol uses local invalidation paradigm introducing little overhead. No additional invalidation messages are required; all coherence information is piggybacked to update messages.

This work has been partially supported by the State Committee for Scientific Research grant no. 7T11C 036 21

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 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

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. Ahamad, M., Hutto, P.W., John, R.: Implementing and Programming Causal Distributed Shared Memory. In: Proc. 11th Int’l Conf. on Djstributed Computing, May 1991, pp. 274–281 (1991)

    Google Scholar 

  2. Ahamad, M., Bazzi, R.A., John, R., Kohli, P., Neiger, G.: The power of processor consistency, Technical Report GIT-CC-92/34, Georgia Institute of Technology, Atlanta (December 1992)

    Google Scholar 

  3. Amza, C., Cox, A.L., Dwarkadas, S., Keleher, P., Lu, H., Rajamony, R., Yu, W., Zwaenepoel, W.: TreadMarks: Shared Memory Computing on Networks of Workstations. IEEE Computer 29(2), 18–28 (1996)

    Google Scholar 

  4. Amza, C., Cox, A.L., Zwaenepoel, W.: Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters. In: Proc. Int’l Conf. on Dependable Systems and Networks (DSN 2000) (June 2000)

    Google Scholar 

  5. Christodoulopoulou, R., Azimi, R., Bilas, A.: Dynamic data replication: An approach to providing fault-tolerant shared memory clusters. In: Proc. 9th IEEE Symposjum on Hjgh- Performance ComputerArchitecture (HPCA9) (February 2003)

    Google Scholar 

  6. Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., Hannessy, J.: Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In: Proc. 17th Int’l Symposium on Computer Architecture, May 1990, pp. 15–26 (1990)

    Google Scholar 

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

    Google Scholar 

  8. Herlihy, M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Object. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)

    Article  Google Scholar 

  9. Higham, L., Kawash, J.: Bounds for Mutual Exclusion with only Processor Consistency. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 44–58. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. John, R., Ahamad, M.: Causal Memory: Implementation, Programming Support and Experiences", Technical Report GITCC-93/10, Georgia Institute of Technology (1993)

    Google Scholar 

  11. Lipton, R.J., Sandberg, J.S.: PRAM: a Scalable Shared Memory, Technical Report CS-TR-180-88, Princeton University (September 1988)

    Google Scholar 

  12. Little, M.C., Shrivastava, S.K.: Integrating Group Communication with Transactions for Implementing Persistent Replicated Objects. In: Krakowiak, S., Shrivastava, S.K. (eds.) BROADCAST 1999. LNCS, vol. 1752, pp. 238–249. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Mattern, F.: Time and Global States of Distributed Systems. In: Proc. Int’l Workshop on Parallel and Distributed Algorithms (1988)

    Google Scholar 

  14. Raynal, M.: Sequential Consistency as Lazy Linearizability, Technical Report PI-1437, IRISA Rennes (January 2002)

    Google Scholar 

  15. Sandberg, J.S.: Design of PRAM Network, Technical Report CS-TR-254-90, Princeton Univ. (April 1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brzeziński, J., Szychowiak, M. (2003). Low Cost Coherence Protocol for DSM Systems with Processor Consistency. In: Yazıcı, A., Şener, C. (eds) Computer and Information Sciences - ISCIS 2003. ISCIS 2003. Lecture Notes in Computer Science, vol 2869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39737-3_114

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39737-3_114

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20409-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics