List scheduling in the presence of branches. A theoretical evaluation

DOI10.1016/S0304-3975(97)00207-7zbMATH Open0902.68012WikidataQ130471519 ScholiaQ130471519MaRDI QIDQ1128736FDOQ1128736

Authors: Franco Gasperoni, Uwe Schwiegelshohn 

Publication date: 13 August 1998

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Backtracking-based instruction scheduling to fill branch delay slots
• Title not available (Why is that?)
• 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
• A probabilistic analysis of multiprocessor list scheduling: the erlang case

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)