On a graph-theoretical model for cyclic register allocation
DOI10.1016/S0166-218X(99)00105-5zbMATH Open0946.68026OpenAlexW2010751129WikidataQ58198076 ScholiaQ58198076MaRDI QIDQ1296576FDOQ1296576
Sylvain Lelait, Dominique De Werra, Christine Eisenbeis, B. Marmol
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
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20)
Cites Work
Cited In (14)
- Title not available (Why is that?)
- SIRALINA: Efficient two-steps heuristic for storage optimisation in single period task scheduling
- Circular-arc graph coloring: On chords and circuits in the meeting graph
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Using graph coloring in an algebraic compiler
- A memetic algorithm for graph coloring
- An exact algorithm with learning for the graph coloring problem
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Coloring large graphs based on independent set extraction
- Register saturation in instruction level parallelism
- Coloration de graphes : fondements et applications
Recommendations
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)
