Skip to main content

The PCP/PFP programming models on the BBN TC2000

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1991)

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

  • 149 Accesses

Abstract

We describe the PCP/PFP programming models which we are using on the BBN TC2000. The parallel programming models are implemented in a portable manner and will be useful on the scalable shared memory machines we expect to see in the future. We then describe the TC20machine architecture which is a scalable general purpose parallel architecture capable of efficiently supporting both shared memory and message passing programming paradigms. We also briefly describe a PCP implementation of the Gauss elimination algorithm which exploits the large local memories on the TC2000.

Work performed under the auspices of the U. S. Department of Energy by the Lawrence Livermore National Laboratory under contract No. W-7405-ENG-48.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. F. Pfister, et al, “The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture”, Proc. of the 1985 International Conference on Parallel Processing, pp. 764–771, August 20–23, 1985.

    Google Scholar 

  2. E. D. Brooks III, PCP: A Parallel Extension of C that is 99% Fat Free, UCRL-99673, Lawrence Livermore National Laboratory, 1988.

    Google Scholar 

  3. H. F. Jordan, “The Force: A Highly Portable Parallel Programming Language”, Proceeding of the International Conference on Parallel Processing, August, 1989.

    Google Scholar 

  4. F. Darema, D. A. George, V. A. Norton and G. F. Pfister, “A single-program-multiple data computational model for EPEX/FORTRAN”, Parallel Computing, April, 1988.

    Google Scholar 

  5. A. H. Karp, “Programming for Parallelism”, Computer, May 1987, pp. 43–57.

    Google Scholar 

  6. Cray Research,Inc., Autotasking User's Guide, SN-2088, Cray Research Inc., Technical Publications, 1345 Northland Drive, Mendota Heights, Minnesota 55120

    Google Scholar 

  7. BBN Advanced Computers Inc., Inside the TC2000, Cambridge, MA, 1989.

    Google Scholar 

  8. H. J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, 2nd edition, McGraw Hill, New York, 1990.

    Google Scholar 

  9. BBN Advanced Computers Inc., TC2000 Fortran Reference, Cambridge, MA, 1989.

    Google Scholar 

  10. Brent Gorda, Karen Warren, and Eugene D. Brooks III, Programming in PCP, UCRL-MA-107029, Lawrence Livermore National Laboratory, March, 1991.

    Google Scholar 

  11. Karen Warren, Brent Gorda, and Eugene D. Brooks III, Programming in PFP, UCRL-MA-107028, Lawrence Livermore National Laboratory, March, 1991.

    Google Scholar 

  12. D. Hensgen, R. Finkel, U. Manber, “Two Algorithms for Barrier Synchronization”, International Journal of Parallel Programming, vol. 17(1), pp. 1–17, 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans P. Zima

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brooks, E.D., Gorda, B.C., Warren, K.H. (1992). The PCP/PFP programming models on the BBN TC2000. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-55437-8_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55437-0

  • Online ISBN: 978-3-540-47073-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics