PARALATION PROGRAMMING
Gary W. Sabot · International Journal of High Speed Computing · 1993
The paralation model consists of a new data structure and a small number of operators. The model has two main goals. As a model, it must be high-level and abstract. It should ask programmers to describe an algorithm, not every detail of the algorithm to hardware mapping. This leads to programming languages that are easy to use for general application programming. On the other hand, the constructs of the model must be easy to compile into efficient code for a variety of architectures (for example, MIMD or SIMD processors; bus-based, butterfly, or grid interconnect; and so on). An inefficient programming language, no matter how expressive and easy-to-use, cannot gain widespread acceptance.