STAR: An Automatic Data Path Allocator

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 11, Issue 9, 1992, Pages 1053-1064

  Tsai, Fur Shing ^a   Hsu, Yu Chin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DIGITAL INTEGRATED CIRCUITS;

DATA PATH ALLOCATION; SILICON COMPILERS;

INTEGRATED CIRCUIT LAYOUT;

EID: 0026925325     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.159991     Document Type: Article

References (31)

1. D. Gajski, Silicon Compilation. Reading, MA: Addison-Wesley, 1988.
2. M. C. McFarland, A. C. Parker, and R. Campasano, “Tutorial on high-level synthesis,” in Proc. 25th Design Automation Conf., pp. 330–336, June 1988.
3. Y. C. Hsu and Y. L. Lin, “High-level synthesis in the THEDA system,” in High Level VLSI Synthesis, P. Camposano and W. Wolf, Eds. Norwell, MA: Kluwer Academic, 1991.
4. J. H. Lee, Y. C. Hsu, and Y. L. Lin, “A new integer linear programming formulation for the scheduling problem in data path synthesis,” in Proc. ICCAD-89, pp. 20–23, Nov. 1989.
5. J. T. Hwang, Y. C. Hsu, and Y. L. Lin, “Optimum and heuristic data path scheduling under resource constraints,” in Proc. 27th Design Automation Conf., pp. 65–70, June 1990.
6. C. T. Hwang, Y. C. Hsu, and Y. L. Lin, “Scheduling for functional pipelining and loop folding,” in Proc. 28th Design Automation Conf., pp. 764–769, June 1991.
7. S. Z. Lin, C. T. Hwang, and Y. C. Hsu, “Efficient microcode arrangement and controller synthesis for application specific integrated circuits,” Proc. of ICCAD-91, pp. 38–41, Nov. 1991.
8. D. E. Thomas, C. Y. Hitchcock, T. J. Kowalski, J. V. Rajan, and R. A. Walker, “Automated data path synthesis,” IEEE Computer, vol. 21, pp. 59–70, Dec. 1983.
9. C. Tseng and D. P. Siewiorek, “Automated synthesis of data paths in digital systems,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 379–395, July 1986.
10. B. M. Pangrle and D. Gajski, “State synthesis and connectivity binding for microarchitecture compilation,” in Proc. ICC AD-86, Nov. 1986.
11. B. M. Prangrle, “Splicer: A heuristic approach to connectivity binding,” in Proc. 25th Design Automation Conf., pp. 536–641, June 1988.
12. P. G. Paulin, J. P. Knight, and E. Gyrczyc, “HAL: A multiparadigm approach to automatic data path synthesis,” in Proc. 23rd Design Automation Conf., pp. 263–270, June 1986.
13. P. G. Paulin and J. P. Knight, “Scheduling and binding algorithm for high level synthesis,” in Proc. 26th Design Automation Conf., pp. 1–6, June 1989.
14. S. Devadas and A. R. Newton, “Algorithms for hardware allocation in data path synthesis,” IEEE Trans, on Computer-Aided Design, vol. 8, pp. 768–781, July 1989.
15. B. S. Haroun and M. I. Elmasry, “Architectural synthesis for DSP silicon compiler,” IEEE Trans. Computer-Aided, Design, vol. 8, pp. 431–447, Apr. 1989.
16. C. Y. Huang, Y. S. Chen, Y. L. Lin, and Y. C. Hsu, “Data path allocation based on bipartite weighted matching,” in Proc. 27th Design Automation Conf., pp. 499–504, June 1990.
17. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Englewood Cliffs, NJ: Prentice-Hall, 1982.
18. Kayhan Kucukcakar and Alice C. Parker, “Data path design tradeoffs using MALBAL,” Tech. Rep. CENG 89–21, Dep. of EE-Syçtems, Univ. Southern California, Los Angeles, 1989.
19. H. DeMan, J. Rabaey, P. Six, and L. Claesen, “Cathedral-II: A silicon compiler for digital signal processing,” IEEE Design and Test, pp. 13–25, Dec. 1986.
20. G. Goossens, J. Rabaey, J. Vandewalle, and H. D. Man, “An efficient microcode compiler for application specific DSP processor,” IEEE Trans. on Computer-Aided Design, vol. 9, pp. 925–937, Sept. 1990.
21. D. E. Thomas, E. D. Lagnese, R. A. Walker, J. A. Nestor, J. V. Rajan, and R. L. Blackburn, Algorithmic and Register Transfer Level Synthesis: The System Architect’s Workbench. Norwell, MA: Kluwer Academic, 1990.
22. D. E. Thomas et. al. “The system architect’s workbench,” in 25th Design Automation Conf., pp. 337–343, June 1988.
23. L. Stok, “Interconnect optimization during data path allocation,” in Fourth Int. Workshop on High-Level Synthesis. Kennebunkport, ME, pp. 15–18, Oct. 1989.
24. P. Pfahler, “Automated data path synthesis: A compilation approach,” in Microprocessing and Microprogramming, Amsterdam, The Netherlands: North-Holland, pp. 577–584, 1987.
25. S. Even, Graph Algorithms. New York: Computer Science Press, 1979.
26. A. V. Aho, R. Sethi, and J. D. Ullman, Compilers Principles, Techniques and Tools. Reading, MA: Addison-Wesley, 1986.
27. Matula, D. W., Marble, G., and Isaacson, J. D., “Graph coloring algorithms,” in Graph Theory and Computing, R. Read, Ed. New York: Academic, pp. 109–122, 1972.
28. E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms. New York: Computer Science Press, 1978.
29. F. S. Tsai and Y. C. Hsu, “Data path construction and refinement,” in Proc. of ICCAD-90, pp. 308–311, Nov. 1990.
30. D. J. Mallon and P. B. Denyer, “A new approach to pipeline optimization,” in Proc. European Design Automation Conf., Mar. 1990.
31. N. Park and A. C. Parker, “Sehwa: A software package for synthesis of piplines from behavioral specifications,” IEEE Trans. on Computer-Aided Design, vol. 7, pp. 356–370, Mar. 1988.