Efficient scheduling of conditional behaviors for high-level synthesis

ACM Transactions on Design Automation of Electronic Systems

Volumn 7, Issue 3, 2002, Pages 380-412

  Kountouris, Apostolos A ^a   Wolinski, Christophe ^b  

^a Mitsubishi Electric ITE TCL   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Conditional behavior; Design automation; High level synthesis (HLS); Scheduling

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER HARDWARE; DATA FLOW ANALYSIS; HEURISTIC METHODS;

HIGH LEVEL SYNTHESIS (HLS);

COMPUTER AIDED LOGIC DESIGN;

EID: 0036660340     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/567270.567272     Document Type: Article

References (48)

1. Amagbegnon, T.P. 1995. Forme canonique arborescente des horloges de SIGNAL. PhD Thesis (December), University of Rennes I.
2. Beauvais, J.R., Gautier, T., Le Guernic, P., Houdebine, R., and Rutten, E. 1998. A translation of statecharts into Signal. In Proceedings of the IEEE International Conferance on Application of Concurrency to System Design (CSD'98, Japan, March), 52-62.
3. Bergamaschi, R.A. 1998. Behavioral synthesis: an overview. IBM Tech. Rep. RC20944.
4. Bergamaschi, R.A., Camposano, R., and Payer, M. 1992. Allocation algorithms based on path analysis. Integration: VLSI J. 13, 3 (Sept.), 283-299.
5. Bergamaschi, R.A. and Kuehlamann, A. 1993. A system for production use of high-level synthesis. IEEE Trans. VLSI Syst. 1, 3, 233-243.
6. Bergamaschi, R.A., Raje, S., Nair, I., and Trevillyan, L. 1997. Control-flow versus data-flow based scheduling: Combining both approaches in an adaptive scheduling system. IEEE Trans. VLSI 5, 1, 82-100.
7. Besnard, L. 1991. Compilation de SIGNAL: Horloges, dependances, environment. PhD Thesis, University of Rennes I.
8. Camposano, R. 1991. Path-based scheduling for synthesis. IEEE Trans. CAD 10, 1, 85-93.
9. Carter, L., Simon, B., Calder, B., Carter, L., and Ferrante, J. 1999. Predicated static single assignment. In Proceedings of the IEEE PACT-International Conferance on Parallel Architectures and Compilation Techniques (October), 245-255.
10. Chaiyakul, V., Gajski, D.D., and Ramachandran, L. 1992. Minimizing syntactic variance with assignment decision diagrams. UCI Tech. Rep. ICS-TR-92-34 (April).
11. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.K., and Zadeck, F.K. 1989. An efficient method of computing, static single assignment form. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 25-35.
12. Dos Santos, L.C.V. 1997. A method to control compensation code during global scheduling. Proceedings of the ProRISC CSSP97 Workshop, 457-464.
13. Dos Santos, L.C.V., Heijligers, M.J.M, Eijk, C.A.J., Van Eijndhoven, J.T.J., and Jess, J.A.G. 2000. A code motion pruning technique for global scheduling. ACM Trans. Des. Autom. Electron. Syst. 5, 1, 1-38.
14. Fisher, J.A. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput. 30, 7, (July), 478-490.
15. Garey, M.R. and Johnson, D.S. 1979. Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco.
16. Girkar, M. and Polychronopoulos, C. 1992. Automatic extraction of functional parallelism from ordinary programs. IEEE Trans. Par. Dist. Syst. 166-178.
17. Huang, S.H., Jeang, Y.L., Hwang, C.T., Hsu, Y.C., and Wang, J.F. 1993. A tree-based scheduling algorithm for control dominated circuits. In Proceedings of the ACM/IEEE Design Automation Conference, 578-582.
18. Juan, H.-P., Chaiyakul, V., and Gajski, D.D. 1994. Condition graphs for high quality behavioral synthesis. In Proceedings of ICCAD'94 (San Jose, Calif.).
19. Kifli, A., Goossens, G., and De Man, H. 1995. A unified scheduling model for high-level synthesis and code generation. In Proceedings of the EDTC'95 (Paris, March), 234-238.
20. Kim, T., Liu, J.W.S., and Liu, C.L. 1991. A scheduling algorithm for conditional resource sharing. In Proceedings of the ICCAD 91, 84-87.
21. Kim, T., Yonezawa, N., Liu, J.W.S., and Liu, C.L. 1994. A scheduling algorithm for conditional resource sharing-A hierarchical reduction approach. IEEE Trans. CAD 13, 4 (April), 425-438.
22. Kountouris, A. 1998. Outils pour la validation temporelle et l'optimisation de programmes synchrones. PhD Thesis, University of Rennes 1 (October).
23. Kountouris, A. and Wolinski, C. 1999. Hierarchical conditional dependency graphs for mutual exclusiveness identification. In Proceedings of the VLSI'99 (January), IEEE CS Press, Los Alamitos, Calif.
24. Kountouris, A. and Wolinski, C. 1999. High level pre-synthesis optimization steps using ierarchical conditional dependency graphs. In Proceedings of the 25th Euromicro Conference, Milano, Italy, (September), IEEE CS Press, Los Alamitos, Calif.
25. Kountouris, A. and Wolinski, C. 2001. High-level synthesis using hierarchical conditional dependency graphs in the CODESIS system. J. Syst. Arch. 47, 293-313.
26. Kuchcinski, K. and Wolinski, C. 2001. Synthesis of conditional behaviors using hierarchical conditional dependency graphs and constraint logic programming. In Proceedings of the Euromicro Conference, Poland, (September), IEEE CS Press. Los Alamitos, Calif.
27. Lakshminarayama, G., Khouri, K.S., and Jha, N.K. 1999. Wavesched: A novel scheduling technique for control-flow intensive designs. IEEE Trans. CAD 18, 5 (May), 505-523.
28. Lakshminarayama, G., Raghunatdan, A., and Jha, N.K 2000. Incorporating speculative execution into scheduling of control-flow intensive designs. IEEE Trans. CAD 19, 3 (March), 308-324.
29. Le Guernic, P., Le Borgne, M., Gautier, T., and Le Maire, C. 1991. Programming real-time applications with SIGNAL. Proc. IEEE 79, 9 (Sept.), 1321-1336.
30. Li, J. 1998. Timed decision tables and its applications in pre-synthesis and partial synthesis of digital circuits. PhD Thesis, UIUC.
31. Li, J. and Gupta, R.K. 1998. An algorithm to determine mutually exclusive operations in behavioral descriptions. In Proceedings of the DATE'98 (Paris, February).
32. Lin, Y.-L. 1997. Recent developments in high-level synthesis. ACM Trans. Des. Autom. Electron. Syst. 2, 1 (Jan.), 2-21.
33. Nicolau, A. 1985. Percolation scheduling: A parallel compilation technique. Tech. Rep. TR85-678, Cornell University, Computer Science Department (May).
34. Novack, S. and Nicolau, A. 1993. Trailblazing: A hierarchical approach to percolation scheduling. In Proceedings of the International Conference on Paralel Processing (2, August), 120-124.
35. Park, I.C. and Kyung, C.M. 1993. FAMOS: An efficient scheduling algorithm for high-level synthesis. IEEE Trans. CAD 12, 10 (Oct.), 1437-1448.
36. Parker, A.C., Pizarro, J.T. and Mliner, M. 1986. MAHA: A program for data path synthesis. In Proceedings of the 23rd DAC, 252-258.
37. Polychronopoulos, C. 1991. The hierarchical task graph and its use in auto-scheduling. In Proceedings of the ACM International Conference on Supercomputing, 252-263.
38. Potasman, R., Lis, J., Nicolau, A., and Gajski, D. 1990. Percolation based synthesis. In Proceedings of the ACM/IEEE Design Automation Conference, 444-449.
39. Puri, R. and Gu, J. 1992. An efficient algorithm for microword length minimization. In Proceedings of the DAC'92, 651-656.
40. Radivojevic, I. and Brewer, F. 1995. Analysis of conditional resource sharing using a guard-based control representation. In Proceedings of the ICCD'95 (October), 434-439.
41. Radivojevic, I. and Brewer, F. 1996. A new symbolic technique for control dependent scheduling. IEEE Trans. CAD 15, 1, 45-57.
42. Rim, M. and Jain, R. 1992. Representing conditional branches for high-level synthesis applications. In Proceedings of the 29th DAC (June), 106-111.
43. Stok, L. 1994. Data path synthesis. Integration: VLSI J. 18, 1 (December), 1-71.
44. SYNOPSYS, Behavioral Compiler online documentation.
45. Tseng, C.J., Wei, R.S., Rothweiler, S.G., Tong, M.M., and Bose, A.K. 1988. Bridge: A versatile behavioral synthesis system. In Proceedings of the 25th DAC (June), 415-420.
46. Tseng, C.J. and Siewiorek, D.P. 1986. Automated synthesis of data paths on digital systems. IEEE Trans. CAD 5, 3 (July), 379-395.
47. Wakabayashi, K. and Yoshimura, T. 1989. A resource sharing and control synthesis method for conditional branches. In Proceedings of the IEEE ICCAD-89, 62-65.
48. Wakabayashi, K. and Yoshimura, T. 1992. Global scheduling independent of control dependencies based on condition vectors. In Proceedings of the 29th DAC.