Abstract
A synchronous circuit built of functional elements and registers is a simple implementation of the semisystolic model of computation that can be used to design parallel algorithms. Retiming is a well-known technique that transforms a given circuit into a faster circuit by relocating its registers. We give tight bounds on the minimum clock period that can be achieved by retiming a synchronous circuit. These bounds are expressed in terms of the maximum delay-to-register ratio of the cycles in the circuit graph and the maximum propagation delayd max of the circuit components. Our bounds do not depend on the size of the circuit, and they are of theoretical as well as practical interest. They characterize exactly the minimum clock period that can be achieved by retiming a unit-delay circuit, and they lead to more efficient algorithms for several important problems related to retiming. Specifically, we give anO(V 1/2 E IgV) algorithm for minimum clock-period retiming of unit-delay circuitry. For non-unit-delay circuitry, we describe anO(VE Igd max ) algorithm for minimum clock-period retiming. We also describe anO(V 1/2 E lg2(Vd max ) algorithm for retiming with clock period that does not exceed the minimum by more thand max — 1. Finally, we give anO(E Igd max ) algorithm for minimum clock-period pipelining of combinational circuitry.
Similar content being viewed by others
References
T. H. Cormen, C. E. Leiserson, and R. L. Rivest.Introduction to Algorithms. McGraw-Hill, New York, MIT Press, Cambridge, MA, 1990.
S. Even and A. Litman. On the capabilities of systolic systems.Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 1991, pp. 357–367.
H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems.SIAM Journal on Computing, 18(5): 1013–1036, 1989.
R. M. Karp. A characterization of the minimum cycle mean in a digraph.Discrete Mathematics, 23:309–311, 1978.
E. L. Lawler.Combinatorial Optimization, Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
F. T. Leighton.Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufman, Los Altos, CA, 1992.
C. E. Leiserson. Area-Efficient VLSI Computation. Ph.D. thesis, Carnegie-Mellon University, 1981. Published in book form by MIT Press, Cambridge, MA, 1983.
C. E. Leiserson, F. M. Rose, and J. B. Saxe. Optimizing synchronous circuitry by retiming.Proceedings of the 3rd Caltech Conference on VLSI, 1983, pp. 87–116.
C. E. Leiserson and J. B. Saxe. Optimizing synchronous systems.Journal of VLSI and Computer Systems, 1(1):41–67, 1983.
C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry.Algorithmica, 6(1):5–35, 1991. Also available as MIT/LCS/TM-372.
J. B. Orlin and R. K. Ahuja. New Scaling Algorithms for the Assignment and Minimum Cycle Mean Problem. Technical Report 2019-88, Sloan School of Management, MIT, 1988.
C. Papadimitriou and K. Steiglitz.Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
M. C. Papaefthymiou. On Retiming Synchronous Circuitry and Mixed-Integer Optimization. Master's thesis, Massachusetts Institute of Technology, September 1990. Available as MIT/LCS/TR-486.
M. C. Papaefthymiou. Understanding retiming through maximum average-weight cycles.Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 1991, pp. 338–348.
Author information
Authors and Affiliations
Additional information
This research was supported in part by the Defense Advanced Research Projects Agency under Contract N00014-87-K-0825.
Rights and permissions
About this article
Cite this article
Papaefthymiou, M.C. Understanding retiming through maximum average-delay cycles. Math. Systems Theory 27, 65–84 (1994). https://doi.org/10.1007/BF01187093
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01187093