2014 | OriginalPaper | Buchkapitel
Register Allocation Based on Boolean Satisfiability
verfasst von : Yang Mengmeng, Liu Jie
Erschienen in: Intelligent Data analysis and its Applications, Volume II
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Graph Coloring is an effective method which is used to solve the register allocation problem, it is also an NP-complete problem, heuristic algorithms and various evolutionary algorithms have been proposed in order to improve the performance of register allocation, in this paper, we propose to solve this problem by converting the graph coloring problem into Boolean Satisfiability problem (SAT), the experiments show that our algorithm can use fewer number of registers, which can improve the execution efficiency of the generated codes.