.png){kind=icon}
返回
Thread partitioning and value prediction for exploiting speculative thread-level parallelism
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2004.1261823.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Speculative thread-level parallelism has been recently proposed as a source of parallelism to improve the performance in applications where parallel threads are hard to find. However, the efficiency of this execution model strongly depends on the performance of the control and data speculation techniques. In this work, several hardware-based schemes for partitioning the program into speculative threads are analyzed and evaluated. In general, we find that spawning threads associated to loop iterations is the most effective technique. We also show that value prediction is critical for the performance of all of the spawning policies. Thus, a new value predictor, the increment predictor, is proposed. This predictor is specially oriented for this kind of architecture and clearly outperforms the adapted versions of conventional value predictors such as the last value, the stride, and the context-based, especially for small-sized history tables.
Keyword:
speculative thread-level parallelism
value prediction
branch prediction
thread spawning policies
clustered architectures
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
Antigen Identification for Orphan T Cell Receptors Expressed on Tumor-Infiltrating Lymphocytes肿瘤浸润淋巴细胞上表达的孤儿T细胞受体的抗原鉴定.png)
Cell
OAAI
CellIF0
OAAI分享收藏Effects of preganglionic sympathectomy on peptides in the rat superior cervical ganglionNeuroReport
NeuroReportIF0
PREAI
分享收藏分享收藏
查看更多内容