Frank Mueller
- Ban93.U. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer Academic Publishers, Norwell, MA (1993). Google Scholar
Digital Library
- BeD88.M.E. Benitez and J. W. Davidson, "A Portable Global Optimizer and Linker," Proceedings of the SIGPLAN '88 Symposium on Programming Language Design and Implementation, pp. 329-338 (June 1988). Google ScholarDigital Library
- DaH88.J. Davidson and A. Holler, "A Study of a C Function Inliner," Software--Practice & Experience 18(8)pp. 775-790 (August 1988). Google ScholarDigital Library
- DaH92.J.W. Davidson and A. M. Holler, "Subprogram Inlining: A Study of its Effects on Program Execution Time," IEEE Transactions on Software Engineering 18(2) pp. 89-102 (February 1992). Google ScholarDigital Library
- DaW91.J.W. Davidson and D. B. Whalley, "A Design Environment for Addressing Architecture and Compiler Interactions," Microprocessors and Microsystems 15(9)pp. 459-472 (November 1991).Google ScholarCross Ref
- GoR90.M.C. Golumbic and V. Rainish, "Instruction Scheduling beyond Basic Blocks" IBM Journal of Research and Development 34(1) pp. 93-97 (January 1990). Google ScholarDigital Library
- GrK92.T. Granlund and R. Kenner, "Eliminating Branches using a Superoptimizer and the GNU C Compiler," Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 341-352 (June 1992). Google ScholarDigital Library
- HeP90.J. Hennessy and D. Patterson, Computer Architecture' A Quantitative Approach, Morgan Kaufmann, San Mateo, CA (1990). Google ScholarDigital Library
- Jai91.S. Jain, "Circular Scheduling: A New Technique to Perform Software Pipelining," Proceedings of the SIGPLAN '91 Symposium on Programming Language Design and implementation, pp. 219-228 (June 1991). Google ScholarDigital Library
- Kra94.A. Krall, "Improving Semi-static Branch Prediction by Code Replication," Proceedings of the SIGPLAN '94 Symposium on Programming Language Design and Implementation, pp. 97-106 (June 1994). Google ScholarDigital Library
- LRS76.P.M. Lewis, D. J. Rosenkrantz, and R. E. Stearns, Compiler Design Theory, Addison- Wesley, Reading, MA (1976). Google ScholarDigital Library
- MoR79.E. Morel and C. Renvoise, "Global Optimizations by Suppression of Partial Redundancies," Communications of the ACM 22(2) pp. 96-103 (February 1979). Google ScholarDigital Library
- MuW92.F. Mueller and D. B. Whalley, "Avoiding Unconditional Jumps by Code Replication," Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 322-330 (June 1992). Google ScholarDigital Library
- Smi82.A.J. Smith, "Cache Memories," Computing Surveys 14(3) pp. 473-530 (September 1982). Google ScholarDigital Library
- YoS94.C. Young and M. D. Smith, "Improving the Accuracy of Static Branch Prediction Using Branch Correlation," Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 232-241 (November 1994). Google ScholarDigital Library
Index Terms
- Avoiding conditional branches by code replication
Recommendations
Avoiding unconditional jumps by code replication
This study evaluates a global optimization technique that avoids unconditional jumps by replicating code. When implemented in the back-end of an optimizing compiler, this technique can be generalized to work on almost all instances of unconditional ...
Branch replication scheme: A new model for data replication in large scale data grids
Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. ...
Comments