Patent
1997-04-01
2000-01-18
Hafiz, Tariq R.
G06F 945
Patent
active
060163984
ABSTRACT:
The invention is a method of using static single assignment intermediate language to color out artificial register dependencies while compiling at least a portion of a computer program. The method comprises creating a rank-n SSA intermediate language representation of the computer program, wherein n is a positive integer greater than 1; and coloring out the artificial register dependencies.
REFERENCES:
patent: 4782444 (1988-11-01), Munshi et al.
patent: 5175856 (1992-12-01), Van Dyke et al.
patent: 5249295 (1993-09-01), Briggs
patent: 5659754 (1997-08-01), Grove et al.
patent: 5701489 (1997-12-01), Bates et al.
patent: 5768595 (1998-06-01), Gillies
patent: 5768596 (1998-06-01), Chow et al.
patent: 5793374 (1998-08-01), Guenter et al.
Briggs, Preston, "Coloring Register Pairs", ACM Lett. Program Lang. Syst. p. 3-13, Mar. 1992.
Briggs, Preston, "Improvements to Graph Coloring Register Allocation", ACM Trans. Program. Lang. Syst. p. 428-455, May 1994.
McConnell, Carl, "Using Single Assignment Form in a Cide Optimizer", ACM Lett. Program. Lang. Syst. p. 152-160.
Cytron et al., "Efficient Accommodation of May-Allias Information in SSA Form, " (1993 ACM), pp. 36-45.
Chavis John Q.
Hafiz Tariq R.
Intel Corporation
LandOfFree
Method for using static single assignment to color out artificia does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for using static single assignment to color out artificia, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for using static single assignment to color out artificia will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-568926