Loop-Based Instruction Prefetching to Reduce the Worst-Case Execution Time

DOI10.1109/TC.2010.44MaRDI QIDQ5280759zbMATH OpenFDO

Authors Yiqiang Ding, Wei Zhang

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2010.44

Mathematics Subject Classification ID

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

Recommendations

• Exploiting the prefetching effect provided by executing mispredicted load instructions
• A methodology for speeding up loop kernels by exploiting the software information and the memory architecture
• Execution latency reduction via variable latency pipeline and instruction reuse
• Increasing instruction-level parallelism with instruction precomputation
• A software instruction prefetching method in architectures with static scheduling

Cited in

(1)

• Execution history guided instruction prefetching

This page was built for publication: Loop-Based Instruction Prefetching to Reduce the Worst-Case Execution Time

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