In order to improve the speed, we would like to have many ... The communication scheme should be very well planned in order to get a good parallel algorithm. ...
The field of parallel processing is concerned with architectural and algorithmic ... 'Introduction to Parallel Processing' by B. Parhami, Plenum Press. ...
In a SIMD computer, each processor can execute or ignore the instruction being ... A degree-4 chordal ring with skip distance s; i.e., a p-node ring in which ...
A 2D torus has long wraparound links that can slow down inter-processor ... However, we can use the method of folding to lay out a 2D torus in such a way ...
We examine some of the following five simple building-block parallel operations ... A special case of semi-group computation, namely, maximum finding, is shown ...
... with node in-degree and out-degree of q/2, called a pruned q-cube. Find the diameter of such a pruned q-cube. Find the bisection width of such a pruned q-cube. ...
... are then obtained by pair-wise combination of adjacent partial results in a single step. ... for the PRAM broadcasting algorithms in the lecture note. ...
A solution is to prohibit branching at intermediate nodes, leading to a ... used is 21, and the maximum distance from the source to destination is 6 hops. ...
... turns without reintroducing cycles. An Example. Consider a ... There are 8 possible turns and two possible abstract cycles. XY routing prohibits 4 of them. ...
... a short delay, and wormhole routers can be clocked at a very high frequency. ... can be transmitted across a physical channel in a single clock cycle, rendering ...