Comparing tail duplication with compensation code in single path global instruction scheduling

DOI10.1007/3-540-45306-7_14MaRDI QIDQ2764075zbMATH OpenFDO

Authors David Gregg

Publication date 22 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2027/20270200

Mathematics Subject Classification ID

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

Recommendations

• Adoptability and effectiveness of microcode compaction algorithms in superscalar processing
• List scheduling in the presence of branches. A theoretical evaluation
• CLP approach to optimal instruction scheduling for VLIW processors
• Data-dependency graph transformations for instruction scheduling
• Tree traversal scheduling: A global instruction scheduling technique for VLIW/EPIC processors

Cited in

(2)

• Adoptability and effectiveness of microcode compaction algorithms in superscalar processing
• TST - an algorithm for global microcode compaction with timing constraints

This page was built for publication: Comparing tail duplication with compensation code in single path global instruction scheduling

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