Results 1 
2 of
2
Data Parallel Programming: A Survey and a Proposal for a New Model
, 1993
"... We give a brief description of what we consider to be data parallel programming and processing, trying to pinpoint the typical problems and pitfalls that occur. We then proceed with a short annotated history of data parallel programming, and sketch a taxonomy in which data parallel languages can be ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We give a brief description of what we consider to be data parallel programming and processing, trying to pinpoint the typical problems and pitfalls that occur. We then proceed with a short annotated history of data parallel programming, and sketch a taxonomy in which data parallel languages can be classified. Finally we present our own model of data parallel programming, which is based on the view of parallel data collections as functions. We believe that this model has a number of distinct advantages, such as being abstract, independent of implicitly assumed machine models, and general.
AND
, 1987
"... We present a mathematical model of parallel computing in a hypercubical parallel computer. This is based on embedding binary trees or forests into the ndimensional hypercube. We consider three different models corresponding to three different computing situations. First we assume that the processin ..."
Abstract
 Add to MetaCart
We present a mathematical model of parallel computing in a hypercubical parallel computer. This is based on embedding binary trees or forests into the ndimensional hypercube. We consider three different models corresponding to three different computing situations. First we assume that the processing time at each level of the binary tree is arbitrary, and develop the corresponding mathematical model of an embedding of a binary tree into the hypercube. Then we assume that the processing time at each level of the binary tree is the same for all processors involved at that level, and for this we develop the mathematical model of a loop embedding of a binary tree into the hypercube. The most general case is that in which only certain neighboring levels are active. Here we assume for simplicity that only the processors corresponding to two neighboring levels are active at the same time, and correspondingly we develop the mathematical model of a level embedding of a binary tree into the hypercube to cover this case. Both loop embeddings and level embeddings allow us to use the same processor several times during the execution Of a program. 0 1989 Academic press, IIIC. With the advent of VLSI the use of a parallel processor system consisting of many small processors which are connected homogeneously becomes a feasible approach to the design of massively parallel computer architecture design. The connection machine of [ 21 consisting of 64,000 processors is an example of the combination of VLSI technology with highly homogeneous hypercubical connection to achieve a massively parallel computer system. Having many processors connected in parallel, the next crucial problem