IEEE Transactions on Parallel and Distributed Systems · 1995 · 16 citations · 11 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingAlgorithm AnalysisArray ProcessingIterative SolversMatrix ComputationNumerical AlgorithmsNumerical Linear AlgebraComputational Matrix TheoryExecution Time AnalysisMatrix MultiplicationParallel Matrix AlgorithmsParallel Matrix MultiplicationParallel Sparse Linear AlgebraSparse Linear AlgebraSparse Matrix Computation
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. The regular iterative algorithms are then spacetime mapped to regular arrays, such as mesh, cylindrical, two-layered mesh, and orbital arrays. The proposed method can be used to design regular arrays with execution time of less than N (problem size).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
11
The Design of Optimal Systolic Arrays
Guojie Li, Wah · IEEE Transactions on Computers · 1985 · 229 citations