Show simple item record

dc.contributor.advisor Cooper, Keith D.
dc.creatorLiu, Donghua
dc.date.accessioned 2011-07-25T02:07:44Z
dc.date.available 2011-07-25T02:07:44Z
dc.date.issued 2010
dc.identifier.urihttp://hdl.handle.net/1911/62227
dc.description.abstract Graph 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.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectComputer science
Applied sciences
dc.title Parameterization and adaptive search for graph coloring register allocation
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.citation Liu, Donghua. "Parameterization and adaptive search for graph coloring register allocation." (2010) Master’s Thesis, Rice University. http://hdl.handle.net/1911/62227.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record