The high cost of main memory access makes the register allocation problem especially important in microprogramming. This paper presents a technique for reducing microprogram run time by inserting main memory loads and stores based on an analysis of the dynamic behavior of the program. The authors present, but do not derive, a formula for time saved by doing a specific sequence of loads and stores, given a set of variables used by the program and a control flow graph of the program. They state that the time saved can be maximized by integer linear programming techniques, using implicit enumeration.

One would have to do considerably more search before deciding to use the techniques outlined in this short paper. First, data on the dynamic performance of a microprogram are often not available. Second, no mention is made of the complexity of the solution to the integer programming problem, very important because of the large control flow graphs produced by a compiler. Therefore, I doubt the practicality of the technique as stated. However, the paper is a contribution to the theory of storage allocation required for microprogramming language compilers.