Elimination of parallel copies using code motion on data dependence graphs

DOI10.1016/J.CL.2012.09.001zbMATH Open1390.68172OpenAlexW1973849610MaRDI QIDQ1649320FDOQ1649320

Authors: Florian Brandner, Quentin Colombet 

Publication date: 5 July 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2012.09.001

Recommendations

• scientific article; zbMATH DE number 1956452
• Precise interprocedural dependence analysis of parallel programs
• Publication:4886067
• Foundations of Software Science and Computation Structures
• Register Allocation in Structured Programs

zbMATH Keywords

register allocationcopy eliminationdata dependence graphparallel copy motionregister coalescing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cites Work

• Precoloring extension. I: Interval graphs
• Optimal register allocation for SSA-form programs in polynomial time

Cited In (3)

• Code motion in the presence of critical edges without bidirectional data flow analysis
• Title not available (Why is that?)
• Sparse code motion

This page was built for publication: Elimination of parallel copies using code motion on data dependence graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649320)