Disjoint Eager Execution: what it is / what it is not

Authors:
Augustus K. Uht
Affiliations:
University of Rhode Island, Kingston, RI
Venue:
ACM SIGARCH Computer Architecture News
Year:
2002

Citing 9
Cited 0

The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Limits of control flow on parallelism

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Extraction of massive instruction level parallelism

ACM SIGARCH Computer Architecture News
A theory of reduced and minimal procedural dependencies

Instruction-level parallel processors
Disjoint eager execution: an optimal form of speculative execution

Proceedings of the 28th annual international symposium on Microarchitecture
Branch Effect Reduction Techniques

Computer
Supporting Highly-Speculative Execution via Adaptive Branch Trees

HPCA '98 Proceedings of the 4th International Symposium on High-Performance Computer Architecture
Representation and detection of concurrency using ordering-matrices.

Representation and detection of concurrency using ordering-matrices.
Hardware extraction of low-level concurrency from sequential instruction streams (parallelism, implementation, architecture, dependencies, semantics)

Hardware extraction of low-level concurrency from sequential instruction streams (parallelism, implementation, architecture, dependencies, semantics)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Disjoint Eager Execution (DEE) has been cited and described many times since its introduction in 1992, often incorrectly. This paper clarifies what DEE is and how it operates, as well as pointing out common DEE misconceptions.