scientific article; zbMATH DE number 3845501

MaRDI QIDQ3315439zbMATH OpenFDO

Authors Charles E. Leiserson, James B. Saxe

Publication date 1983

zbMATH Keywords

design methodology of efficient VLSI algorithmsremoving combinational ripplingsingle-destination- shortest-paths problemsystolic implementations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Retiming synchronous circuitry
• On the capabilities of systolic systems
• Understanding retiming through maximum average-delay cycles
• The Design of Optimal Systolic Arrays
• scientific article; zbMATH DE number 3943033

Cited in

(16)

• An algebraic model of synchronous systems
• Decoupling the dimensions of a system of affine recurrence equations
• Foundations of a theory of synchronous systems
• Optimal loop storage allocation for argument-fetching dataflow machines
• Variables bounding based retiming algorithm.
• The application of a sequence notation to the design of systolic computations
• A convex programming solution for gate-sizing with pipelining constraints
• scientific article; zbMATH DE number 3943033 (Why is no real title available?)
• scientific article; zbMATH DE number 4011943 (Why is no real title available?)
• On the capabilities of systolic systems
• Understanding retiming through maximum average-delay cycles
• Using fixed-point semantics to prove retiming lemmas
• Data-dependency graph transformations for instruction scheduling
• Improved matrix triangularisation using a double pipeline systolic array
• Retiming synchronous circuitry
• Partitioning circuits for improved testability

This page was built for publication:

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