Discussion
An interference graph requires 5 colours but the machine has only 4 registers. What must the allocator do?
Answer: A
Spilling removes a node from the graph, which may make the rest colourable. The spilled value is stored and reloaded around its uses, which costs memory traffic but always succeeds. Spilling therefore guarantees that allocation eventually terminates.
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