Skip to main content

Processor Mechanisms for Software Shard Memory

  • Conference paper
  • First Online:
  • 609 Accesses

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

Abstact

The M-Machine’s combined hardware-software shared-memory system provides significantly lower remote memory latencies than software DSM systems while retaining the flexibility of software DSM. This system is based around four hardware mechanisms for shared memory: status bits on individual memory blocks, hardware translation of memory addresses to home processors, fast detection of remote accesses, and dedicated thread slots for shared-memory handlers. These mechanisms have been implemented on the MAP processor, and allow remote memory references to be completed in as little as 336 cycles at low hardware cost.

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

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.

Reference

  1. Anant Agarwal et al. The MIT Alewife Machine: Architecture and Performance. In Proceedings of the 22nd International Symposium on Computer Architecture, June 1995.

    Google Scholar 

  2. Ricardo Bianchini. Application Performance on the Alewife Multiprocessor. Alewife Systems Memo #43, LCS, Massachusetts Institute of Technology, 1994.

    Google Scholar 

  3. Nicholas P. Carter, Stephen W. Keckler, and William J. Dally. Hardware Support for Fast Capability-Based Addressing. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, October 1994.

    Google Scholar 

  4. Nicholas P. Carter. Processor Mechanisms for Software Shared Memory. Ph.D. Thesis, Massachusetts Institute of Technology, 1999.

    Google Scholar 

  5. Marco Fillo, Stephen W. Keckler, William J. Dally, Nicholas P. Carter, Andrew Chang, Yevgeny Gurevich, and Whay S. Lee. The M-Machine Multicomputer. In Proceedings of the 28th International Symposium on Microarchitecture, Ann Arbor, MI, December 1995.

    Google Scholar 

  6. Mark Heinrich et al. The Performance Impact of Flexibility in the Stanford FLASH Multiprocessor. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI), October 1994

    Google Scholar 

  7. John Heinlein, Kourosh Gharachorloo, Scott Dresser, and Anoop Gupta. Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, October 1994

    Google Scholar 

  8. Stephen W. Keckler and William J. Dally. Processor Coupling: Integrating Compile Time and Runtime Scheduling for Parallelism. In Proceedings of the 19th International Symposium on Computer Architecture, May 1992.

    Google Scholar 

  9. Stephen W. Keckler, William J. Dally, Daniel Maskit, Nicholas P. Carter, Andrew Chang, and Whay S. Lee. Exploiting Fine-grain Thread-level Parallelism on the MIT Multi-ALU Processor. In Proceedings of the 25th International Symposium on Computer Architecture, June 1998.

    Google Scholar 

  10. Jeffery Kuskin et al. The Stanford FLASH Multiprocessor. In Proceedings of the 21st Annual Symposium on Computer Architecture, June 1994

    Google Scholar 

  11. James Laudon and Daniel Lenoski. The SGI Origin: a ccNUMA Highly Scalable Server. In Proceedings of the 24th Annual Symposium on Computer Architecture, June 1997.

    Google Scholar 

  12. Whay S. Lee, William J. Dally, Stephen W. Keckler, Nicholas P. Carter, and Andrew Chang. Efficient, Protected Message Interface in the MITM-Machine. In IEEE Computer, November 1998.

    Google Scholar 

  13. Kai Li. IVY: a Shared Virtual Memory System for Parallel Computing. In Proceedings of the International Conference on Parallel Processing, 1988.

    Google Scholar 

  14. Steven K. Reinhardt, James R. Larus, and David A. Wood. Tempest and Typhoon: Userlevel Shared Memory. In Proceedings of the 21st International Symposium on Computer Architecture, April 1994.

    Google Scholar 

  15. Steven K. Reinhardt, Robert W. Pfile, and David A. Wood. Decoupled Hardware Support for Distributed Shared Memory. In Proceedings of the 23rd Annual Symposium on Computer Architecture, May 1996

    Google Scholar 

  16. Daniel J. Scales, Kourosh Gharachorloo, and Chandramohan A. Thekkath. Shasta: a Low Overhead, Software-only Approach for Supporting Fine-grained Shared Memory. In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, October 1996.

    Google Scholar 

  17. Ioannis Schoinas et al. Fine-grain Access Control for Distributed Shared Memory. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, October 1994.

    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

P., N., J., W., S., W., Keckler, S.W., Chang, A. (2000). Processor Mechanisms for Software Shard Memory. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-39999-2_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41128-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics