Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

IPL
2006

favoriteEmaildiscussreport

104views more IPL 2006»

Optimal register allocation for SSA-form programs in polynomial time

13 years 10 months ago

Optimal register allocation for SSA-form programs in polynomial time

Download www.cs.ucla.edu

This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All rights reserved.

Sebastian Hack, Gerhard Goos

Real-time Traffic

Constructive Proof | IPL 2006 | Register Allocation Problem | Uniform Register |

claim paper

Related Content

» Optimal polynomialtime interprocedural register allocation for highlevel synthesis and ASI...

» Linear scan register allocation on SSA form

» Register Allocation After Classical SSA Elimination is NPComplete

» Eliminating Exception Constraints of Java Programs for IA64

» A global progressive register allocator

» Combining Offline and Online Optimizations Register Allocation and Method Inlining

» A Progressive Register Allocator for Irregular Architectures

» A generalized algorithm for graphcoloring register allocation

» Register Allocation and Binding for Low Power

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Sebastian Hack, Gerhard Goos

Comments (0)