A usually linear algorithm for register assignment using edge placement of load and store instructions

Dhamdhere, 1988, Register assignment using code placement techniques, Comput. Lang., 13, 75, 10.1016/0096-0551(88)90011-2 Morel, 1979, Global optimisation by suppression of partial redundancies, Commun. ACM, 22, 96, 10.1145/359060.359069 Dhamdhere, 1988, An elimination algorithm for bi-directional data flow analysis Beatty, 1974, Register assignment algorithm for generation of highly optimised object code, IBM J. R&D, 5, 20, 10.1147/rd.181.0020 Dhamdhere, 1979, Code replication and placement in compiler code optimisation Chow, 1984, Register allocation by priority based coloring, SIGPLAN Not., 19, 222, 10.1145/502949.502896 Chaitin, 1982, Register allocation and spilling via graph coloring, SIGPLAN Not., 17, 201, 10.1145/872726.806984 Bernstein, 1989, Spill code minimisation techniques for optimising compilers Briggs, 1989, Colouring heuristics for register allocation Dhamdhere, 1980, A composite algorithm for strength reduction and code movement optimisation, Int. J. Comput. Inf. Sci., 9, 243, 10.1007/BF00977786 Kennedy, 1972, Safety of code movement, Int. J. Comput. Math., 3, 112, 10.1080/00207167208803056 Aho, 1986 Ryder, 1986, Elimination algorithms for data flow analysis, ACM Comput. Surv., 18, 277, 10.1145/27632.27649 Graham, 1976, A fast and usually linear algorithm for global flow analysis, J. ACM, 23, 172, 10.1145/321921.321939