On the Analysis and Synthesis of VLSI Algorithms
From MaRDI portal
Publication:3954816
DOI10.1109/TC.1982.1675929zbMath0492.68032MaRDI QIDQ3954816
Publication date: 1982
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
parallel processing; data dependencies; mapping algorithms into hardware; transformations of algorithms
Related Items
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS, Algorithm transformations for computational and data broadcast, Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm, Decomposing polynomial interpolation for systolic arrays, Total unfolding: theory and applications, FOLDING TRANSFORMATIONS ON SYSTOLIC AND VLSI PROCESSOR ARRAYS, Algorithm transformations for the data broadcast elimination method, NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS, Computing transitive closure on systolic arrays of fixed size, A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems, Synthesis and equivalence of concurrent systems, Decoupling the dimensions of a system of affine recurrence equations, Computability of affine non-conditional recurrent systems, The application of a sequence notation to the design of systolic computations, Systolic computation of interpolating polynomials
