Optimal register sharing for high-level synthesis of SSA form programs

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

Volumn 25, Issue 5, 2006, Pages 772-779

  Brisk, Philip ^b,c   Dabiri, Foad ^a,b,c   Jafari, Roozbeh ^a,b,c  

^a IEEE   (United States)

^b Engineering IV   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compilers (silicon); High level synthesis

Indexed keywords

COMPILERS (SILICON); GRAPH-COLORING PROBLEM; HIGH-LEVEL SYNTHESIS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; LINEAR PROGRAMMING; POLYNOMIALS; RESOURCE ALLOCATION;

PROGRAM COMPILERS;

EID: 33646422802     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2006.870409     Document Type: Conference Paper

References (26)

1. M. Poletto and V. Sarkar, "Linear scan register allocation," ACM Trans. Program. Lang. Syst., vol. 21, no. 5, pp. 895-913, Sep. 1999.
2. A. Hashimoto and J. Stevens, "Wire routing by optimizing channel assignment within large apertures." in Proc. 8th Workshop Design Automation, Atlantic City, NJ, Jun. 1971, pp. 155-169.
3. F. J. Kurdahi and A. C. Parker, "REAL: A program for register allocation," in Proc. 24th Design Automation Conf., Miami Beach, FL, 1987, pp. 210-215.
4. F. Gavril, "Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph," SIAM J. Comput., vol. 1, no. 2, pp. 180-187, Jun. 1972.
5. D. L. Springer and D. E. Thomas, "Exploiting the special structure of conflict and compatibility graphs in high-level synthesis," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 13, no. 7, pp. 843-856, Jul. 1994.
6. L. Stok, "Transfer-free register allocation in cyclic data flow graphs," in Proc. Eur. Conf. Design Automation, Brussels, Belgium, Mar. 1992, pp. 181-186.
7. A. Kaplan, P. Brisk, and R. Kastner, "Data communication estimation and reduction for reconfigurable systems," in Proc. 40th Design Automation Conf., Anaheim, CA, Jun. 2003, pp. 616-621.
8. Z. Budimlić, K. D. Cooper, T. J. Harvey, K. Kennedy, T. S. Oberg, and S. W. Reeves, "Fast copy coalescing and live-range identification, " in Proc. ACM SIGPLAN Conf. Programming Language Design Implementation, Munich, Germany, Jun. 2002, pp. 25-32.
9. K. D. Cooper and L. Torczon, Engineering a Compiler. San Francisco, CA: Morgan Kaufmann, 2004.
10. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, vol. 57. Amsterdam, The Netherlands: North Holland, 2004.
11. R. E. Tarjan and M. Yannakakis, "Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs," SIAM J. Comput., vol. 13, no. 3, pp. 566-579, Aug. 1984.
12. P. Brisk, F. Dabiri, J. Macbeth, and M. Sarrafzadeh, "Polynomial time graph coloring register allocation," in Proc. IWLS, Lake Arrowhead, CA, Jun. 2005, pp. 447-454.
13. S. Hack, "Interference graphs of programs in SSA-form," Universität Karlsruhe, Karlsruhe, Germany, Jun. 2005. (ISSN 1432-7864).
14. F. Bouchez, A. Darte, C. Guillon, and F. Rastello, "Register allocation and spill complexity under SSA," ÉNS Lyon, Lyon, France, Tech. Rep. 2005-33, Aug. 2005.
15. M. D. Smith and G. Holloway, An Introduction to Machine SUIF and Its Portable Libraries for Optimization. [Online]. Available: http://www.eecs. harvard.edu/hube/software/nci/overview.html
16. J.-D. Choi, R. Cytron, and J. Ferrante, "Automatic construction of sparse data flow evaluation graphs," in Proc. 18th Annu. ACM Symp. Principles Programming Languages, Orlando, FL, Jan. 1991, pp. 55-66.
17. Standard Performance Evaluation Consortium. [Online]. Available: http://www.spec.org/cpu2000/
18. C. Lee, M. Potkonjak, and W. H. Mangione-Smith, "Mediabench: A tool for evaluating and synthesizing multimedia and communications systems," in Proc. 30th Int. Symp. Microarchitecture, Research Triangle Park, NC, Dec. 1997, pp. 330-335.
19. G. J. Chaitin, "Register allocation and spilling via graph coloring," in Proc. ACM SIGPLAN Symp. Compiler Construction, Boston, MA, Jun. 1982, pp. 98-105.
20. G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein, "Register allocation via coloring," Comput. Lang., vol. 6, no. 1, pp. 47-57, 1981.
21. F. M. Q. Pereira and J. Palsberg, "Register allocation via coloring of chordal graphs," in Proc. 3rd Asian Symp. Programming Languages Systems, Tsukuba, Japan, Nov. 3-5, 2005, pp. 315-329.
22. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, "Efficiently computing static single assignment form and the control dependence graph," ACM Trans. Program. Lang. Syst., vol. 13, no. 4, pp. 451-190, Oct. 1991.
23. P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson, "Practical improvements to the construction and destruction of static single assignment form," Softw. - Pract. Exp., vol. 28, no. 8, pp. 859-881, Jul. 1998.
24. F. Rastello, F. de Ferriere, and C. Guillon, "Optimizing translation out of SSA using renaming constraints," in Proc. Int. Symp. Code Generation Optimization, Palo Alto, CA, Mar. 21-24, 2004, pp. 265-276.
25. M. Yannakakis and F. Gavril, "The maximum k-colorable subgraph problem for chordal graphs," Inf. Process. Lett., vol. 24, no. 2, pp. 133-137, Jan. 1987.
26. M. Farach and V. Liberatore, "On local register allocation," in Proc. 9th Annu. ACM SIAM Symp. Discrete Algorithms. San Francisco, CA, Jan. 25-27, 1998, pp. 564-573.