List scheduling in the presence of branches. A theoretical evaluation

DOI10.1016/S0304-3975(97)00207-7MaRDI QIDQ1128736zbMATH OpenWikidataFDO

Authors Franco Gasperoni, Uwe Schwiegelshohn

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

performance guaranteeparallelizing compilersinstruction scheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 30757
• Scheduling Sequential Loops on Parallel Processors
• List scheduling of parallel tasks
• Analysis of the list scheduling algorithm for precedence constrained parallel tasks
• List scheduling with and without communication delays

Cited in

(6)

• A probabilistic analysis of multiprocessor list scheduling: the erlang case
• Backtracking-based instruction scheduling to fill branch delay slots
• scientific article; zbMATH DE number 1693495 (Why is no real title available?)
• List scheduling revisited
• A list-scheduling heuristic for the short-term planning of assessment centers
• The Performance Impact of Exploiting Branch ILP with Tree Representation of ILP Code

This page was built for publication: List scheduling in the presence of branches. A theoretical evaluation

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