A fast approach to computing exact solutions to the Resource-Constrained Scheduling problem

ACM Transactions on Design Automation of Electronic Systems

Volumn 6, Issue 4, 2001, Pages 490-500

  Narasimhan, M ^a   Ramanujam, J ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Design; Design automation; Enumeration; Exact scheduling; Experimentation; High level synthesis; Lower and upper bounds; Optimization; Resource constrained scheduling

Indexed keywords

EID: 23044530732     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/502175.502178     Document Type: Article

References (17)

1. BERKELAAR, M. 1997. lp_solve version 2.1. ftp://ftp.es.ele.tue.nl/pub/lp_solve.
2. CAMPOSANO, R., AND WOLF, W. 1991. High-Level VLSI Synthesis. Kluwer Academic.
3. CHAUDHURI, S., AND WALKER, R. A. 1994. Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem. IEEE Trans. VLSI 2, 4 (Dec.), 456-471.
4. DE MICHELI, G. 1994. Synthesis and Optimization of Digital Circuits. McGraw-Hill, New York.
5. EINDHOVEN DESIGN AUTOMATION GROUP WWW SERVER. 1994. Online Neat Sources: http://www.es.ele.tue.nl/neat (pre-release ed.). Eindhoven University of Technology.
6. GAJSKI, D., DUTT, N., AND PANGRLE, B. 1986. Silicon compilation (tutorial). In Proceedings of the IEEE Custom Integrated Circuits Conference (May). IEEE Computer Society Press, Los Alamitos, Calif., pp. 102-110.
7. GEBOTYS, C. H., AND ELMASRY, M. I. 1993. Global optimization approach for architectural synthesis. IEEE Trans. CAD 12, 9 (Sept.), 1266-1278.
8. HWANG, C. T., LEE, T. H., AND HSU, Y. C. 1991. A formal approach to the scheduling problem in high level synthesis. IEEE Trans. CAD 10, 4, 464-475.
9. LANGEVIN, M., AND CERNY, E. 1996. A recursive technique for computing lower-bound performance of schedules. ACM Trans. Des. Automat. Elect. Syst. 1, 4 (Oct.), 443-456.
10. LIN, Y.-L. 1997. Recent developments in high-level synthesis. ACM Trans. Des. Automat. Elect. Syst. 2, 1 (Jan.), 2-21.
11. MCFARLAND, M., PARKER, A., AND CAMPOSANO, R. 1990. The high-level synthesis of digital systems. Proc. IEEE 78, 2 (Feb.), 301-318.
12. NARASIMHAN, M. 1998. Exact scheduling techniques for high-level synthesis. M.S. thesis, Louisiana State University.
13. NARASIMHAN, M., AND RAMANUJAM, J. 1997. The effect of tight partial schedule bounds and better heuristics on branch-and-bound solutions to scheduling. Tech. Rep. TR 97-07-01 (July 97, revised October 97), Louisiana State University.
14. NEMHAUSER, G. L., AND WOLSEY, L. A. 1988. Integer and Combinatorial Optimization. Wiley-Interscience, New York.
15. PAULIN, P., AND KNIGHT, J. 1989. Force-directed scheduling for the behavioral synthesis of ASIC's. IEEE Trans. CAD 8, 6 (June), 661-679.
16. 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.
17. ULLMAN, J. 1975. NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 3 (June), 384-393.