Discussion
Register allocation is commonly modelled as
Answer: D
Correct answer: a graph colouring problem over an interference graph
Each value is a node, and two nodes are joined if their live ranges overlap so that they cannot share a register. Assigning \( k \) registers is then colouring the graph with \( k \) colours. The problem is NP-complete in general, so compilers use Chaitin-style heuristics and spill to memory when the colouring fails.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development