A Comment on Index Register Allocation

A technique is presented to reduce the enumeration
required by a known procedure for optimal 
index register allocation in straight-line programs.
 This technique is based on the construction of 
a link diagram, which shows at any step the future occurrences
of indexes which must be loaded into index 
registers.  This diagram determines in advance the required
register configuration at certain steps of 
the program, so that the program is subdivided into separate
portions to which the allocation procedure 
may be applied independently.

CACM September, 1967

Luccio, F.

CA670909 JB February 27, 1978  3:06 PM

1535	5	1535
1535	5	1535
1535	5	1535
1781	5	1535
2579	5	1535
123	6	1535
196	6	1535
919	6	1535
990	6	1535
1007	6	1535
1046	6	1535
1131	6	1535
1139	6	1535
1140	6	1535
1149	6	1535
1198	6	1535
1215	6	1535
1223	6	1535
1265	6	1535
1303	6	1535
1323	6	1535
1358	6	1535
1366	6	1535
1421	6	1535
1460	6	1535
1462	6	1535
1463	6	1535
1467	6	1535
1468	6	1535
1477	6	1535
1491	6	1535
1496	6	1535
1531	6	1535
1535	6	1535
1535	6	1535
1565	6	1535
1601	6	1535
1602	6	1535
1613	6	1535
1614	6	1535
1626	6	1535
1641	6	1535
1787	6	1535
1788	6	1535
1807	6	1535
205	6	1535
224	6	1535
249	6	1535
288	6	1535
1947	6	1535
316	6	1535
381	6	1535
398	6	1535
11	6	1535
404	6	1535
410	6	1535
463	6	1535
464	6	1535
483	6	1535
3184	6	1535
3188	6	1535
584	6	1535
600	6	1535
680	6	1535
691	6	1535
763	6	1535
799	6	1535