A two-step regularization method in which first permutation sequences and then broadcast planes are selected is proposed to design various regular iterative algorithms for matrix multiplication.Expand

The data-flow graph (DFG) is an important graph-theoretic model for multiprocessor implementation of real-time digital signal processing (DSP) algorithms.Expand

The method of decomposing a dependence graph into multiple phases with an appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure.Expand

We present some new regular iterative algorithms for matrix multiplication and transitive closure based on spacetime mapping the 2-D arrays with 2-1 and upper bound [(3N-1)/2] execution rime.Expand

The problem of designing space-optimal 2D regular arrays for N/spl times/N/spl Times/N cubical mesh algorithms with linear schedule ai+bj+ck, 1/Spl les/a/spl les/b/ spl les/c, and N=nc, is studied.Expand