Bloom filtering cache misses for accurate data speculation and prefetching

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2002, Pages 189-198

  Peir, Jih Kwon ^a   Lai, Shih Chang ^a   Lu, Shih Lien ^a   Stark, Jared ^a   Lai, Konrad ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Bloom Filter; Data Cache; Data Prefetching; Data Speculation; Instruction Scheduling

Indexed keywords

COMPUTER ARCHITECTURE; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

DATA CACHE;

CACHE MEMORY;

EID: 0036375949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/514216.514219     Document Type: Conference Paper

References (15)

1. Space/time tradeoffs in hash coding with allowable errors
2. Predictive sequential associative cache
3. Memory dependence prediction using store sets
4. Pentium 4 (partially) previewed
5. The microarchitecture of the pentium 4 processor
6. Inexpensive implementations of set-associativity
7. The alpha 21264 microprocessor
8. Cache design with partial address matching
9. Recovery mechanism for latency misprediction
10. Jetty: Filtering snoops for reduced energy consumption in SMP servers
11. Tuning the pentium pro microarchitecture
12. The MIPS R10000 superscalar microprocessor
13. Speculation techniques for improving load related instruction scheduling