Register allocation by systematic merge of register-reuse chains

If register allocation is performed after instruction scheduling, the efficiency of register allocation can be degraded due to constraints caused by such scheduling. The authors propose a new register allocation technique that is performed before instruction scheduling and, consequently, allows great freedom in the optimisation of register allocation. Experiments show that the efficiency of the proposed technique is on average 7.4%, greater than that of the conventional approach