Architectural Optimization Methods for Control-Dominated Machines

  • Wayne Wolf
  • Andrés Takach
  • Tien-Chien Lee
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 136)


We are building the Princeton University Behavioral Synthesis System (PUBSS) as a testbed for high-level synthesis methods. Our research in high-level synthesis is guided by two principles: concentration on control-dominated machines and development of optimization methods for partially-specified architectures.


Basic Block Product Machine Control Flow Graph Level Synthesis Register Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. E. Thomas, E. D. Lagnese, R. A. Walker, J. A. Nestor, J. V. Rajan, and R. L. Blackburn. Algorithmic and Regiter-Transfer Level Synthesis: The System Architect’s Workbench. Kluwer Academic Publishers, Boston, 1990.CrossRefGoogle Scholar
  2. [2]
    David Knapp, John Granacki, and Alice Parker. An expert synthesis system. In Proceedings, ICCAD-83, pages 164–165. ACM/IEEE, September 1983.Google Scholar
  3. [3]
    Wolfgang Rosentiel and Raul Camposano. Synthesizing circuits from behavioral level specifications. In C. J. Koomen and T. Moto-oka, editors, Computer Hardware Description Languages and their Applications, pages 391–403. Elsevier Science Publishers B. V., 1985.Google Scholar
  4. [4]
    R. K. Brayton, R. Camposano, G. De Michell, R. H. J. M. Otten, and J. van Eijndhoven. The Yorktown Silicon Compiler. In Daniel D. Gajski, editor, Silicon Compilation, pages 204–310. Addison-Wesley, 1988.Google Scholar
  5. [5]
    P. G. Paulin, J. P. Knight, and E. F. Girczyc. Hal: A multi-paradigm approach to automatic data path synthesis. In Proceedings, 23rd Design Automation Conference, pages 263–270. ACM/IEEE, June 1986.Google Scholar
  6. [6]
    H. DeMan, J. Rabaey, P. Six, and L. Claesen. Cathedral-II: A silicon compiler for digital signal processing. IEEE Design & Test, 3(6):13–25, December 1986.CrossRefGoogle Scholar
  7. [7]
    Gaetano Borriello. A New Interface Specification Methodology and itsApplication to Transducer Synthesis. PhD thesis, University of California, Berkeley, May 1988. Report No. UCB/CSD 88/430.Google Scholar
  8. [8]
    John Nestor. Specification and Synthesis of Digital Systems with Interfaces. PhD thesis, Carnegie-Mellon University, April 1987. Report No. CMUCAD 87–10.Google Scholar
  9. [9]
    Sally Hayati and Alice Parker. Automatic production of controller specifications from control and timing descriptions. In Proceedings, 26th Design Automation Conference, pages 75–80. ACM/IEEE, June 1989.Google Scholar
  10. [10]
    J. A. Nestor and G. Krishnamoorthy. Salsa: a new approach to scheduling with timing constraints. In Proceedings, 26th Design Automation Conference, pages 262–265. ACM/IEEE, June 1989.Google Scholar
  11. [11]
    D. Ku and G. D. Micheli. Relative scheduling under timing con-straints. In Proceedings, 27th Design Automation Conference, pages 59–64. ACM/IEEE, June 1990.Google Scholar
  12. [12]
    Srinivas Devadas and Kurt Keutzer. An automata-theoretic approach to behavioral equivalence. In Proceedings, ICCAD-90, pages 30–33. IEEE Computer Society Press, 1990.Google Scholar
  13. [13]
    Giovanni De Micheli and David C. Ku. HERCULES - a system for high-level synthesis. In Proceedings, 25th Design Automation Conference, pages 483–498. ACM/IEEE, June 1988.Google Scholar
  14. [14]
    Edward A. Snow. Automation of Module Set Independent Register-Transfer Level Design. PhD thesis, Carnegie-Mellon University, April 1978.Google Scholar
  15. [15]
    Michael C. McFarland, S.J. The Value Trace: A database for automated digital design. Master’s thesis, Carnegie-Mellon University, December 1978.Google Scholar
  16. [16]
    David W. Knapp and Alice C. Parker. A data structure for VLSI synthesis and verification. Technical report, Computer Research Institute, University of Southern California, August 1985.Google Scholar
  17. [17]
    Alex Orailoglu and Daniel D. Gajski. Flow graph representation. In Proceedings, 23th Design Automation Conference, pages 503–509. ACM/IEEE, June 1986.Google Scholar
  18. [18]
    Zvi Kohavi. Switching and Finite Automata Theory. McGraw-Hill, New York, second edition, 1978.MATHGoogle Scholar
  19. [19]
    Miriam Leeser and Wayne Wolf. Behavior fsms for high-level verification and synthesis. Technical Report CE-W90–8 (Princeton), Cornell University/Princeton University, August 1990. presented at ACM 1991 Workshop on Formal Methods in VLSI Design.Google Scholar
  20. [20]
    Tiziano Villa and Alberto Sangiovanni-Vincentelli. Algorithms for state assignment of finite-state machines for optimal two-level implementations. In Proceedings, International Workshop on Logic Synthesis. MCNC, May 1989.Google Scholar
  21. [21]
    R. K. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang. MIS: A multiple-level logic optimization system. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-6(6):1062–1081, November 1987.CrossRefGoogle Scholar
  22. [22]
    Carl Sechen and Alberto Sangiovanni-Vincentelli. The TimberWolf placement and routing package. IEEE Journal of Solid State Circuits, SC-20(2):510–522, April 1985.CrossRefGoogle Scholar
  23. [23]
    Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319–349, July 1987.MATHCrossRefGoogle Scholar
  24. [24]
    Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In SIGPLAN Notices, 1989. From 1989 ACM Principles of Programming Languages Conference.Google Scholar
  25. [25]
    Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Priniciples, Techniques, and Tools. Addison-Wesley, Reading MA, 1986.Google Scholar
  26. [26]
    Howard Trickey. Flamel: a high-level hardware compiler. IEEE Transactions on Computer-Aided Design, CAD-6(2):259–269, March 1987.CrossRefGoogle Scholar
  27. [27]
    Wayne Wolf. The FSM network model for behavioral synthesis of controldominated machines. In Proceedings, 27th Design Automation Conference, pages 692–697. ACM Press, June 1990.Google Scholar
  28. [28]
    Wayne Wolf. Automata-theoretic methods for high-level synthesis of control-dominated machines. Technical Report CE-W90–9, Princeton University, September 1990.Google Scholar
  29. [29]
    Sudhir Aggarwal, Daniel Barbará, and Kalman Z. Meth. SPANNER: a tool for the specification, analysis, and evaluation of protocols. IEEE Transactions on Software Engineering, SE-13(12):1218–1237, December 1987.MATHCrossRefGoogle Scholar
  30. [30]
    P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1), January 1989.Google Scholar
  31. [31]
    E. M. Clarke, D. E. Long, and K. L. McMillan. A language for compositional specification and verification of finite state hardware controllers. In J. A. Darringer and F. J. Rammig, editors, Computer Hardware Description Languages and their Applications, pages 281–295. Elsevier Science Publishers B. V., 1990.Google Scholar
  32. [32]
    Wayne Wolf. An algorithm for nearly-minimal collapsing of finite-state machine networks. In Proceedings, ICCAD-90, pages 80–83, November 1990.Google Scholar
  33. [33]
    Michael C. McFarland, Alice C. Parker, and Raul Camposano. The high-level synthesis of digital systems. Proceedings of the IEEE, 78:301–318, February 1990.CrossRefGoogle Scholar
  34. [34]
    Wayne Wolf. State scheduling for controller cost. Technical report, Computer Engineering Program, Department of Electrical Engineering, Princeton University, July 1990.Google Scholar
  35. [35]
    Viktors Berstis. The V compiler: automating hardware design. IEEE Design & Test, pages 8–17, April 1989.Google Scholar
  36. [36]
    Raul Camposano. Path scheduling. IEEE Transactions on CAD/ICAS, January 1991.Google Scholar
  37. [37]
    John W. Tukey. Exploratory Data Analysis. Addison-Wesley, 1977.MATHGoogle Scholar
  38. [38]
    Wayne Wolf. Rescheduling for cycle time by reverse engineering. In Proceedings, ACM Tau ‘80 Workshop. University of British Columbia, August 1990.Google Scholar

Copyright information

© Springer Science+Business Media New York 1991

Authors and Affiliations

  • Wayne Wolf
    • 1
  • Andrés Takach
    • 1
  • Tien-Chien Lee
    • 1
  1. 1.Department of Electrical EngineeringPrinceton UniversityUSA

Personalised recommendations