On minimizing register usage of linearly scheduled algorithms with uniform dependencies

DOI10.1016/J.CL.2009.12.001zbMath1387.68046OpenAlexW2039885649MaRDI QIDQ1749253

Weijia Shang, Cesar J. Philippidis

Publication date: 16 May 2018

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

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

zbMATH Keywords

loop unrollingregister allocationlinear schedulinglive variable analysisregister spillingwavefront scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aliased register allocation for straight-line programs is NP-complete
• On Periodic Register Need in Software Pipelining
• Time optimal linear schedules for algorithms with uniform dependencies

This page was built for publication: On minimizing register usage of linearly scheduled algorithms with uniform dependencies