Paralation views: Abstractions for efficient scientific computing on the connection machine. Technical report
Technical Report
·
OSTI ID:5005260
An ideal parallel programming language for scientific applications should provide flexible abstraction mechanisms for writing organized and readable programs, encourage a modular programming style that permits using libraries of tested routines, and, above all, permit the programming to write efficient programs for the target machine. These criteria are used to evaluate the languages Lisp, Connection Machine Lisp, and Paralation Lisp for writing scientific programs on the Connection Machine. As a vehicle for this exploration, the authors fix a particular non-trivial algorithm (LU decomposition with partial pivoting) and study code for implementing it in the three languages.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge, MA (USA). Lab. for Computer Science
- OSTI ID:
- 5005260
- Report Number(s):
- AD-A-213935/0/XAB; MIT/LCS/TM--398
- Country of Publication:
- United States
- Language:
- English
Similar Records
Applications of the connection machine
Scientific applications of the Connection Machine
Scientific Component Technology Initiative
Journal Article
·
Wed Dec 31 23:00:00 EST 1986
· Computer; (United States)
·
OSTI ID:7190078
Scientific applications of the Connection Machine
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5217338
Scientific Component Technology Initiative
Technical Report
·
Thu Feb 06 23:00:00 EST 2003
·
OSTI ID:15003248