The PCP/PFP programming models on the BBN TC2000
Conference
·
OSTI ID:5603324
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 TC2000 machine 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.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- Sponsoring Organization:
- DOE; USDOE, Washington, DC (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5603324
- Report Number(s):
- UCRL-JC-107019; CONF-9109137--1; ON: DE91011537
- Country of Publication:
- United States
- Language:
- English
Similar Records
BBN TC2000 architecture and progamming models
Split-join and message passing programming models on the BBN TC2000
PDDP: A parallel data distribution preprocessor
Conference
·
Wed Oct 31 23:00:00 EST 1990
·
OSTI ID:6133715
Split-join and message passing programming models on the BBN TC2000
Conference
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:5836942
PDDP: A parallel data distribution preprocessor
Conference
·
Wed Jul 01 00:00:00 EDT 1992
·
OSTI ID:10176024