SALSA: A New Approach to Scheduling with Timing Constraints

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 12, Issue 8, 1993, Pages 1107-1122

  Nestor, John A ^a   Krishnamoorthy, Ganesh ^b  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^b MENTOR GRAPHICS CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000577173     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.238604     Document Type: Article

References (38)

1. M. McFarland, A. Parker, and R. Camposano, “The high-level synthesis of digital systems,” Proc. IEEE, vol. 78, Feb. 1990.
2. J. Nestor and D. Thomas, “Behavioral synthesis with interfaces,” in Proc. ICCAD-86, pp. 112–115, Nov. 1986.
3. R. Camposano and A. Kunzmann, “Considering timing constraints in synthesis from a behavioral description,” in Proc. ICCD, pp. 6–9, Oct. 1986.
4. G. Borriello and R. Katz “Synthesis and Optimization of Interface Transducer logic,” in Proc. ICCAD-87, pp. 274–277, Nov. 1987.
5. P. Paulin and J. Knight, “Force-directed scheduling for behavioral synthesis of ASIC’s,” IEEE Trans. Computer-Aided Design, Vol. 8, pp. 661–678, June 1989.
6. C. Hitchcock and D. Thomas, “A method of automatic data path synthesis,” in Proc. 20th DAC, pp. 484–489, June 1983.
7. C. Tseng and D. Siewiorek, “Automated synthesis of data paths in digital systems,” IEEE Trans. Computer-Aided Design, vol. CAD-5, 379–395, July 1986.
8. D. Thomas, E. Lagnese, R. Walker, J. Nestor, J. Rajan, and R. Blackburn, Algorithmic and Register-Transfer Level Synthesis: The System Architect’s Workbench. New York: Kluwer Academic, 1990.
9. E. Girczyc and J. Knight, “An ADA to standard cell hardware compiler based on graph grammars and scheduling,” in Proc. ICCD, pp. 726–731, Oct. 1984.
10. M. McFarland and T. Kowalski, “Incorporating bottom-up design into high-level synthesis,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 938–950, Sept. 1990.
11. B. Pangrle and D. Gajski, “Slicer: A state synthesizer for intelligent silicon compilation,” in Proc. ICCD-87, Oct. 1987.
12. G. Goossens, J. Vandewalle, and H. De Man, “Loop optimization in register-transfer scheduling for DSP-systems,” in Proc. 26th DAC, pp. 826–831, June 1989.
13. S. Kirkpatrick, C. Gelatt, and M. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, May 1983.
14. S. Devadas and A. R. Newton, “Algorithms for hardware allocation in data path synthesis,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 768–781, July 1989.
15. M. Quayle and L. Grover, “Pipelined and non-pipelined data path synthesis using simulated annealing,” Progress in Computer Aided VLSI Design, vol. 4, Feb. 1990.
16. T. Ly and J. Mowchenko, “Applying Simulated Evolution to Scheduling in high-level synthesis,” in Proc. IEEE 33rd Midwest Symp. on Circuits and Systems, 1990.
17. J. Lee, “A new Integer linear programming formulation for the scheduling problem in data path synthesis,” in Proc. ICCAD, pp. 20–23, Nov. 1989.
18. C. Gebotys and M. Elmasry, “A global, optimization approach for architectural synthesis,” in Proc. 28th DAC, pp. 2–7, June 1991.
19. S. Hayati and A. Parker, “Automatic production of controller specification from control and timing behavioral descriptions,” in Proc. 26th DAC, pp. 75–80, June 1989.
20. R. Camposano, “Path-based scheduling,” IEEE Trans. Computer-Aided Design, vol. 10, Jan. 1991.
21. Y. Liao and C. Wong, “An algorithm to compact a VLSI symbolic layout with mixed constraints,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 62–69, Apr. 1983.
22. G. Borriello, “A new interface specification methodology and its application to transducer synthesis,” Ph.D. dissertation, Univ. of California at Berkeley, May 1988.
23. D. Ku and G. De Micheli, “Relative scheduling under timing constraints,” in Proc. 27th DAC, pp. 59–64, June 1990.
24. C. Papadimitrou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
25. M. Lorenzetti and D. Baeder, “Routing,” in Physical Design Automation of VLSI Systems, B. Preas and M. Lorenzetti, ed. Menlo Park, CA: Benjamin-Cummings, 1988.
26. C. Tseng, R. Wei, S. Rothweiler, M. Tong, and A. Bose, “Bridge: A versatile behavioral synthesis system,” in Proc. 25th DAC, pp. 415–420, June 1988.
27. K. Wakabayashi and T. Yoshimura, “A resource sharing and control synthesis method for conditional branches,” in Proc. ICCAD-89, pp. 62–65, Nov. 1989.
28. J. Bums and A. R. Newton, “SPARCS: A new constraint-based IC symbolic layout spacer,” in Proc. CICC, pp. 534–539, May 1986.
29. A. R. Newton, “Symbolic Layout and Procedural Design,” in Design Systems for VLSI Circuits. Dordrecht, The Netherlands: Martinus Nijhoff, 1987, pp. 65–112.
30. A. Parker, J. Pizarro, and M. Mlinar, “MAHA: A program for datapath synthesis,” in Proc. 22nd DAC, pp. 461–466, July 1986.
31. R. Rutenbar, “Simulated annealing algorithms—An overview,” IEEE Circuits Devices Mag., vol. 6, no. 1, Jan. 1989.
32. M. Huang, R. Romeo, and A. Sangiovanni-Vincentelli, “An efficient general cooling schedule for simulated annealing,” in Proc. ICCAD-86, pp. 381–384, Nov. 1986.
33. G. Borriello and E. Detjens, “High-level synthesis: Current status and future directions,” Proc. 25th DAC, pp. 477–482, June 1988.
34. P. Paulin and J. Knight, “Scheduling and binding algorithms for high-level synthesis,” in Proc. 26th DAC, pp. 1–6, June 1989.
35. C. Hwang, J. Lee, and Y. Hsu, “A formal approach to the scheduling problem in high-level synthesis,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 464–475, Apr. 1991.
36. J. Rabaey, C. Chu, P. Hoang, and M. Potkonjak, “Fast prototyping of datapath-intensive architectures,” IEEE Design Test, June 1991.
37. R. Woudsma, et al., “One-dimensional linear picture transformer,” U.S. Patent 4 881 192.
38. W. Verhaegh, E. Aarts, J. Korst, and P. Lippens, “Improved force-directed scheduling,” in Proc. EDAC 91, pp. 430–435, Feb. 1991.