Skip to main content
SpringerLink
Log in

Project Triton: Towards Improved Programmability of Parallel Computers

  • Chapter
The Interaction of Compilation Technology and Computer Architecture

  • 59 Accesses

Abstract

The main objective of Project Triton is adequate programmability of massively parallel computers. This goal can be achieved by tightly coupling the design of programming languages and parallel hardware.

The approach taken in the Project Triton is to let high-level, machine independent parallel programming languages drive the design of parallel hardware. This approach permits machine-independent parallel programs to be compiled into efficient machine code. The main results are as follows:

  • Modula-2*. This language extends Modula-2 with constructs for expressing a wide range of parallel algorithms in a portable, problem-oriented, and readable way.

  • Compilation Techniques. We present techniques for the efficient translation of Modula-2* and similar imperative languages for several modern parallel machines and derive recommendations for future parallel architectures.

  • Triton/1 Parallel Architecture. Triton/1 is a scalable mixed-mode SIMD/MIMD parallel computer with a highly efficient communications network. It overcomes several deficiencies of current parallel hardware and adequately supports high-level parallel languages.

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

Access this chapter

Log in via an institution
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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Selim G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Englewood Cliffs, New Jersey, 1989.

    MATH  Google Scholar 

  2. M. Auguin and F. Boeri. The OPSILA computer. In M. Consard, editor, Parallel Languages and Architectures, pages 143–153. Elsevier Science Publishers, Holland, 1986.

    Google Scholar 

  3. N. G. De Bruijn. A combinatorial problem. In Proc. of the Sect, of Science Akademie van Wetenschappen, pages 758–764, Amsterdam, June 29, 1946.

    Google Scholar 

  4. Peter Christy. Virtual processors considered harmful. In Proc. of the 6th Distributed Memory Computing Conference, pages 99–103, Portland, Oregon, April 28-May 2, 1991.

    Google Scholar 

  5. William J. Dally and Charles L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–553, 1987.

    Article  Google Scholar 

  6. John T. Feo, editor. A Comparative Study of Parallel Programming Languages: The Salishan Problems. Elsevier Science Publishers, Holland, 1992.

    Google Scholar 

  7. Geoffrey Fox, Seema Hiranandani, Ken Kennedy, Charles Koelbel, Uli Kremer, Chau-Wen Tseng, and Min-You Wu. Fortran D language specification. Technical Report CRPC-TR90079, Center for Research on Parallel Computation, Rice University, December 1990.

    Google Scholar 

  8. Alan Gibbons and Wojciech Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988.

    MATH  Google Scholar 

  9. Philipp J. Hatcher and Michael J. Quinn. Data-Parallel Programming on MIMD Computers. MIT Press Cambridge, Massachusetts, London, England, 1991.

    MATH  Google Scholar 

  10. Ernst A. Heinz. Modula-3*: An efficiently compilable extension of Modula-3 for explicitly parallel problem-oriented programming. In Joint Symposium on Parallel Processing, pages 269–276, Waseda University, Tokyo, May 17–19, 1993.

    Google Scholar 

  11. Ernst A. Heinz and Michael Philippsen. Synchronization barrier elimination in synchronous forall statements. Technical Report No. 13/93, University of Karlsruhe, Department of Informatics, April 1993.

    Google Scholar 

  12. Christian G. Herter, Thomas M. Warschko, Walter F. Tichy, and Michael Philippsen. Triton/1: A massively-parallel mixed-mode computer designed to support high level languages. In 7th International Parallel Processing Symposium, Proc. of 2nd Workshop on Heterogeneous Processing, pages 65–70, Newport Beach, CA, April 13-16, 1993.

    Google Scholar 

  13. Takeshi Horie, Hiroaki Ishihata, Toshiyuki Shimizu, Sadayuki Kato, Satoshi Inano, and Morio Ikesaka. AP1000 architecture and performance of LU decomposition. In Proc. of the 1991 International Conference on Parallel Processing, volume I, pages 634–645, August 1991.

    Google Scholar 

  14. High Performance Fortran (HPF): Language specification. Technical report, Center for Research on Parallel Computation, Rice University, 1992.

    Google Scholar 

  15. Makoto Imase and Masaki Itoh. Design to minimize diameter on building-block network. IEEE Transactions on Computers, C-30(6):439–442, June 1981.

    Article  MathSciNet  Google Scholar 

  16. Joseph JóJó. An Introduction to Parallel Algorithhms. Addison-Wesley, Reading, Mass., 1992.

    Google Scholar 

  17. MasPar Computer Corporation. MasPar Parallel Application Language (MPL) Reference Manual, September 1990.

    Google Scholar 

  18. Piyush Mehrotra and John Van Rosendale. The BLAZE language: A parallel language for scientific programming. Parallel Computing, 5:339–361, November 1987.

    Article  MathSciNet  MATH  Google Scholar 

  19. David A. Patterson, Garth Gibons, and Randy H. Katz. A case for redundant arrays of inexpensive disks (RIAD). In Proc. of the 1988 ACM-SIGMOD Conference on Management of Data, pages 109–116, Chicago, June 1-3, 1988.

    Google Scholar 

  20. Michael Philippsen. Automatic data distribution for nearest neighbor networks. In Frontiers’ 92: The Fourth Symposium on the Frontiers of Massively Parallel Computation, pages 178–185, Mc Lean, Virginia, October 19-21, 1992.

    Google Scholar 

  21. Michael Philippsen, Ernst A. Heinz, and Paul Lukowicz. Compiling machine-independent parallel programs. ACM SIGPLAN Notices, 28(8):99–108, August 1993.

    Article  Google Scholar 

  22. Michael Philippsen and Markus U. Mock. Data and process alignment in Modula-2*. In Christoph W. Kessler, editor, Automatic Parallelization-New Approaches to Code Generation, Data Distribution, and Performance Prediction, pages 171–191, AP’93 Saarbrücken, Germany, March 1-3, 1993, 1994. Verlag Vieweg, Wiesbaden, Germany, Advanced Studies in Computer Science.

    Google Scholar 

  23. Michael Philippsen and Walter F. Tichy. Modula-2* and its compilation. In First International Conference of the Austrian Center for Parallel Computation, Salzburg, Austria, 1991, pages 169–183. Springer Verlag, Lecture Notes in Computer Science 591, 1992.

    Google Scholar 

  24. Lutz Prechelt. Measurements of MasPar MP-1216A communication operations. Technical Report No. 1/93, University of Karlsruhe, Department of Informatics, January 1993.

    Google Scholar 

  25. M. Rosing, R. Schnabel, and R. Weaver. DINO: Summary and example. In Proc. of the Third Conference on Hypercube Concurrent Computers and Applications, pages 472–481, Pasadena, CA, 1988. ACM Press, New York.

    Google Scholar 

  26. David Sankoff and Joseph B. Kruskal (eds). Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, Mass., 1983.

    Google Scholar 

  27. H.J. Siegel, T. Schwederski, J.T. Kuehn, and N.J. Davis. An overview of the PASM parallel processing system. In D.D. Gajski, V.M. Milutinovic, H.J. Siegel, and B.P. Furht, editors, Computer Architecture, pages 387–407. IEEE Computer Society Press, Washington, DC, 1987.

    Google Scholar 

  28. Burton J. Smith. Architecture and applications of the HEP multiprocessor computer system. In Real Time Signal Processing IV, Proceedings of SPIE, pages 241–248. International Society for Optical Engineering, 1981.

    Google Scholar 

  29. Thinking Machines Corporation, Cambridge, Massachusetts. *Lisp Reference Manual, Version 5.0, 1988.

    Google Scholar 

  30. Thinking Machines Corporation, Cambridge, Massachusetts. C* Language Reference Manual, April 1991.

    Google Scholar 

  31. Walter F. Tichy and Christian G. Herter. Modula-2*: An extension of Modula-2 for highly parallel, portable programs. Technical Report No. 4/90, University of Karlsruhe, Department of Informatics, January 1990.

    Google Scholar 

  32. Walter F. Tichy, Michael Philippsen, and Phil Hatcher. A critique of the programming language C*. Communications of the ACM, 35(6):21–24, June 1992.

    Article  Google Scholar 

  33. Reinhard v. Hanxleden and Ken Kennedy. Relaxing SIMD control flow constraints using loop transformations. Technical Report CRPC-TR92207, Center for Research on Parallel Computation, Rice University, April 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Karlsruhe, Germany

    Michael Philippsen, Thomas M. Warschko, Walter F. Tichy, Christian G. Herter, Ernst A. Heinz & Paul Lukowicz

Authors
  1. Michael Philippsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas M. Warschko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter F. Tichy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christian G. Herter
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ernst A. Heinz
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Paul Lukowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, Minnesota, USA

    David J. Lilja

  2. Advanced Computer Research Institute, Lyon, France

    Peter L. Bird

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media New York

About this chapter

Cite this chapter

Philippsen, M., Warschko, T.M., Tichy, W.F., Herter, C.G., Heinz, E.A., Lukowicz, P. (1994). Project Triton: Towards Improved Programmability of Parallel Computers. In: Lilja, D.J., Bird, P.L. (eds) The Interaction of Compilation Technology and Computer Architecture. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2684-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2684-1_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6154-1

  • Online ISBN: 978-1-4615-2684-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation