On the Analysis and Synthesis of VLSI Algorithms

DOI10.1109/TC.1982.1675929MaRDI QIDQ3954816zbMATH OpenFDO

Authors Dan I. Moldovan

Publication date 1982

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1982.1675929

zbMATH Keywords

data dependenciesmapping algorithms into hardwareparallel processingtransformations of algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25) Algorithms in computer science (68W99)

Cited in

(16)

• 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
• 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
• Some applications of combinatorial optimization in parallel computing
• Computing transitive closure on systolic arrays of fixed size
• A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems

This page was built for publication: On the Analysis and Synthesis of VLSI Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954816)