Disjoint eager execution: an optimal form of speculative execution

Uht, Augustus K.; Sindagi, V.; Hall, Kelley

doi:10.1109/micro.1995.476841

Cited by 61 publications

(31 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multipath execution techniques. Using control flow paths to create multiple executions has also been used in architectural designs [2,32,33]. In these works, spare hardware contexts are used to execute instructions along the paths corresponding to different predictions of hard-to-predict branches.…”

Section: Performance Comparison With Other Techniquesmentioning

confidence: 99%

Speculative parallelization using state separation and multiple value prediction

Tian

Feng

Gupta

2010

Proceedings of the 2010 International Symposium on Memory Management

View full text Add to dashboard Cite

With the availability of chip multiprocessor (CMP) and simultaneous multithreading (SMT) machines, extracting thread level parallelism from a sequential program has become crucial for improving performance. However, many sequential programs cannot be easily parallelized due to the presence of dependences. To solve this problem, different solutions have been proposed. Some of them make the optimistic assumption that such dependences rarely manifest themselves at runtime. However, when this assumption is violated, the recovery causes very large overhead. Other approaches incur large synchronization or computation overhead when resolving the dependences. Consequently, for a loop with frequently arising cross-iteration dependences, previous techniques are not able to speed up the execution. In this paper we propose a compiler technique which uses state separation and multiple value prediction to speculatively parallelize loops in sequential programs that contain frequently arising cross-iteration dependences. The key idea is to generate multiple versions of a loop iteration based on multiple predictions of values of variables involved in cross-iteration dependences (i.e., live-in variables). These speculative versions and the preceding loop iteration are executed in separate memory states simultaneously. After the execution, if one of these versions is correct (i.e., its predicted values are found to be correct), then we merge its state and the state of the preceding iteration because the dependence between the two iterations is correctly resolved. The memory states of other incorrect versions are completely discarded. Based on this idea, we further propose a runtime adaptive scheme that not only gives a good performance but also achieves better CPU utilization. We conducted experiments on 10 benchmark programs on a real machine. The results show that our technique can achieve 1.7x speedup on average across all used benchmarks.

show abstract

Section: Performance Comparison With Other Techniquesmentioning

confidence: 99%

Speculative parallelization using state separation and multiple value prediction

Tian

Feng

Gupta

2010

Proceedings of the 2010 International Symposium on Memory Management

View full text Add to dashboard Cite

show abstract

“…Mechanisms for multiple-path execution have been proposed [19,4,20]. These implementations can vary widely, but the fundamental approach is the same.…”

Section: Multiple-path Mechanismsmentioning

confidence: 99%

Simultaneous subordinate microthreading (SSMT)

Chappell

Stark

Kim

et al. 1999

SIGARCH Comput. Archit. News

109

145

View full text Add to dashboard Cite

show abstract

“…This research was motivated by the speculative execution technique called Disjoint Eager Execution (DEE) proposed by Uht et al [10]. Instead of speculatively predicting a single-path, DEE in hardware contains an elaborate structure which allows the processor to speculatively execute down multiple paths in a program.…”

Section: Related Workmentioning

confidence: 99%