On a graph-theoretical model for cyclic register allocation

DOI10.1016/S0166-218X(99)00105-5MaRDI QIDQ1296576zbMATH OpenOpenAlexWikidataFDO

Authors B. Marmol, Dominique De Werra, Christine Eisenbeis, Sylvain Lelait

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

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

Recommendations

• Circular-arc graph coloring: On chords and circuits in the meeting graph
• scientific article; zbMATH DE number 1956454
• Programming Languages and Systems
• Periodic assignment and graph colouring

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Coloring a Family of Circular Arcs
• On some properties of DNA graphs
• Periodic assignment and graph colouring

Cited in

(14)

• Grouping products for the optimization of production processes: a case in the steel manufacturing industry
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
• Circular-arc graph coloring: On chords and circuits in the meeting graph
• An extraction and expansion approach for graph coloring
• scientific article; zbMATH DE number 1956454 (Why is no real title available?)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
• Coloring large graphs based on independent set extraction
• SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
• Register saturation in instruction level parallelism
• Using graph coloring in an algebraic compiler
• A memetic algorithm for graph coloring
• Improving the extraction and expansion method for large graph coloring
• An exact algorithm with learning for the graph coloring problem
• Coloration de graphes : fondements et applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296576)