Estimation of lower bounds in scheduling algorithms for high-level synthesis

ACM Transactions on Design Automation of Electronic Systems

Volumn 3, Issue 2, 1998, Pages 162-180

  Tiruvuri, Giri ^a,b   Chung, Moon ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b Michigan State University   (United States)

Author keywords

Algorithms; Design; Dynamic programming; Experimentation; High level synthesis; Lower bound estimates; Measurement; Performance; Scheduling

Indexed keywords

EID: 22444454816     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/290833.290839     Document Type: Article

References (27)

1. CHUNG, M. J. AND TIRUVURI, G. 1995. Optimum dynamic programming scheduling under resource constraints. MSUCPS-TR95-44.
2. DALIKILIC, M. E. AND PITCHUMANI, V. 1994. A multi-schedule approach to high-level synthesis. In Proceedings of the IEEE International Conference on Computer Design (Cambridge, MA, Oct. 10-12). 572-575.
3. DAVIDSON, S., LANDSKOV, D., SHRIVER, B. D., MALLET, P. W. 1981. Some experiments in local microcode compaction for horizontal machines. IEEE Trans. Comput. C-30, 1 (July), 460-477.
4. FANN, Y., RIM, M., JAIN, R. 1994. Global scheduling for high-level synthesis applications. In Proceedings of the 31st Annual Conference on Design Automation (DAC'94, San Diego, CA, June 6-10, 1994). ACM Press, New York, NY, 542-546.
5. FERNANDEZ, E. B. AND BUSSELL, B. 1973. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comput. C-22, 8 (Aug.), 745-751.
6. Hu, Y., GHOUSE, A., CARLSON, B. S. 1993. Lower bounds on the iteration time and the number of resources for functional pipelined data flow graphs. In Proceedings of the International Conference on Computer Design. 21-24.
7. HUANG, S. H., JEANG, Y. L., HWANG, C. T., Hsu, Y. C., WANG, J. F. 1993. A tree-based scheduling algorithm for control-dominated circuits. In Proceedings of the 30th Interna-tional Conference on Design Automation (DAC'93, Dallas, TX, June 14-18, 1993). ACM Press, New York, NY, 578-582.
8. JAIN, R., KüCüKCAKAR, K., MLINAR, M. J., PARKER, A. C. 1989. Experience with ADAM synthesis system. In Proceedings of the 26th ACMI IEEE Conference on Design Automation (DAG '89, Las Vegas, NV, June 25-29, 1989). ACM Press, New York, NY, 56-61.
9. JAIN, R., PARKER, A. C., PARK, N. 1992. Predicting system-level area and delay for pipelined and non-pipelined designs. IEEE Trans. Comput.-Aided Des. 12, 8 (Aug.).
10. KlM, T., LlU, J., LlU, C. 1991. A scheduling algorithm for conditional resource sharing. In Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD '91, Santa Clara, CA, Nov. 11-14). IEEE Computer Society Press, Los Alamitos, CA, 84-87.
11. LANGERIN, M. AND CERNY, E. 1993. A recursive technique for computing lower-bound performance of schedules. In Proceedings of the International Conference on Computer Design. 16-20.
12. MALLON, D. J. AND DENVER, P. B. 1990. A new approach to pipeline optimization. In Proceedings of the European Conference on Design Automation.
13. OHM, S. Y., KURDAHI, F. J., DUTT, N. 1994. Comprehensive lower bound estimation from behavioral descriptions. In Proceedings of the 1994 IEEE I ACM International Conference on Computer-Aided Design (ICCAD '94, San Jose, CA, Nov. 6-10, 1994). IEEE Computer Society Press, Los Alamitos, CA, 182-187.
14. OHM, S. Y. 1995. Personal Communication.
15. PANGRLE, B. M. AND GAJSKI, D. D. 1987. Slicer: A state synthesizer for intelligent silicon compiler. In Proceedings of the International Conference on Computer Design. 42-45.
16. PAPACHRISTOU, C. A. AND KONUK, H. 1989. A high level synthesis technique based on linear programming. Tech. Rep. CES-89-21. Case Western Reserve University, Cleveland, OH.
17. PARK, N. AND PARKER, A. C. 1986. MAHA: A program for datapath synthesis. In Proceedings of the Conference on Design Automation. 461-466.
18. PARK, N. AND PARKER, A. C. 1988. SEHWA: A software package for synthesis of pipelines from behavioral specifications. IEEE Trans. Comput.-Aided Des. Integr. Circuits 7, 3 (Mar.), 356-368.
19. PAULIN, P. G. AND KNIGHT, J. P. 1989. Force-directed scheduling for the beavioral synthesis of ASICs. IEEE Trans. CAD 8, 6 (June), 661-679.
20. RABAEY, J. M. AND POTKONJAK, M. 1994. Estimating implementation bounds for real time DSP application specific circuits. IEEE Trans. CAD 13, 6 (June), 669-683.
21. RADIVOJEVIC, I. P. AND BREWER, F. 1996. A new symbolic technique for control-dependent scheduling. IEEE Trans. CAD (Jan.).
22. RIM, M. AND JAIN, R. 1994. Lower-bound performance estimation for the high-level synthesis scheduling problem. IEEE Trans. CAD 13, 4 (Apr.), 451-458.
23. SHARMA, A. 1992. Estimation and design algorithms for the behavioral synthesis of ASICS. Ph.D. Dissertation. University of Wisconsin at Madison, Madison, WI.
24. HARMA, A. AND JAIN, R. 1993. Estimating architectural resources and performance for high-level synthesis applications. IEEE Trans. Very Large Scale Integr. Syst. 1, 2 (June).
25. SEDGEWICK, R. 1990. Algorithms in C. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
26. WAKABAYASHI, K. AND YOSHIMURA, T. 1989. A resource sharing and control synthesis method for conditional branches. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 62-65.
27. WAKABAYASHI, K. AND TANAKA, H. 1992. Global scheduling independent of control dependencies based on condition vectors. In Proceedings of the 29th ACM I IEEE Conference on Design Automation (DAC '92, Anaheim, CA, June 8-12). IEEE Computer Society Press, Los Alamitos, CA, 112-115.