Scheduling with soft constraints

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2009, Pages 47-54

  Cong, Jason ^a   Liu, Bin ^a   Zhang, Zhiru ^b  

^a Engineering IV   (United States)

^b AutoESL Design Technologies Inc   (United States)

Author keywords

Behavioral synthesis; Low power; Scheduling; Soft constraint

Indexed keywords

HIGH LEVEL SYNTHESIS; SCHEDULING;

BEHAVIORAL SYNTHESIS; DESIGN CONSIDERATIONS; INTEGER LINEAR PROGRAMMING FORMULATION; LINEAR PROGRAMMING RELAXATION; LOW POWER; LOW-POWER SYNTHESIS; SOFT CONSTRAINT; TOTAL UNIMODULARITY;

INTEGER PROGRAMMING;

EID: 76349089156     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1687399.1687410     Document Type: Conference Paper

References (30)

1. http://www.autoesl.com.
2. http://projects.coin-or.org/Clp.
3. C. Chen and M. Sarrafzadeh. Power-manageable scheduling technique for control dominated high-level synthesis. In Proc. Design, Automation & Test in Europe, pages 1016-1020, 2002.
4. J. Cong, Y. Fan, and W. Jiang. Platform-based resource binding using a distributed register-file microarchitecture. In Proc. Int. Conf. Computer Aided Design, pages 709-715, 2006.
5. J. Cong, W. Jiang, B. Liu, and Y. Zou. Automatic memory partitioning and scheduling for throughput and power optimization. In Proc. Int. Conf. Computer Aided Design, 2009.
6. J. Cong, B. Liu, and Z. Zhang. Behavior-level observability don't-cares and application to low-power behavioral synthesis. In Proc. Int. Symp. Low Power Electronics and Design, pages 139-144, 2009.
7. J. Cong and S. Xu. Technology mapping for fpgas with embedded memory blocks. In Proc. Int. Symp. FPGA, pages 179-188, 1998.
8. J. Cong and Z. Zhang. An efficient and versatile scheduling algorithm based on sdc formulation. In Proc. Design Automation Conf., pages 433-438, 2006.
9. D. D. Gajski, N. D. Dutt, A. C.-H. Wu, and S. Y.-L. Lin. High-level synthesis: introduction to chip and system design. Kluwer Academic Publishers, 1992.
10. C. H. Gebotys and M. Elmasry. Global optimization approach for architectural synthesis. IEEE Trans. Computer-Aided Design Integr. Circuits Syst., 12(9):1266-1278, Sept. 1993.
11. R. Gupta, E. Mehofer, and Y. Zhang. Profile guided compiler optimization. In Y. N. Srikant and P. Shankar, editors, The Compiler Design Handbook: Optimization and Machine Code Generation, pages 143-174. CRC Press, 2003.
12. M. R. Hestenes. Multiplier and gradient methods. J. Optimization Theory and Applications, 4:303-320, 1969.
13. D. S. Hochbaum and J. G. Shanthikumar. Convex separable optimization is not much harder than linear optimization. J. ACM, 37(4):843-862, 1990.
14. A. J. Hoffman and J. B. Kruskal. Integral boundary points of convex polyhedra. In H. W. Kuhn and A. W. Tucker, editors, Linear Inequalities and Related Systems, pages 22-46. Princeton University Press, 1956.
15. C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu. A formal approach to the scheduling problem in high level synthesis. IEEE Trans. Computer-Aided Design Integr. Circuits Syst., 10(4):464-475, Apr. 1991.
16. W. Jiang, Z. Zhang, M. Potkonjak, and J. Cong. Scheduling with integer delay budgeting for low-power optimization. In Proc. Asia South Pacific Design Automation Conf., pages 22-27, Jan. 2008.
17. A. A. Kountouris and C. Wolinski. Efficient scheduling of conditional behaviors for high-level synthesis. ACM Trans. Des. Autom. Electron. Syst., 7(3):380-412, 2002.
18. D. Landskov, S. Davidson, B. Shriver, and P. W. Mallett. Local microcode compaction techniques. ACM Comput. Surv., 12(3):261-294, 1980.
19. T. Ly, D. Knapp, R. Miller, and D. MacMillen. Scheduling using behavioral templates. In Proc. Design Automation Conf., pages 101-106, 1995.
20. G. D. Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill Higher Education, 1994.
21. A. J. Miller and L. A. Wolsey. Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming, 98(1-3):73-78, 2003.
22. J. Monteiro, S. Devadas, P. Ashar, and A. Mauskar. Scheduling techniques to enable power management. In Proc. Design Automation Conf., pages 349-352, 1996.
23. M. Mouhoub and A. Sukpan. Managing temporal constraints with preferences. Spatial Cognition & Computation, 8(1):131-149, 2008.
24. P. G. Paulin and J. P. Knight. Force-directed scheduling for the behavioral synthesis of asics. IEEE Trans. Computer-Aided Design Integr. Circuits Syst., 8(6):661-679, 1989.
25. M. Raghavachari. A constructive method to recognize the total unimodularity of a matrix. J. Mathematical Methods of Operations Research, 20(1):59-61, Jan. 1976.
26. B. R. Rau. Iterative modulo scheduling: an algorithm for software pipelining loops. In Proc. Int. Symp. Microachitecture, pages 63-74, 1994.
27. G. Sigl, K. Doll, and F. M. Johannes. Analytical placement: A linear or a quadratic objective function? In Proc. Design Automation Conf., pages 427-432, 1991.
28. T. C. Son and E. Pontelli. Planning with preferences using logic programming. Theory Pract. Log. Program., 6(5):559-607, 2006.
29. M. van den Briel, S. Kambhampati, and T. Vossen. Planning with preferences and trajectory constraints through integer programming. In Proc. ICAPS Workshop on Preferences and Soft Constraints in Planning, pages 19-22, 2006.
30. J. Zhu and D. D. Gajski. Soft scheduling in high level synthesis. In Proc. Design Automation Conf., pages 219-224, 1999.