On a graph-theoretical model for cyclic register allocation

DOI10.1016/S0166-218X(99)00105-5zbMath0946.68026OpenAlexW2010751129WikidataQ58198076 ScholiaQ58198076MaRDI QIDQ1296576

B. Marmol, Sylvain Lelait, Dominique de Werra, Christine Eisenbeis

Publication date: 16 November 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00105-5

zbMATH Keywords

compilationcyclic schedulingregister allocation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ Coloration de graphes : fondements et applications ⋮ An exact algorithm with learning for the graph coloring problem ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Coloring large graphs based on independent set extraction ⋮ Improving the extraction and expansion method for large graph coloring ⋮ Circular-arc graph coloring: On chords and circuits in the meeting graph ⋮ A memetic algorithm for graph coloring ⋮ AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING ⋮ Register saturation in instruction level parallelism

Cites Work

• Unnamed Item
• Periodic assignment and graph colouring
• On some properties of DNA graphs
• Coloring a Family of Circular Arcs

This page was built for publication: On a graph-theoretical model for cyclic register allocation