Synthesizing linear array algorithms from nested FOR loop algorithms
From MaRDI portal
Publication:3814800
DOI10.1109/12.9735zbMath0663.68041OpenAlexW2039154210MaRDI QIDQ3814800
Publication date: 1988
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.9735
hyperplaneparallel processingVLSIdata dependencematrix multiplicationalgorithm transformationslinear systolic arraydata contentionmodularly extensiblenested for loopspath- finding
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Algorithms in computer science (68W99)
Related Items
Mapping dynamic programming onto modular linear systolic arrays ⋮ The projection of systolic programs ⋮ Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming ⋮ Towards systolizing compilation ⋮ Localization of edges in graph models of two-level algorithms ⋮ LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS ⋮ Computing transitive closure on systolic arrays of fixed size
Uses Software