Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads

DOI10.1137/S009753979834610XzbMath0992.68225OpenAlexW1971621805MaRDI QIDQ2719116

Waleed M. Meleis

Publication date: 21 June 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979834610x

zbMATH Keywords

scheduling algorithmsregisterscode generationsparallel functional units

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Theory of compilers and interpreters (68N20) Parallel algorithms in computer science (68W10)

Related Items (1)

Register saturation in instruction level parallelism

This page was built for publication: Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads