Manipulating MAXLIVE for spill-free register allocation

Shashi Deepa Arcot, Henry Gordon Dietz, Sarojini Priyadarshini Rajachidambaram

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper explores new compilation methods, including Genetic Algorithms (GAs) and a new adaptation of Sethi-Ullman numbering, to aggressively restructure basic block code and allocate registers so that the number of registers used does not exceed the number available. Although the approach applies to a wide range of target architectures, it is investigated primarily for nanocontrollers, which have a combination of properties that make avoiding spills particularly difficult, but mandatory.

Original languageEnglish
Title of host publicationLanguages and Compilers for Parallel Computing - 18th International Workshop, LCPC 2005, Revised Selected Papers
Number of pages15
StatePublished - 2006
Event18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005 - Hawthorne, NY, United States
Duration: Oct 20 2005Oct 22 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4339 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference18th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2005
Country/TerritoryUnited States
CityHawthorne, NY

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Manipulating MAXLIVE for spill-free register allocation'. Together they form a unique fingerprint.

Cite this