skip to main content
10.1145/165939.165970acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article
Free Access

Anatomy of a message in the Alewife multiprocessor

Published:01 August 1993Publication History

ABSTRACT

Shared-memory provides a uniform and attractive mechanism for communication. For efficiency, it is often implemented with a layer of interpretive hardware on top of a message-passing communications network. This interpretive layer is responsible for data location, data movement, and cache coherence. It uses patterns of communication that benefit common programming styles, but which are only heuristics. This suggests that certain styles of communication may benefit from direct access to the underlying communications substrate. The Alewife machine, a shared-memory multiprocessor being built at MIT, provides such an interface. The interface is an integral part of the shared memory implementation and affords direct, user-level access to the network queues, supports an efficient DMA mechanism, and includes fast trap handling for message reception. This paper discusses the design and implementation of the Alewife message-passing interface and addresses the issues and advantages of using such an interface to complement hardware-synthesized shared memory.

References

  1. 1.Anant Agarwal, David Chaiken, Godfrey D'Souza, Kirk Johnson, David Kranz, John Kubiatowicz, Kiyoshi Kurihara, Beng-Hong Lira, Gino Maa, Dan Nussbaum, Mike Parkin, and Donald Yeung. The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor. In Proceedings of Workshop on Scalable Shared Memory Multiprocessors. Kluwer Academic Publishers, I991. An extended version of this paper has been submitted for publication, and appears as MIT/LCS Memo TM-454, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Thomas H. Dunigan. Kendall Square Multiprocessor: Early Experiences and Performance. Technical Report ORNL/TM-12065, Oak Ridge National Laboratory, March 1992.Google ScholarGoogle ScholarCross RefCross Ref
  3. 3.D. Lenoski, J. Laudon, K. Gharachorloo, W. Weber, A. Gupta, J. Hennessy, M. Horowitz, and M. Lain. The Stanford Dash Multiprocessor. IEEE Computer, 25(3):63-79, March 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.SPARC Architecture Manual, 1988. SUN Microsystems, Mountain View, California. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Charles L. Seitz. Concurrent VLSI Architectures. IEEE Transactions on Computers, C-33(12):I247-1265, December 1984.Google ScholarGoogle Scholar
  6. 6.William J. Dally. A VLSi Architecture for ConcurrentData Structures. Kluwer Academic Publishers, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.David Chaiken, John Kubiatowicz, and Anant Agarwal. LimitLESS Directories: A Scalable Cache Coherence Scheme. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV), pages 224-234. ACM, April 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Anant Agarwal, Richard Simoni, John Hennessy, and Mark Horowitz. An Evaluation of Directory Schemes for Cache Coherence. In Proceedings of the 15th International Symposium on Computer Architecture, New York, June 1988. IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Shekhar Borkar et al. iWarp: An integrated Solution to High-Speed Parallel Computing. In Proceedings of Supercomputing '88, November 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.William J. Dally et al. The J-Machine: A Fine-Grain Concurrent Computer. In Proceedings of the IFIP (International Federationfor In- .formation Processing), 11th Worm Congress, pages 1147-1153, New York, 1989. Elsevier Science Publishing.Google ScholarGoogle Scholar
  11. 11.Thorsten von Eicken, David Culler, Seth Goldstein, and Klaus Schauser. Active messages: A mechanism for integrated communication and computation. In 19th International Symposium on Computer Architecture, May 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Dana S. Henry and Christopher E Joerg. A Tightly-Coupled Processor- Network Interface. In Fifth Internataional Architectural Support .for Programming Languages and Operating Systems (ASPLOS V), Boston. October 1992. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.David Kranz, Kirk Johnson, Anant Agarwal, John Kubiatowicz, and Beng-Hong Lim. Integrating Message-Passing and Shared-Memory; Early Experience. In To appear in Proceedings of Practice and Principles of Parallel Programming (PPoPP) 1993, New York, NY, May 1993. ACM. Also as MIT/LCS TM-478, January 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.MIT-SPARCLE Specification Version 1.1 (Preliminary). LSI Logic Corporation, Milpitas, CA 95035, 1990. Addendum to the 648I 1 specification.Google ScholarGoogle Scholar
  15. 15.C.L. Seitz, N.j. Boden, J. Seizovic, and W.K. Su. The Design of the Caltech Mosaic C Multicomputer. In Research on Integrated Systems Symposium Proceedings, pages 1-22, Cambridge, MA, 1993. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Mark D. Hill, James R, Larus, Steven K. Reinhardt, and David A. Wood. Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors. In Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS V), Boston, October 1992. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.John Kubiatowicz. User's Manual for the A- 1000 Communications and Memory Management Unit. ALEWIFE Memo No. 19, Laboratory for Computer Science, Massachusetts Institute of Technology, January 1991.Google ScholarGoogle Scholar
  18. 18.John Kubiatowicz, David Chaiken, and Anant Agarwal. Closing the Window of Vulnerability in Multiphase Memory Transactions. In Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS V), pages 274-284, Boston, October 1992. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.D. Lenoski, J. Laudon, K. Gharachorloo, A. Gupta, and J. Hennessy. The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor. In Proceedings 17th Annual International Symposium on Computer Architecture, pages 148-159, New York, June 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.Anant Agarwal, John Kubiatowicz, David Kranz, Beng-Hong Lim, Donald Yeung, Godfrey D'Souza, and Mike Parkin. Sparcle: An Evolutionary Processor Design for Multiprocessors. To appear in IEEE Micro, June 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.E. Mohr, D. Kranz, and R. Halstead. Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs. IEEE Transactions on Parallel and Distributed Systems, 2(3):264-280, July 199 I. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.The Connection Machine System: Programming the NI. Thinking Machines Corporation, March 1992. Version 7.1.Google ScholarGoogle Scholar
  23. 23.K. Gharachorloo, D. Lenoski, J. Laudon, E Gibbons, A. Gupta, and J. Hennessy. Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In Proceedings 17th Annual International Symposium on Computer Architecture, New York, June 1990. IEEE, Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24.Bob Beck, Bob Kasten, and Shreekant Thakkar. VLSI Assist for a Multiprocessor. in Proceedings Second international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS II), Washington, DC, October 1987. IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25.A. Cox and R. Fowler. The Implementation of a Coherent Memory Abstraction on a NUMA Multiprocessor: Experiences with PLAT- INUM. In Proceedings of the 12th ACM Symposium on Operating Systems Principles, pages 32-44, December 1989. Also as a Univ. Rochester TR-263, May 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Anatomy of a message in the Alewife multiprocessor

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in
                  • Published in

                    cover image ACM Conferences
                    ICS '93: Proceedings of the 7th international conference on Supercomputing
                    August 1993
                    425 pages
                    ISBN:089791600X
                    DOI:10.1145/165939

                    Copyright © 1993 ACM

                    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 August 1993

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • Article

                    Acceptance Rates

                    Overall Acceptance Rate584of2,055submissions,28%

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader