Synthesizing embedded speed-optimized architectures

IEEE Journal of Solid-State Circuits

Volumn 28, Issue 3, 1993, Pages 242-252

  Gebotys, Catherine H ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; MATHEMATICAL PROGRAMMING; OPTIMIZATION;

ASIC DESIGN; DESIGN OPTIMIZATION; HIGH LEVEL SYNTHESIS TOOLS; INTEGER PROGRAMMING; VLSI DESIGN;

VLSI CIRCUITS;

EID: 0027558825     PISSN: 00189200     EISSN: 1558173X     Source Type: Journal    
DOI: 10.1109/4.209990     Document Type: Article

References (19)

1. S. Devadas and A. R. Newton, “Algorithms for hardware allocation in data path synthesis,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 768–781, July 1989.
2. C. H. Gebotys and M. I. Elmasry, “Optimal synthesis of highperformance architectures,” IEEE J. Solid-State Circuits, vol. 27, no. 3, pp. 389–397, 1992.
3. L. Ramachandran and D. D. Gajski, “An algorithm for component selection in performance optimized scheduling,” in Proc. IEEE ICCAD, 1991, pp. 92–95.
4. R. Zahir and W. Fichtner, “Making use of timing constraints for controller synthesis,” presented at the Workshop on High Level Synthesis, 1989.
5. N. Park and A. Parker, “Sehwa: A software package for synthesis of pipelines from behavioral specifications,” IEEE Trans. Computer-Aided Design, vol. 7, no. 3, pp. 356–370, Mar. 1988.
6. L. Hafer and A. Parker, “A formal method for the specification, analysis and design of register-transfer-level digital logic,” IEEE Trans. Computer-Aided Design, vol. CAD-2, no. 1, pp. 4–17, 1983.
7. C. H. Gebotys, “Optimal scheduling and allocation of embedded VLSI chips,” presented at the ACM/IEEE, Design Automation Conf., 1992.
8. D. C. Ku and G. DeMicheli, “Relative scheduling under timing constraints: Algorithms for high-level synthesis of digital circuits,” IEEE Trans. Computer-Aided Design, vol. 11, no. 6, pp. 696–718, 1992.
9. A. Brooke, D. Kendricke, and A. Meeraus, GAMS/MINOS Users Manual. New York: Scientific Press, 1988.
10. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley Interscience, 1988.
11. H. Crowder, E. L. Johnson, and M. Padberg, “Solving large scale zero-one linear programming problems,” Operations Res., vol. 31, no. 5, pp. 803–834, 1983.
12. C-T Hwang, J-H. Lee, and Y-C. Hsu, “A formal approach to the scheduling problem in high-level synthesis,” IEEE Trans. Computer-Aided Design, vol. 10, no. 4, pp. 464–475, 1991.
13. C. H. Gebotys and M. I. Elmasry, Optimal VLSI Architectural Synthesis: Area, Performance, Testability. Norwell, MA: Kluwer Academic, 1992.
14. C. H. Gebotys, “Synthesizing embedded speed-optimized architectures,” presented at the IEEE Custom Integrated Circuits Conf., 1992.
15. High-Level Synthesis-Benchmarks-Clearinghouse, Coordinator N. Dutt, dutt@ics.uci.edu., 1992.
16. S. Prakash and A. C. Parker, “Synthesis of application-specific multiprocessor architectures,” in Proc. Design Automation Conf., 1991, pp. 8–13.
17. S. Note, F. Catthoor, G. Goossens, and H. DeMan, “Combined hardware selection and pipelining in high performance data path design,” IEEE Trans. Computer-Aided Design, vol. 11, no. 4, 413–423 1992.
18. K. R. Baker, Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
19. C. H. Gebotys, “Optimal synthesis of multichip architectures,” presented at the IEEE Int. Conf. Computer Aided Design, 1992.