22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) (1981)
Oct. 28, 1981 to Oct. 30, 1981
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1981.34
The complexity of integrated-circuit chips produced today makes it feasible to build inexpensive, special-purpose subsystems that rapidly solve sophisticated problems on behalf of a general-purpose host computer. This paper contributes to the design methodology of efficient VLSI algorithms. We present a transformation that converts synchronous systems into more time-efficient, systolic implementations by removing combinational rippling. The problem of determining the optimized system can be reduced to the graph-theoretic single-destination-shortest-paths problem. More importantly from an engineering standpoint, however, the kinds of rippling that can be removed from a circuit at essentially no cost can be easily characterized. For example, if the only global communication in a system is broadcasting from the host computer, the broadcast can always be replaced by local communication.
J. B. Saxe and C. E. Leiserson, "Optimizing synchronous systems," 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)(FOCS), vol. 00, no. , pp. 23-36, 1981.