skip to main content
10.1145/509593.509631acmconferencesArticle/Chapter ViewAbstractPublication PagesscConference Proceedingsconference-collections
Article
Free Access

Tera hardware-software cooperation

Published:15 November 1997Publication History

ABSTRACT

The development of Tera's MTA system was unusual. It respected the need for fast hardware and large shared memory, facilitating execution of the most demanding parallel application programs. But at the same time, it met the need for a clean machine model enabling calculated compiler optimizations and easy programming; and the need for novel architectural features necessary to support fast parallel system software. From its inception, system and application needs have molded the MTA architecture. The result is a system that offers high performance and ease of programming by virtue not only of fast physical hardware and flat shared memory, but also of the streamlined software systems that well utilize the features of the architecture intended to support them.

References

  1. Gail Alverson, Simon Kahan, Richard Korry, Cathy McCann, and Burton Smith. Scheduling on the Tera MTA. In Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science. Springer-Verlag, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Robert Alverson, David Callahan, Daniel Cummings, Brian Koblenz, Allan Porterfield, and Burton Smith. The Tera computer system. In Proceedings of the 1990 ACM International Conference on Supercomputing, pages 1-6, June 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. H. Bailey, E. Barszcz, J. T. Barton, D. S. Browning, R. L. Carter, L. Dagum, R. A. Fatoohi, P. O. Fredrickson, T. A. Lasinski, R. S. Schreiber, H. D. Simon, V. Venkatakrishnan, and S. K. Weeratunga. The NAS parallel benchmarks --- Summary and preliminary results. In Proceedings of Supercomputing '91, pages 158-165, November 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. David Callahan. Recognizing and parallelizing bounded recurrences. In U. Banerjee, D. Gellernter, A. Nicoalu, and D. Padua, editors, Languages and Compilers for Parallel Computing, volume 589 of Lecture Notes in Computer Science, pages 169-185. Springer-Verlag, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. David Callahan, Steve Carr, and Ken Kennedy. Improving register allocation for subscripted variables. SIGPLAN Notices, 25(6):53-65, June 1990. Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. David Callahan and Burton Smith. A future-based parallel language for a general-purpose highly-parallel computer. In David Gelernter, Alexandru Nicolau, and David Padua, editors, Languages and Compilers for Parallel Computing, pages 95-113. The MIT Press, Cambridge, Massachusetts, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Mark Linton. The evolution of DBX. In USENIX Summer Conference, 1990.Google ScholarGoogle Scholar
  8. Richard Stallman and Cygnus Support. Debugging with GDB, January 1994.Google ScholarGoogle Scholar
  9. Roy F. Touzeau. A Fortran compiler for the FPS-164 Scientific Computer. SIGPLAN Notices, 19(6):48-57, June 1984. Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Michael Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Tera hardware-software cooperation

    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
      SC '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing
      November 1997
      921 pages
      ISBN:0897919858
      DOI:10.1145/509593

      Copyright © 1997 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: 15 November 1997

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate1,516of6,373submissions,24%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader