Paralation Views: Abstractions for Efficient Scientific Computing on the Connection Machine.

摘要

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. We use these criteria 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, we fix a particular non-trivial algorithm (LU decomposition with partial pivoting) and study code for implementing it in the three languages. Keywords: Programming languages; Parallel programming languages; SIMD architectures; Connection machine; Scientific programming; Data abstraction. (JES)