Effective Partial Redundancy Elimination (798424), страница 5

Просмтор этого файла доступен только зарегистрированным пользователям. Но у нас супер быстрая регистрация: достаточно только электронной почты!

Текст из файла (страница 5)

Auslander and Martin E. Hopkins.Anoverview of the PL.8 compiler. SIGPLAN Notices,17(6):22–31, June 1982. Proceedings of the ACM SIGPLAN ’82 Symposium on Compiler Construction.[4] Robert L. Bernstein. Multiplication by integer constants. Software – Practice and Experience, 16(7):641–652, July 1986.[5] Steve Carr and Ken Kennedy. Blocking linear algebracodes for memory hierarchies.

In Jack Dongarra, PaulMessina, Danny C. Sorensen, and Robert G. Voight,editors, Proceedings of the Fourth SIAM Conferenceon Parallel Processing for Scientific Computing, pages400–405, 1990.[6] Gregory J. Chaitin, Marc A. Auslander, Ashok K.Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring.Computer Languages, 6:47–57, January 1981.[7] Jong-Deok Choi, Ron Cytron, and Jeanne Ferrante.Automatic construction of sparse data flow evaluationgraphs. In Conference Record of the Eighteenth AnnualACM Symposium on Principles of Programming Languages, pages 55–66, Orlando, Florida, January 1991.[8] Fred C. Chow.

A Portable Machine-Independent GlobalOptimizer – Design and Measurements. PhD thesis,Stanford University, December 1983.[21] Etienne Morel and Claude Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96–103, February 1979.[9] John Cocke and Peter W. Markstein. Measurement ofprogram improvement algorithms.

In Proceedings ofInformation Processing 80. North Holland PublishingCompany, 1980.[22] Kevin O’Brien, Bill Hay, Joanne Minish, HartmannSchaffer, Bob Schloss, Arvin Shepherd, and MatthewZaleski. Advanced compiler technology for the RISCSystem/6000 architecture. In IBM RISC System/6000Technology. IBM Corporation, Armonk, New York,1990.[10] John Cocke and Jacob T. Schwartz. Programming languages and their compilers: Preliminary notes. Technical report, Courant Institute of Mathematical Sciences,New York University, 1970.[11] Ron Cytron, Jeanne Ferrante, Barry K.

Rosen, Mark N.Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on ProgrammingLanguages and Systems, 13(4):451–490, October 1991.[12] Dhananjay M. Dhamdhere. Practical adaptation ofthe global optimization algorithm of Morel and Renvoise. ACM Transactions on Programming Languagesand Systems, 13(2):291–294, April 1991.[13] Dhananjay M. Dhamdhere and Uday P. Khedker. Complexity of bidirectional data flow analysis. In Conference Record of the Twentieth Annual ACM SIGPLANSIGACT Symposium on Principles of ProgrammingLanguages, pages 397–408, Charleston, South Carolina,January 1993.[14] Karl-Heinz Drechsler and Manfred P. Stadel. A solutionto a problem with Morel and Renvoise’s “Global optimization by suppression of partial redundancies”. ACMTransactions on Programming Languages and Systems,10(4):635–640, October 1988.[15] Lawrence Feigen, David Klappholz, Robert Casazza,and Xing Xue.

The revival transformation. In Conference Record of POPL ’94: 21st ACM SIGPLANSIGACT Symposium on Principles of ProgrammingLanguages, pages 421–434, Portland, Oregon, January1994.[16] George E. Forsythe, Michael A. Malcolm, and Cleve B.Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Englewood Cliffs, New Jersey,1977.[17] Dennis J. Frailey. Expression optimization using unarycomplement operators.

SIGPLAN Notices, 5(7):67–85,July 1970. Proceedings of a Symposium on CompilerOptimization.[18] Jens Knoop, Oliver Rüthing, and Bernhard Steffen.Lazy code motion. SIGPLAN Notices, 27(7):224–234,July 1992. Proceedings of the ACM SIGPLAN ’92 Conference on Programming Language Design and Implementation.[19] Jens Knoop, Oliver Rüthing, and Bernhard Steffen.Partial dead code elimination. SIGPLAN Notices,29(6), June 1994.

Proceedings of the ACM SIGPLAN’94 Conference on Programming Language Design andImplementation.[20] Peter W. Markstein, Victoria Markstein, and F. Kenneth Zadeck. Reassociation and strength reduction. InOptimization in Compilers. ACM Press, to appear.[23] Barry K. Rosen, Mark N. Wegman, and F. KennethZadeck. Global value numbers and redundant computations. In Conference Record of the Fifteenth AnnualACM Symposium on Principles of Programming Languages, pages 12–27, San Diego, California, January1988.[24] Vatsa Santhanam. Register reassociation in PA-RISCcompilers.

Hewlett-Packard Journal, pages 33–38, June1992.[25] Randolph G. Scarborough and Harwood G. Kolsky.Improved optimization of FORTRAN object programs.IBM Journal of Research and Development, pages 660–676, November 1980.[26] Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches.

ACMTransactions on Programming Languages and Systems,13(2):181–210, April 1991.[27] Michael E. Wolf and Monica S. Lam. A data locality optimizing algorithm. SIGPLAN Notices, 26(6):30–44, June 1991. Proceedings of the ACM SIGPLAN ’91Conference on Programming Language Design and Implementation..

Характеристики

Список файлов статьи