Increasing instruction-level parallelism with instruction precomputation

DOI10.1007/3-540-45706-2_65MaRDI QIDQ4813081zbMATH OpenFDO

Authors Joshua J. Yi, Resit Sendag, David J. Lilja

Publication date 12 August 2004

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/2400/24000481.htm

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• A software instruction prefetching method in architectures with static scheduling
• An efficient value predictor dynamically using loop and locality properties
• Value prediction as a cost-effective solution to improve embedded processors performance
• Execution history guided instruction prefetching
• The performance potential of value and dependence prediction

Cited in

(1)

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

This page was built for publication: Increasing instruction-level parallelism with instruction precomputation

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