Proceedings of the IEEE · 1988 · 391 citations · 15 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureParallel ComputingAlgorithm AnalysisArray ProcessingDigital Signal ProcessingParallel Algorithm DesignParallel ArchitecturesParallel Computer ArchitectureParallel Computing ArchitecturesParallel Processing ArchitecturesParallel Signal ProcessingReal-time ProcessingReal-time Signal ProcessingSystolic Array DesignSystolic Arrays
Some recent results are summarized concerning a class of algorithms known as regular iterative algorithms, particularly with respect to their implementations on processor arrays. Regular iterative algorithms contain all algorithms executed by systolic arrays as a proper subclass and are therefore of considerable importance in real-time signal processing applications. Some general concepts concerning the design of parallel architectures are introduced, and the importance of devising special techniques that utilize any available structure in the algorithm is highlighted. A generic description of the existing methodologies for the systematic design of systolic arrays is given. Using some simple examples, the limitations of these methods are shown. A formal methodology is proposed that overcomes the difficulties in the existing procedures.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
15
NP-complete scheduling problems
Jeffrey D. Ullman · Journal of Computer and System Sciences · 1975 · 1.4K citations
Samuel Seely · Proceedings of the IEEE · 1963 · 405 citations
On the design of algorithms for VLSI systolic arrays
Dan Moldovan · Proceedings of the IEEE · 1983 · 392 citations