Linear programming for hazard elimination in asynchronous circuits

  • L. Lavagno
  • N. Shenoy
  • A. Sangiovanni-Vincentelli
Article

Abstract

Hazards can be globally eliminated from an asynchronous circuit synthesized from a Signal Transition Graph by repeatedly solving an appropriate Linear Program. This article describes how to analyze the STG specification and the synthesized circuit, using bounded delay information, to formulate the problem and use a branch-and-bound procedure to solve it. Known information about the environment delays can be expressed as time bounds on the external signal transitions, and it can be exploited by the proposed methodology.

Keywords

State Graph Padding Combinational Logic Constraint Graph Marked Graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V.I. Varshavsky, et al.,Self-timed Control of Concurrent Processes, Boston, MA: Kluwer Academic Publishers, 1990. (Russian edition: 1986).CrossRefMATHGoogle Scholar
  2. 2.
    T.A. Chu, “Synthesis of self-timed VLSI circuits from graphtheoretic specifications,” Ph.D. thesis, MIT, June 1987.Google Scholar
  3. 3.
    S. Burns and A. Martin, “A synthesis method for self-timed VLSI circuits,”Proceedings of the International Conference on Computer Design, 1987.Google Scholar
  4. 4.
    T. Meng, “Asynchronous design for digital signal processing architectures,” Ph.D. thesis, U.C. Berkeley, November 1988.Google Scholar
  5. 5.
    L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Algorithms for synthesis of hazard-free asynchronous circuits,”Proceedings of the Design Automation Conference, June 1991.Google Scholar
  6. 6.
    S.M. Nowick and D.L. Dill, “Automatic synthesis of locallyclocked asynchronous state machines,”Proceedings of the International Conference on Computer-Aided Design, November 1991.Google Scholar
  7. 7.
    L.Y. Rosenblum and A.V. Yakovlev, “Signal graphs: from selftimed to timed ones,”International Workshop on Timed Petri Nets, Torino, Italy, 1985.Google Scholar
  8. 8.
    T.-A. Chu, “Synthesis of self-timed control circuits from graphs: an example,”Proceedings of the International Conference on Computer Design, 1986, pp. 565–571.Google Scholar
  9. 9.
    S.H. Unger,Asynchronous Sequential Switching Circuits, Wiley Interscience, 1969.Google Scholar
  10. 10.
    P.A. Beerel and T. H.-Y. Meng. “Gate-level synthesis of speedindependent asynchronous control circuits,”ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, March 1992.Google Scholar
  11. 11.
    T.-A. Chu, “On the models for designing VLSI asynchronous digital systems,”Integration: the VLSI journal, vol. 4, 1986, pp. 99–113.Google Scholar
  12. 12.
    C.A. Petri, “Kommunikation mit automaten,” Ph.D. thesis, Bonn, Institut für Instrumentelle Mathematik, 1962.Google Scholar
  13. 13.
    J.L. Peterson,Petri Nets, volume 9. ACM Computing Surveys, No. 3, September 1977.Google Scholar
  14. 14.
    T. Murata, “Petri Nets: Properties, analysis and applications,”Proceedings of the IEEE, April 1989, pp. 541–580.Google Scholar
  15. 15.
    M. Hack, “Analysis of production schemata by petri nets,” Technical Report TR 94, Project MAC, MIT, 1972.Google Scholar
  16. 16.
    C.W. Moon, P.R. Stephan, and R.K. Brayton, “Synthesis of hazard-free asynchronous circuits from graphical specifications,”Proceedings of the International Conference on Computer-Aided Design, November 1991.Google Scholar
  17. 17.
    P. Vanbekbergen, “Optimized synthesis of asynchronous control circuits from graph-theoretic specifications,”Proceedings of the International Conference on Computer-Aided Design, November 1990, pp. 184–187.Google Scholar
  18. 18.
    L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli, “Synthesis of verifiably hazard-free asynchronous control circuits,” Technical Report UCB/ERL M90/99, U.C. Berkeley, 1990.Google Scholar
  19. 19.
    E.B. Eichelberger, “Hazard detection in combinational and sequential switching circuits,”IBM Journal of Research and Development, vol. 9, March 1965.Google Scholar
  20. 20.
    R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A. Sangiovanni-Vincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic Publishers, 1984.CrossRefMATHGoogle Scholar
  21. 21.
    S.M. Nowick and D.L. Dill, “Exact two-level minimization of hazard-free logic with multiple-input changes,”Proceedings of the International Conference on Computer-Aided Design, November 1992.Google Scholar
  22. 22.
    J.A. Brzozowski and C.-J. Seger, “Advances in asynchronous circuit theory—part ii: Bounded inertial delay models, mos circuits, design techniques,”Bulletin of the European Association of Theoretical Computer Science, March 1991.Google Scholar
  23. 23.
    M.R. Garey and D.S. Johnson,Comuters and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, 1979.Google Scholar
  24. 24.
    P. Vanbekbergen, G. Goossens, and H. DeMan, “Specification and analysis of timing constraints in signal transition graphs,Proceedings of the European Design Automation Conference, 1992, pp. 302–306.Google Scholar
  25. 25.
    K. McMillan and D. Dill, “Algorithms for interface timing verification,”ACM Intl. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, March 1992.Google Scholar
  26. 26.
    D. Wong, G. DeMicheli, and M. Flynn, “Inserting active delay elements to achieve wave pipelining,”Proceedings of the International Conference on Computer-Aided Design, November 1989, pp. 270–273.Google Scholar
  27. 27.
    S.M. Burns, “Performance analysis and optimization of asynchronous circuits,” Ph.D. thesis, California Institute of Technology, December 1990.Google Scholar
  28. 28.
    C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, 1982, Englewood Cliffs, N.J.: Prentice-Hall.MATHGoogle Scholar
  29. 29.
    Ellen M. Sentovich, Kanwar Jit Singh, Luciano Lavagno, Cho Moon, Rajeev Murgai, Alexander Saldanha, Hamid Savoj, Paul R. Stephan, Robert K. Brayton, and Alberto SangiovanniVincentelli, “SIS: A system for sequential circuit synthesis,” Technical Report UCB/ERL M92/41, U.C. Berkeley, May 1992.Google Scholar
  30. 30.
    E.M. Sentovich, K.J. Singh, C. Moon, H. Savoj, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, “Sequential circuit design using synthesis and optimization,”Proceedings of the International Conference on Computer Design, October 1992.Google Scholar

Copyright information

© Kluwer Academic Publishers 1994

Authors and Affiliations

  • L. Lavagno
    • 1
  • N. Shenoy
    • 1
  • A. Sangiovanni-Vincentelli
    • 1
  1. 1.Department of EECS. 207-69 Cory HallUniversity of CaliforniaBerkeley

Personalised recommendations