Aliased register allocation for straight-line programs is NP-complete

• Published in: Theoretical computer science Vol. 407; no. 1; pp. 258 - 273
• Main Authors: Lee, Jonathan K., Palsberg, Jens, Pereira, Fernando Magno Quintão
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 06.11.2008; Elsevier
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Combinatorics; Combinatorics. Ordered structures; Computer science; control theory; systems; Exact sciences and technology; Graph coloring; Graph theory; Information retrieval. Graph; Mathematics; Miscellaneous; Network flow; Register allocation; Sciences and techniques of general use; Theoretical computing; Weighted interval graphs; Graph coloring; Weighted interval graphs; Network flow; Register allocation; Interval graph; Processor; Architecture; Computer theory; Heuristics; Definition; Linear time; Algorithm; Weighted graph; Complexity; Register; Aliasing; Network; Proof; Graph colouring; Floating point

Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of registers is homogeneous. In this paper we study registers which may alias: an aliased register can be used both independently...