The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p>
Speculative thread-level parallelism, value prediction, branch prediction, thread spawning policies, clustered architectures.

J. Tubella, A. Gonz?lez and P. Marcuello, "Thread Partitioning and Value Prediction for Exploiting Speculative Thread-Level Parallelism," in IEEE Transactions on Computers, vol. 53, no. , pp. 114-125, 2004.
94 ms
(Ver 3.3 (11022016))