Encyclopedia of Parallel Computing

2011 Edition
| Editors: David Padua

Tera MTA

  • Burton Smith
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-09766-4_221

Synonyms

Definition

The MTA (for Multi-Threaded Architecture) is a highly multithreaded scalar shared-memory multiprocessor architecture developed by Tera Computer Company (renamed Cray Inc. in 2000) in Seattle, Washington. Work began in 1985 at The Institute for Defense Analyses Center for Computing Sciences on a closely related predecessor (Horizon), and development of both hardware and software was continuing at Cray Inc. as of 2010.

Discussion

Introduction

The Tera MTA [1] is in many respects a direct descendant of the Denelcor HEP computer [2]. Like the HEP, the MTA is a scalar shared-memory system equipped with full/empty bits at every 64-bit memory location and multiple protection domains to permit multiprogramming within a processor. However, the MTA introduced a few innovations including VLIW instructions without any register set partitioning, additional ILP via dependence data encoded in each instruction, two-phase blocking synchronization,...

This is a preview of subscription content, log in to check access.

Bibliography

  1. 1.
    Alverson R, Callahan D, Cummings D, Koblenz B, Porterfield A, Smith B (1990) The Tera computer system. In: Proceedings of the 1990 international conference on supercomputing, AmsterdamGoogle Scholar
  2. 2.
    Smith BJ (1981) Architecture and applications of the HEP multiprocessor computer system. Proc SPIE Real-Time Signal Process IV 298:241–248Google Scholar
  3. 3.
    Kuehn JT, Smith BJ (1988) The Horizon supercomputing system: architecture and software. In: Proceedings of the 1988 ACM/IEEE conference on supercomputing, OrlandoGoogle Scholar
  4. 4.
    Thistle MR, Smith BJ (1988) A processor architecture for Horizon. In: Proceedings of the 1988 ACM/IEEE conference on supercomputing, OrlandoGoogle Scholar
  5. 5.
    Callahan D, Smith B (1990) A future-based parallel language for a general-purpose highly-parallel computer. In: Selected papers of the second workshop on languages and compilers for parallel computing, IrvineGoogle Scholar
  6. 6.
    Halstead RH (1985) MultiLisp: a language for concurrent symbolic computation. ACM T Program Lang Syst 7(4):501–538zbMATHGoogle Scholar
  7. 7.
    Alverson G, Briggs P, Coatney S, Kahan S, Korry R (1997) Tera hardware-software cooperation. In: Proceedings of supercomputing, San JoseGoogle Scholar
  8. 8.
    Ladner RE, Fischer MJ (1980) Parallel prefix computation. J ACM 27(4):831–838zbMATHMathSciNetGoogle Scholar
  9. 9.
    Callahan D (1991) Recognizing and parallelizing bounded recurrences. In: Proceedings of the fourth workshop on languages and compilers for parallel computing, Santa ClaraGoogle Scholar
  10. 10.
    Lam M (1988) Software pipelining: an effective scheduling technique for VLIW machines. In: Proceedings of the ACM SIGPLAN 88 conference on programming language design and implementation, AtlantaGoogle Scholar
  11. 11.
    Polychronopoulos C, Kuck D (1987) Guided self-scheduling: a practical scheduling scheme for parallel supercomputers. IEEE T Comput C-36(12):1425–1439Google Scholar
  12. 12.
    Alverson G, Alverson R, Callahan D, Koblenz B, Porterfield A, Smith B (1992) Exploiting heterogeneous parallelism on a multithreaded multiprocessor. In: Proceedings of the 1992 international conference on supercomputing, Washington, DCGoogle Scholar
  13. 13.
    Anderson T, Bershad B, Lazowska E, Levy H (1992) Scheduler activations: effective kernel support for the user-level management of parallelism. ACM T Comput Syst 10(1):53–79Google Scholar
  14. 14.
    Norton A, Melton E (1987) A class of Boolean linear transformations for conflict-free power-of-two stride access. In: Proceedings of the international conference on parallel processing, St. Charles, ILGoogle Scholar
  15. 15.
    Alverson R (1991) Integer division using reciprocals. In: Proceedings of the 10th IEEE symposium on computer arithmetic, GrenobleGoogle Scholar
  16. 16.
    Akers S, Krishnamurthy B (1989) A group-theoretic model for symmetric interconnection networks. IEEE T Comput C-38(4):555–566MathSciNetGoogle Scholar
  17. 17.
    Alverson G, Kahan S, Korry R, McCann C, Smith B (1995) Scheduling on the Tera MTA. In: Proceedings of the first workshop on job scheduling strategies for parallel processing, Santa Barbara. Lecture Notes in Computer Science 949:19–44Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Burton Smith
    • 1
  1. 1.Microsoft CorporationRedmondUSA