Sciweavers

102 search results - page 2 / 21
» Read-After-Read Memory Dependence Prediction
Sort
View
IEEEPACT
2002
IEEE
13 years 10 months ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
IPPS
2008
IEEE
13 years 11 months ago
Intermediate checkpointing with conflicting access prediction in transactional memory systems
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
M. M. Waliullah, Per Stenström
TOCS
1998
83views more  TOCS 1998»
13 years 4 months ago
Using Value Prediction to Increase the Power of Speculative Execution Hardware
This paper presents an experimental and analytical study of value prediction and its impact on speculative execution in superscalar microprocessors. Value prediction is a new para...
Freddy Gabbay, Avi Mendelson
ICML
2010
IEEE
13 years 6 months ago
Forgetting Counts: Constant Memory Inference for a Dependent Hierarchical Pitman-Yor Process
We propose a novel dependent hierarchical Pitman-Yor process model for discrete data. An incremental Monte Carlo inference procedure for this model is developed. We show that infe...
Nicholas Bartlett, David Pfau, Frank Wood
ISCA
1998
IEEE
107views Hardware» more  ISCA 1998»
13 years 9 months ago
Memory Dependence Prediction Using Store Sets
For maximum performance, an out-of-order processor must issue load instructions as early as possible, while avoiding memory-order violations with prior store instructions that wri...
George Z. Chrysos, Joel S. Emer