Optimal and Heuristic Algorithms for Solving the Binding Problem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 2, Issue 2, 1994, Pages 211-225

  Rim, Minjoong ^a   Mujumdar, Ashutosh ^a   Jain, Rajiv ^a   DeLeone, Renato ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; CONFORMAL MAPPING; CONSTRAINT THEORY; ELECTRIC NETWORK SYNTHESIS; HEURISTIC METHODS; LINEAR PROGRAMMING; LOGIC DESIGN; OPTIMIZATION; SCHEDULING; STORAGE ALLOCATION (COMPUTER);

BINDING PROBLEM; DATA FLOW GRAPH; HEURISTIC ALGORITHM; NETWORK FLOW MODEL; OPTIMAL ALGORITHM;

ALGORITHMS;

EID: 0028452826     PISSN: 10638210     EISSN: 15579999     Source Type: Journal    
DOI: 10.1109/92.285747     Document Type: Article

References (60)

1. XPRESS-MP Reference Manual. Dash Associates, 1989.
2. M. Balakrishnan, A. K. Majumdar, D. K. Banerji, J. G. Linders, and J. C. Majithia, “Allocation of multiport memories in data path synthesis,” IEEE Trans. Computer-Aided-Design, vol. 7, Apr. 1988.
3. D. Bertsekas, Linear Network Optimization. Cambridge, MA: MIT Press, 1991.
4. F. Brewer and D. Gajski, “Chippe: A system for constraint driven behavioral synthesis,” IEEE Trans. Computer-Aided-Design, vol. 9, July 1990.
5. R. Cloutier and D. Thomas, “The combination of scheduling, allocation and mapping in a single algorithm,” in Proc. 27th Design Automation Conf., ACM/IEEE, June 1990.
6. H. DeMan, J. Rabaey, P. Six, and L. Classen, “CATHEDRAL II: A silicon compiler for digital signal processing,” IEEE Design and Test, vol. 3, Dec. 1986.
7. S. Devadas and A. R. Newton, “Algorithms for hardware allocation in data path synthesis,” IEEE Trans. Computer-Aided-Design, vol. 8, July 1989.
8. W. E. Donath, “Placement and average interconnection lengths of compute logic,” IEEE Trans. Circuits and Systems, vol. 26, Apr. 1979.
9. D. D. Gajski, N. Dutt, A. Wu, and S. Lin, High-Level Synthesis. Boston, MA: Kluwer Academic, 1992.
10. C. H. Gebotys and M. I. Elmasry, “A global optimization approach for architectural synthesis,” in Proc. Int. Conf. Computer-Aided-Design, IEEE, Nov. 1990.
11. C. H. Gebotys and M. I. Elmasry, “Optimal synthesis of high-performance architectures,” IEEE J. Solid-Sate Circ., vol. 27, Mar. 1992.
12. G. Goossens, J. Rabaey, J. Vandewalle, and H. De Man, “An efficient microcode compiler for application specific DSP processors,” IEEE Trans. Computer-Aided-Design, vol. 9, Sept. 1990.
13. L. Hafer, “Constraint improvements for MILP-based hardware synthesis,” in Proc. 28th Design Automation Conf, ACM/IEEE, June 1991.
14. L. Hafer and A. Parker, “A formal method for the specification, analysis, and design of register-transfer level digital logic,” IEEE Trans. Computer-Aided-Design, vol. 2, Jan. 1983.
15. B. S. Haroun and M. I. Elmasry, “Architectural synthesis for DSP silicon compilers,” IEEE Trans. Computer-Aided-Design, vol. 8, Apr. 1989.
16. D. V. Heinbuch, Ed., CMOS3 Cell Library. Reading, MA: Addison-Wesley, 1988.
17. W. R. Heller, C. G. Hsi, and W. F. Mikhail, “Wireability—Designing wiring space for chips and chip packages,” IEEE Design and Test, vol. 1, Aug. 1984.
18. C.-T. Hwang, Y.-C. Hsu, and Y.-L. Lin, “Optimum and heuristic data path scheduling under resource constraints,” in Proc. 27th Design Automation Conf., ACM/IEEE, 1990.
19. 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, vol. 10, Apr. 1991.
20. R. Jain, K. Kucukcakar, M. J. Mlinar, and A. C. Parker, “Experience with the ADAM synthesis system,” in Proc. 26th Design Automation Conf., ACM/IEEE, June 1989.
21. R. Jain, A. Mujumdar, A. Sharma, and H. Wang, “Experimental evaluation of some high-level synthesis scheduling heuristics,” in Proc. 28th Design Automation Conf., ACM/IEEE, June 1991.
22. T. Kim, J. W. S. Liu, and C. L. Liu, “A scheduling algorithm for conditional resource sharing,” in Proc. Int. Conf. Computer-Aided-Design, IEEE, Nov. 1991.
23. C. R. Kime, personal communication, 1992.
24. D. W. Knapp, “Feedback-drived datapath optimization in Fasolt,” in Proc. Int. Conf. Computer-Aided-Design, IEEE, Nov. 1990.
25. G. Krishnamoorthy and J. Nestor, “Data path allocation using an extended binding model,” in Proc. 29th Design Automation Conf, ACM/IEEE, June 1992.
26. K. Kucukcakar and A. C. Parker, “Data path tradeoffs using MABAL,” in Proc. 27th Design Automation Conf, ACM/IEEE, June 1990.
27. F. J. Kurdahi and A. C. Parker, “REAL: A program for REgister ALlocation,” in Proc. 24th Design Automation Conf, ACM/IEEE, June 1987.
28. F. J. Kurdahi and A. C. Parker, “Techniques for area estimation of VLSI layouts,” IEEE Trans. Computer-Aided-Design, vol. 8, Jan. 1989.
29. D. P. La Potin and S. W. Director, “Mason: A global floorplanning approach for VLSI design,” IEEE Trans. Computer-Aided-Design, vol. 5, Oct. 1986.
30. T. A. Ly, W. L. Elwood, and E. F. Girczyc, “A generalized interconnect model for data path synthesis,” in Proc. 27th Design Automation Conf, ACM/IEEE, June 1990.
31. T. A. Ly and J. T. Mowchenko, “Applying simulated evolution to high level synthesis,” IEEE Trans. Computer-Aided-Design, vol. 12, March 1993.
32. M. C. McFarland, “Allocating registers, processors, and connections,” Tech. Rep., Dept. Electrical Eng., Carnegie-Mellon Univ., Aug. 1981.
33. M. C. McFarland, “A fast floor planning algorithm for architectural evaluation,” in Proc. Int. Conf. Computer Design, IEEE, Oct. 1989.
34. M. C. McFarland and T. J. Kowalski, “Incorporating bottom-up design into hardware synthesis,” IEEE Trans. Computer-Aided-Design, vol. 9, Sept. 1990.
35. M. C. McFarland, A. C. Parker, and R. Camposano, “The high-level synthesis of digital systems,” Proc. IEEE, vol. 78, Feb. 1990.
36. A. Mujumdar, “A binding methodology for high-level synthesis,” Ph.D. Proposal, Dept. Electrical and Computer Eng., Univ. Wisconsin. Aug. 1992.
37. A. Mujumdar, K. K. Saluja, and R. Jain, “Incorporating testability considerations in high-level synthesis,” in Proc. 22nd Int. Symp. Fault-Tolerant Computing, IEEE, July 1992.
38. B. M. Pangrle, F. D. Brewer, D. A. Lobo, and A. Seawright, “Rele-vant issues in high-level connectivity synthesis,” in Proc. 28th Design Automation Conf, ACM/IEEE, June 1991.
39. B. M. Pangrle and D. D. Gajski, “Design tools for intelligent silicon compilation,” IEEE Trans. Computer-Aided-Design, vol. 6, Nov. 1987.
40. C. A. Papachristou and H. Konuk, “A high-level synthesis technique based on linear programming,” Tech. Rep., Computer Eng. and Science Dept., Case Western Reserve Univ., Nov. 1989.
41. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. New Jersey: Prentice-Hall, 1982.
42. N. Park, “Synthesis of high speed digital systems,” Ph.D. thesis, Univ. Southern Calif., Aug. 1985.
43. N. Park and F. J. Kurdahi, “Module assignment and interconnect sharing in register-transfer synthesis of pipelined designs,” in Proc. Int. Conf. on Computer-Aided-Design, IEEE, Nov. 1989.
44. A. C. Parker, J. Pizarro, and M. J. Mlinar, “MAHA: A program for datapath synthesis,” in Proc. 23rd Design Automation Conf, ACM/IEEE, June 1986.
45. P. G. Paulin and J. P. Knight, “Force-directed scheduling for the behavioral synthesis of ASIC’s,” IEEE Trans. Computer-Aided-Design, vol. 8, June 1989.
46. M. Rim and R. Jain, “Estimating lower-bound performance of schedules using a relaxation technique,” in Proc. Int. Conf. Computer Design, IEEE, Oct. 1992.
47. M. Rim and R. Jain, “Representing conditional branches for high-level synthesis applications,” in Proc. 29th Design Automation Conf, ACM/IEEE, June 1992.
48. M. Rim and R. Jain, “RECALS II: A new list scheduling algorithm,” in Proc., Int. Conf. Acoustic, Speech and Signal Processing, IEEE, 1994.
49. H. Shin and N. S. Woo, “A cost function based optimization technique for scheduling and data path synthesis,” in Proc. Int. Conf. Computer Design, IEEE, Oct. 1989.
50. T. Shiple, P. Kollaritsch, D. Smith, and J. Allen, “Area evaluation metrics for transistor placement,” in Proc. Int. Conf. Computer Design, IEEE, Oct. 1988.
51. E. Snow, “Automation of module set independent register transfer level design,” PhD. thesis, Dept. Electrical Eng., Carnegie-Mellon Univ., April 1978.
52. D. E. Thomas, E. M. Dirkes, R. A. Walker, J. V. Rajan, J. A. Nestor, and R. L. Blackburn, “The system architect’s workbench,” in Proc. 25th Design Automation Conf, ACM/IEEE, June 1988.
53. F.-S. Tsai and Y.-C. Hsu, “STAR: An automatic data path allocator,” IEEE Trans. Computer-Aided-Design, vol. 11, Sept. 1992.
54. C. J. Tseng and D. P. Siewiorek, “Automated synthesis of data paths in digital systems,” IEEE Trans. Computer-Aided-Design, vol. 5, July 1986.
55. K. Wakabayashi and H. Tanaka, “Global scheduling independent of control dependencies based on condition vectors,” in Proc. 29th Design Automation Conf, ACM/IEEE, June 1992.
56. R. A. Walker, “Design representation and behavioral transformation for algorithmic level integrated circuit design,” PhD. thesis, Dept. Electrical Eng, Carnegie-Mellon Univ., Apr. 1988.
57. J. P. Weng and A. C. Parker, “3D Scheduling: high-level synthesis with floorplanning,” in Proc. 28th Design Automation Conf, ACM/IEEE, June 1991.
58. N. S. Woo, “A global, dynamic register allocation and binding,” in Proc. 27th Design Automation Conf, ACM/IEEE, June 1990.
59. A. Wu, V. Chaiyakul, and D. Gajski, “Layout-area models for high-level synthesis,” in Proc. Int. Conf. Computer-Aided-Design, IEEE, Nov. 1991.
60. G. Zimmermann, “A new area and shape function estimation technique for VLSI layouts,” in Proc. 25th Design Automation Conf, ACM/IEEE, 1988.