Coordinated parallelizing compiler optimizations and high-level synthesis

ACM Transactions on Design Automation of Electronic Systems

Volumn 9, Issue 4, 2004, Pages 441-470

  Gupta, Sumit ^a,d   Gupta, Rajesh Kumar ^b,e   Dutt, Nikil D ^c   Nicolau, Alexandru ^c  

^a Tallwood Venture Capital ^*  (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Talhvood Venture Capital   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30744468841     PISSN: 10844309     EISSN: 10844309     Source Type: Journal    
DOI: 10.1145/1027084.1027087     Document Type: Article

References (56)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers:Principles and Techniques and Tools. AddisonWesley, Reading, Mass.
2. BACON, D. F., GRAHAM, S. L., AND SHARP, O. J. 1994. Compiler transformations for high-performance computing. ACM Comput. Surv. 26, 4, 345-420.
3. BERGAMASCHI, R. 1999. Behavioral network graph unifying the domains of high-level and logic synthesis. In Design Automation Conference. 213-218.
4. ACM Transactions on Design Automation of Electronic Systems, Vol. 9, No. 4, October 2004.
5. BRAYTON, R., CAMPOSANO, R., MICHELI, G. D., OTTEN, R., AND VAN EIJNDHOVEN, J. 1988. The Yorktown Silicon Compiler System. Addison-Wesley, Chapter in Silicon Compilation.
6. CAMPOSANO, R. AND WOLF, W. 1991. High Level VLSI Synthesis. Kluwer Academic.
7. Celoxica. Celoxica incorporated. DK Design Suite.
8. CHAIYAKUL, V., GAJSKI, D., AND RAMACHANDRAN, L. 1992. Minimizing syntactic variance with assignment decision diagrams. Tech. Rep. ICS-TR-92-34, Department of Information and Computer Science, Univ. of California, Irvine.
9. DE MICHELI, G. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York.
10. DOS SANTOS, L. 1998. Exploiting instruction-level parallelism: a constructive approach. Ph.D. thesis, Electrical Engineering department, Eindhoven University of Technology.
11. EBCIOGLU, K. AND NICOLAU, A. 1989. A global resource-constrained parallelization technique. In 3rd International Conference on Supercomputing. 154-163.
12. FISHER, J. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput. 30, 478-490.
13. FORTE. Forte Design Systems. Behavioral Design Suite.
14. GAJSKI, D. D., DUTT, N. D., WU, A. C.-H., AND LIN, S. Y.-L. 1992. High-Level Synthesis: Introduction to Chip and System Design. Kluwer Academic.
15. GET2CHIP. Get2Chip Incorporated (acquired by Cadence). G2C Architectural Compiler.
16. GIMP WEBSITE. GNU Image Manipulation Program, http://uwy.gimp.org.
17. GIRKAR, M. AND POLYCHRONOPOULOS, C. 1992. Automatic extraction of functional parallelism from ordinary programs. IEEE Trans. Parall. Distrib. Syst. 3, 166-178.
18. GUPTA, S., DUTT, N., GUPTA, R., AND NICOLAU, A. 2003a. SPARK: A high-level synthesis framework for applying parallelizing compiler transformations. In Proceedings of the International Conference on VLSI Design. 461-466.
19. GUPTA, S., GUPTA, R., DUTT, N., AND NICOLAU, A. 2004. SPARK: A Parallelizing Approach to the High-Level Synthesis of Digital Circuits. Kluwer Academic.
20. GUPTA, S., KAM, T., KISHINEVSKY, M., ROTEM, S., SAVOIU, N, DUTT, N., GUPTA, R., AND NICOLAU, A. 2002a. Coordinated transformations for high-level synthesis of high performance microprocessor blocks. In Proceedings of the Design Automation Conference. 898-903.
21. GUPTA, S., MIRANDA, M., CATTHOOR, F., AND GUPTA, R. 2000. Analysis of high-level address code transformations for programmable processors. In Design, Automation and Test in Europe. 9-13.
22. GUPTA, S., RESHADI, M., SAVOIU, N., DUTT, N., GUPTA, R., AND NICOLAU, A. 2002b. Dynamic common sub-expression elimination during scheduling in high-level synthesis. In Proceedings of the International Symposium on System Synthesis. 261-266.
23. GUPTA, S., SAVOIU, N., DUTT, N., GUPTA, R., AND NICOLAU, A. 2001a. Conditional speculation and its effects on performance and area for high-level synthesis. In Proceedings of the International Symposium on System Synthesis. 171-176.
24. GUPTA, S., SAVOIU, N., DUTT, N., GUPTA, R., AND NICOLAU, A. 2003b. Using global code motions to improve the quality of results for high-level synthesis. IEEE Trans. CAD 23, 2 (Feb.).
25. GUPTA, S., SAVOIU, N., KIM, S., DUTT, N., GUPTA, R., AND NICOLAU, A. 2001b. Speculation techniques for high level synthesis of control intensive designs. In Proceedings of the Design Automation Conference. 269-272.
26. HAYNAL, S. 2000. Automata-Based Symbolic Scheduling. Ph.D. dissertation, Electrical and Computer Engineering department, University of California, Santa Barbara.
27. IQBAL, Z., POTKONJAK, M., DEY, S., AND PARKER, A. 1993. Critical path optimization using retiming and algebraic speed-up. In Proceedings of the Design Automation Conference. 573-577.
28. JANSSEN, M., CATTHOOR, F., AND MAN, H. D. 1994. A specification invariant technique for operation cost minimisation in flow-graphs. In Proceedings of the International Symposium on High-level Synthesis. 146-151.
29. KENNEDY, R., CHAN, S., LIU, S.-M., IO, R., Tu, P., AND CHOW, F. 1999. Partial redundancy elimination in SSA form. ACM Trans. Prag. Lang. Syst. 21, 3 (May), 627-676.
30. KOUNTOURIS, A. AND WOLINSKI, C. 1999. High level pre-synthesis optimization steps using hierarchical conditional dependency graphs. In Proceedings of the Euromicro Confernce. 1290-1294.
31. KU, D. AND MICHELI, G. D. 1990. Relative scheduling under timing constraints. In Proceedings of the Design Automation Conference. 59-64.
32. LAKSHMINARAYANA, G., RAGHUNATHAN, A., AND JHA, N. 1999. Wavesched: A novel scheduling technique for control-flow intensive designs. IEEE Trans. CAD, 18, 505-523.
33. LI, J. AND GUPTA, R. 1997. Decomposition of Timed Decision Tables and its use in presynthesis optimizations. In Proceedings of the International Conference on Computer Aided Design. 22-27.
34. LOBO, D. AND PANGRLE, B. 1991. Redundant operator creation: A scheduling optimization technique. In Proceedings of the Design Automation Conference. 775-778.
35. MCFARLAND, M. C. 1978. The Value Trace: A database for automated digital design. Technical Report DRC-01-4-80, Carnegie-Mellon University, Design Research Center.
36. MEDIABENCH. UCLA Mediabench benchmark suite, http://cares.icsl.ucla.edu/ MediaBench/.
37. MIRANDA, M., CATTHOOR, F., JANSSEN, M., AND MAN, H. D. 1998. High-level address optimisation and synthesis techniques for data-transfer intensive applications. IEEE Trans. VLSI Syst. 6, 4 (December), 677-686.
38. MUCHNICK, S. S. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann, Reading, Mass.
39. NICOLAU, A. 1985. A development environment for scientific parallel programs. Tech. Rep. TR 86-722, Department of Computer Science, Cornell University.
40. NICOLAU, A. AND NOVACK, S. 1993. Trailblazing: A hierarchical approach to Percolation Scheduling. In Proceedings of the International Conference on Parallel Processing. 87-96.
41. NOVACK, S. AND NICOLAU, A. 1994. Mutation scheduling: A unified approach to compiling for finegrain parallelism. In Languages and Compilers for Parallel Computing. 16-30.
42. NOVACK, S. AND NICOLAU, A. 1996. An efficient, global resource-directed approach to exploiting instruction-level parallelism. In Proceedings of the Conference on Parallel Architectures and Compilation Techniques. 87-96.
43. ORAILOGLU, A. AND GAJSM, D. 1986. Flow graph representation. In Proceedings of the Design Automation Conference. 503-509.
44. PARK, S. AND CHOI, K. 2001. Performance-driven high-level synthesis with bit-level chaining and clock selection. IEEE Trans. CAD, 20, 2 (Feb.), 1999-212.
45. PASKO, R., SCHAUMONT, P., DERUDDER, V., VERNALDE, S., AND DURACKOVA, D. 1999. A new algorithm for elimination of common subexpressions. IEEE Trans. CAD, 18, 1 (Jan), 58-68.
46. PEYMANDOUST, A. AND MICHELI, G. D. 2001. Symbolic algebra and timing driven data-flow synthesis. In Proceedings of the International Conference on Computer Aided Design. 300-305.
47. POTKONJAK, M. AND RABAEY, J. 1994. Optimizing resource utlization using tranformations. IEEE Trans. CAD, 13, 277-293.
48. POTKONJAK, M., SRIVASTAVA, M., AND CHANDRAKASAN, A. 1996. Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common subexpression elimination. IEEE Trans. CAD, 15, 2 (Mar), 141-150.
49. RADIVOJEVIC, I. AND BREWER, F. 1996. A new symbolic technique for control-dependent scheduling. IEEE Trans. CAD, 15, 45-57.
50. RIM, M., FANN, Y., AND JAIN, R. 1995. Global scheduling with code-motions for high-level synthesis applications. IEEE Trans. VLSI Systems, 3, 379-392.
51. SPARK WEBSITE. SPARK parallelizing high-level synthesis framework website. http://mesl.ucsd.edu/spark.
52. SREEDHAR, V, GAO, G. R., AND LEE, Y.-F. 1996. A new framework for exhaustive and incremental data flow analysis using D J graphs. In Proceedings of the ACM SIGPLAN Conf. on PLDI, ACM, New York, 279-290.
53. SREEDIIAR, V, GAO, G. R., AND LEE, Y.-F. 1997. Incremental computation of dominator trees. ACM Trans. Prag. Lang. Syst. 19, 2 (Mar.), 239-252.
54. WAKABAYASHI, K. 1999. C-based synthesis experiences with a behavior synthesizer, "Cyber". In Proceedings of the Design, Automation and Test in Europe. 390-393.
55. WAKABAYASHI, K. AND TANAKA, H. 1992. Global scheduling independent of control dependencies based on condition vectors. In Proceedings of the Design Automation Conference. 112-115.
56. WALKER, R. AND THOMAS, D. 1989. Behavioral transformation for algorithmic level IC design. IEEE Trans. CAD, 8, 1115-1128.