Výsledky vyhledávání

On the Complexity of Register Coalescing

Autor: Fabrice Rastello, Alain Darte, Florent Bouchez

Publikováno v: CGO
[Research Report] LIP RR-2006-15, Laboratoire de l'informatique du parallélisme. 2006, 2+19p

Due to the increasing latencies of memory accesses and recent developmentson the SSA form, it has become important to revisit the spilling (load/storeinsertion) and register coalescing (removal of move instructions) problems inorder to develop more a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1efaf21092551770d3eaa963eeb9cddf
https://doi.org/10.1109/cgo.2007.26

Zobrazit plný text záznamu

Autor: Bouchez, Florent, Darte, Alain, Rastello, Fabrice

Publikováno v: [Research Report] LIP RR-2006-13, Laboratoire de l'informatique du parallélisme. 2006, 2+12p

Register allocation is one of the most studied problem in compilation. It is consideredas an NP-complete problem since Chaitin, in 1981, showed that assigning temporary variablesto k machine registers amounts to color, with k colors, the interference

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::723e4ceb023c60e702a31ad774115d76
https://hal-lara.archives-ouvertes.fr/hal-02102286/document

Zobrazit plný text záznamu

Autor: Bouchez, Florent, Darte, Alain, Guillon, Christophe, Rastello, Fabrice

Publikováno v: [Research Report] Laboratoire de l'informatique du parallélisme. 2005, 2+28p

This report deals with the problem of choosing which variables to spill during the register allocation phase. Spilling is used when the number of variables is higher than the number of registers, and consists of storing the value of a variable in mem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::55dc8195a1583409d4f67e0320406a4a
https://hal-lara.archives-ouvertes.fr/hal-02102197/document

Zobrazit plný text záznamu

Optimizing the translation out-of-SSA with renaming constraints

Autor: Rastello, Fabrice, Ferrière, F, Guillon, C.

Publikováno v: [Research Report] LIP RR-2003-35, LIP-Laboratoire de l’Informatique du Parallélisme. 2003, 2+23p
[Research Report] LIP RR-2005-34, Laboratoire de l'informatique du parallélisme. 2005, 2+26p

Static Single Assignment form is an intermediate representation that uses phi instructions to merge values at each confluent point of the control flow graph. phi instructions are not machine instructions and must be renamed back to move instructions

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::26cce31dcbd5ed65566ca0af460c8e6f
https://hal.science/hal-02127436/file/RR2003-35.pdf

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání