Flamel: A High-Level Hardware Compiler

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

Volumn 6, Issue 2, 1987, Pages 259-269

  Trickey, Howard ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES - PASCAL;

FLAMEL; HARDWARE COMPILER;

COMPUTER HARDWARE;

EID: 0023312914     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/TCAD.1987.1270270     Document Type: Article

References (29)

1. A. C. Parker, D. Thomas, D. Siewiorek, M. Barbacci, L. Hafer, G. Lieve, and J. Kim, “The CMU design automation system,” in ACM IEEE 16th Design Automation Conf. Proc. (San Diego), 1979, pp. 73–80.
2. T. J. Kowalski, “The VLSI design automation assistant: A knowledge-based expert system,” Ph.D. thesis, Carnegie Mellon Univ., 1984. Available as CMU Technical Report CMUCAD-84-29.
3. T. J. Kowalski and D. E. Thomas, “The VLSI design automation assistant: Prototype system,” in ACM IEEE 20th Design Automation Conf. Proc. (Miami), 1983, pp. 479–483.
4. K. Palem, D. S. Fussel, and A. J. Welch, “High-level optimization in a silicon compiler,” Tech. Rep. TR-215, Dept. of Computer Sciences, University of Texas, Austin, TX, 1982.
5. D. Knapp, J. Granacki, and A. C. Parker, “An expert synthesis system,” in Proc. of the Int. Conf. on Computer Aided Design, ACM and IEEE, 1983, pp. 419–424.
6. T. J. Kowalski, D. J. Geiger, W. H. Wolf, and W. Fichtner, “The VLSI design automation assistant: From algorithms to silicon,” IEEE Design and Test, pp. 33–43. Aug. 1985.
7. P. E. Agre, “Designing a high-level silicon compiler,” in Proc. IEEE Int. Conf. on Computer Design: VLSI in Computers (Port Chester, NY), 1983, p. 413.
8. J. M. Siskind, J. R. Southard, and K. W. Crouch, “Generating custom high performance VLSI designs from succinct algorithmic descriptions,” in Proc. Conf on Advanced Research in VLSI, (MIT), Jan. 1982, pp. 28–39.
9. H. E. Shrobe, “The data path generator,” in Proc. Conf. on Advanced Research in VLSI, (MIT), Jan. 1982, pp. 175–181.
10. J. L. Hennessey, “SLIM: A simulation and implementation language for VLSI microcode,” Lambda, pp. 20–28. Apr. 1981.
11. A. R. Karlin, H. Trickey, and J. D. Ullman, “Experience with a regular expression compiler,” in Proc. IEEE Int. Conf. on Computer Design: VLSI in Computers (Port Chester, NY), 1983, pp. 656–665.
12. A. V. Aho and J. D. Ullman Principles of Compiler Design. Reading, MA: Addison-Wesley, 1977.
13. M. C. McFarland, “The VT: A database for automated digital design,” Tech. Rep. DRC-01-4-80, Design Research Center, Carnegie Mellon University, 1978.
14. G. S. Tjaden and M. J. Flynn, “Detection and parallel execution of independent instructions,” IEEE Trans. Comput., vol. C-19, no. 10, pp. 889–895, 1970.
15. H. Trickey, “Compiling Pascal programs into silicon,” Ph.D. thesis, Stanford Univ., July 1985. Stanford Computer Science Report STAN-CS-85-1059.
16. D. J. Kuck The Structure of Computers and Computations, vol. I. New York: Wiley, 1978.
17. P. M. Kogge and H. S. Stone, “A parallel algorithm for efficient solution of a general class of recurrence equations,” IEEE Trans. Comput., vol. C-22, pp. 786–792, Aug. 1973.
18. U. Banerjee, D. Gajski, and D. J. Kuck, “Array machine control units for loops containing IFs,” in Proc. 1980 IEEE Int. Conf. on Parallel Processing, 1980, pp. 23–36.
19. C. Y. Hitchcock III and D. E. Thomas, “A method of automatic data path synthesis,” in ACM IEEE 20th Design Automation Conf. Proc. (Miami), 1983, pp. 484–489.
20. J. R. Southard, “MacPitts: An approach to silicon compilation,” Computer, vol. 16, pp. 74–82, Dec. 1983.
21. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291–307, 1970.
22. F. Chow, “A portable machine-independent global optimizer—Design and measurements,” Ph.D. thesis, Stanford Univ., Dec. 1983.
23. S. Przybylski, T. Gross, J. Hennessy, N. Jouppi, and C. Rowen, “Organization and VLSI implementation of MIPS,” J. of VLSI and Computer Systems, vol. 1, Spring 1984. Available as Tech. Rep. 83–259, 259, CSL, Stanford.
24. B. W. Kernighan and P. J. Plauger Software Tools in Pascal. Reading, MA: Addison-Wesley, 1981.
25. J. Newkirk, R. Mathews, J. Redford, and C. Burns, “Stanford nMOS cell library,” Tech. Rep. 001, Information Systems Laboratory, Stanford Univ., 1981.
26. D. D. Gajski, D. A. Padua, D. J. Kuck, and R. H. Kuhn, “A second opinion on data flow machines,” Computer, vol. 15, pp. 58–69, Feb. 1982.
27. J. A. Fisher, J. R. Ellis, J. C. Ruttenberg, and A. Nicolau, “Parallel processing: A smart compiler and a dumb machine,” in Proc. ACM SIGPLAN Symp. on Compiler Construction (Montreal, Canada), 1984, pp. 37–47.
28. D. J. Kuck, “Measurements of parallelism in ordinary FORTRAN programs,” Computer, vol. 7, pp. 37–46, Jan. 1974.
29. J. A. Fisher, “Trace scheduling: A technique for global microcode compaction,” IEEE Trans. Comput., vol. C-30, pp. 478–490, July 1981.