S. M. Kurlander and C. N. Fischer. Zero-cost range splitting. In Proc. ACM SIGPLAN '94 Conf. on Prog. Language Design and Implementation, pages 257--265. ACM, June 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fusion-Based Register Allocation - Lueh, Gross, Adl-Tabatabai (1997) (1 citation) (Correct)
....Coagulation code generation [32] integrates code generation and register allocation based on the ordering of prioritized control flow edges. The most important (frequently executed) regions have the maximum freedom in using registers, like in the Multiflow compiler. Kurlander and Fischer [24] perform live range splitting register allocation to free up registers that can be used to improve code scheduling. Empty delay slots in the final schedule are filled with shuffle code to split and spill live ranges. Spilling frees up registers, and these additional registers are used to remove ....
S. M. Kurlander and C. N. Fischer. Zero-cost range splitting. In Proc. ACM SIGPLAN '94 Conf. on Prog. Language Design and Implementation, pages 257--265. ACM, June 1994.
Issues in Register Allocation by Graph Coloring - Lueh (1996) (Correct)
....Coagulation code generation [11] integrates code generation and register allocation based on the ordering of prioritized control flow edges. The most important (frequently executed) regions have the maximum freedom in using registers, like in the Mulitflow compiler [9] ffl Kurlander and Fischer [10] perform live range splitting after register allocation to free up registers that can be used to improve code scheduling. Empty delay slots in the final schedule are filled with shuffle code to split and spill live ranges. Spilling frees up registers and these additional registers are used to ....
S. M. Kurlander and C. N. Fischer. Zero-cost range splitting. In Proc. ACM SIGPLAN '94 Conf. on Prog. Language Design and Implementation, pages 257--265. ACM, June 1994.
Global Register Allocation Based on Graph Fusion - Lueh, Gross, Adl-Tabatabai (1996) (7 citations) (Correct)
....assigned to a register, shuffle code is placed in the pre header and post exit of a loop to load the value of the variable into the register and restore it back to memory (if the value is updated) It is not obvious in the paper how outer loops deal with those shuffle code. Kurlander and Fischer [14] perform live range splitting after register allocation to free up registers that can be used to improve code scheduling. Empty delay slots in the final schedule are filled with shuffle code to split and spill live ranges. Spilling frees up registers and these additional registers are used to ....
S. M. Kurlander and C. N. Fischer. Zero-cost range splitting. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 257--265. ACM, June 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC