Synthesizing linear array algorithms from nested FOR loop algorithms
From MaRDI portal
Publication:3814800
DOI10.1109/12.9735zbMath0663.68041MaRDI 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
hyperplane; parallel processing; VLSI; data dependence; matrix multiplication; algorithm transformations; linear systolic array; data contention; modularly extensible; nested for loops; path- finding
68Q25: Analysis of algorithms and problem complexity
68Q80: Cellular automata (computational aspects)
68W99: Algorithms in computer science
Related Items
Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming, Towards systolizing compilation, Computing transitive closure on systolic arrays of fixed size, The projection of systolic programs, Localization of edges in graph models of two-level algorithms, Mapping dynamic programming onto modular linear systolic arrays, LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
Uses Software