List scheduling in the presence of branches. A theoretical evaluation

DOI10.1016/S0304-3975(97)00207-7zbMath0902.68012WikidataQ130471519 ScholiaQ130471519MaRDI QIDQ1128736

Franco Gasperoni, Uwe Schwiegelshohn

Publication date: 13 August 1998

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

zbMATH Keywords

parallelizing compilersperformance guaranteeinstruction scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item

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