Combining two loops that have the same iteration space and do not depend on each other's computations into a single loop is called:
Loop Jamming (Loop Fusion) merges adjacent loops iterating over identical bounds, improving instruction-level parallelism and cache locality.
Which graph algorithm technique is used to solve the Register Allocation problem by modeling register conflicts between variable live ranges?
Register allocation maps overlapping variable live ranges (interference graph) to K available CPU registers using Graph Coloring.
In a register allocation interference graph, what do the nodes and edges represent?
Interference graph nodes are candidate variables; an edge connects two nodes if both variables are live simultaneously at some point.
When a compiler runs out of physical hardware registers during register allocation, variables are saved to stack memory. This process is called:
Spilling moves register values into stack memory when the interference graph cannot be colored with available K physical registers.
What is a 'Live Variable' at a given program point?
A variable is live at statement p if its current value will be referenced along some future execution path starting from p.