Skip to main content

Working-Set Based Adaptive Protocol for Software Distributed Shared Memory

  • Conference paper
  • First Online:
  • 412 Accesses

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

Abstract

Recently, many different protocols have been proposed for software Distributed Shared Memory (DSM) that can provide a shared-memory programming model for distributed memory hardware. The adaptive protocols of these protocols attempt to allow the system to choose between different protocols based on the access patterns it observes in an application. This paper describes several problems that deteriorate the performance of a hybrid protocol [6], an adaptive invalidate/update protocol. To address these problems, this paper then presents a working-set based adaptive invalidate/update protocol that uses a working-set model as the criteria for determining whether to update or invalidate. The proposed protocol was implemented in CVM [7], a software DSM system, and evaluated using eight nodes of an IBM SP2. After experimenting with various working-set window sizes, it was confirmed that the proposed protocol could track an access pattern better than the hybrid protocol, plus with a very small window size the protocol was able to optimize the overall performance.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. B. Carter, J. K. Bennett, and W. Zwaenepoel, “Implementation and Performance of Munin,” Proc. the 13th ACM Symposium on Operating Systems Principles, pp. 152–164, Oct 1991.

    Google Scholar 

  2. K. Li and P. Hudak, “Memory coherence in shared virtual memory systems,” ACM Transaction of Computer Systems 7(4), 321–359, Nov 1989.

    Article  Google Scholar 

  3. K. Gharachooloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta and J. Hennessy, “Memory consistency and event ordering in scalable shared-memory multiprocessors,” Proceedings of the 17th Annual International Symposium on Computer Architecture, pp. 15–26, May 1990.

    Google Scholar 

  4. P. Keleher et al., “TreadMarks: Shared Memory Computing on Networks of Workstations,” IEEE Computer, pp. 18–28, Feb. 1996.

    Google Scholar 

  5. P. Keleher, “Distributed Shared Memory Using Lazy Release Consistency,” PhD dissertation, Rice University, 1994.

    Google Scholar 

  6. P. Keleher, A. L. Cox, S. Dwarkadas, and W. Zwaenepoel, “An Evaluation of Software based Release Consistent Protocols”, Journal of Parallel and Distributed Computing, Vol 29, pp. 126–141, October 1995.

    Google Scholar 

  7. P. Keleher, “CVM: The Coherent Virtual Machine”, http://www.cs.umd.edu/ projects/cvm, November 1996.

  8. S. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. “The SPLASH-2 Programs: Characterization and Methodological Considerations,” Proceedings of the 21st Annual International Symposium on Computer Architecture, June 1995.

    Google Scholar 

  9. L.R. Monnerat and R. Bianchini. “Efficiently adapting to sharing patterns in software DSMs,” Proceedings. Of the 4th International Symposium on High-Performance Computer Architecture, Feb. 1998.

    Google Scholar 

  10. C. Amza, A. Cox, S. Dwarkadas, and W. Zwaenepoel, “ Software DSM protocols that Adapt Between and single Writer and Multiple Wirter,” Proceeding of he 3th International Symposium on High Performance Computer Architecture, Feb 1997

    Google Scholar 

  11. P. B. Glavin, Operating System Concepts, Addison-Wesley Publishing Company, pp. 320–321, 1998

    Google Scholar 

  12. C. Amza, A. Cox, K. Rajamani, and W. Zwaenepoel, “Tradeoffs Between False Sharing and Aggregation in Software Distributed Shared Memory,” Proceedings of the 6th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Jun 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, SW., Yoo, KY. (2000). Working-Set Based Adaptive Protocol for Software Distributed Shared Memory. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44467-X_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41429-2

  • Online ISBN: 978-3-540-44467-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics