Linear Scan Register Allocation MASSIMILIANO POLETTO Laboratory for Computer Science MIT and VIVEK SARKAR IBM Thomas J
Watson Research Center We describe a new algorithm for fast global register allocation called linear scan This algorithm is not based on graph coloring but allocates registers to variables in a single lineartime scan of the variables live ranges Th
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Linear Scan Register Allocation MASSIMIL..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.