Cooper, Keith D.2011-07-252011-07-252010Liu, Donghua. "Parameterization and adaptive search for graph coloring register allocation." (2010) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/62227">https://hdl.handle.net/1911/62227</a>.https://hdl.handle.net/1911/62227Graph coloring register allocators use heuristics for register coalescing and allocation, which are relevant to the number of physical registers that a group of virtual registers will use after allocation. They cannot be determined accurately in allocation, thus we made them tunable by introducing new parameters as the thresholds for coalescing and the thresholds for defining constrained live intervals in simplification. Experiments demonstrated neither the aggressive method nor the conservative method can outperform the other for all tests and the best parameters vary significantly among programs. This parameterization is profitable because the best running time reached by varying the parameters is up to 16% faster than the best of fixed-parameter methods. Hill-climbing and random probe algorithms were used to find good parameters, and the later performed better. Further analysis reveals the search space has many irregular fluctuations that are not suitable for the hill-climber.application/pdfengCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.Computer scienceApplied sciencesThesisTHESIS COMP.SCI. 2010 LIU