Using a user-level memory thread for correlation prefetching

Conference Proceedings - Annual International Symposium on Computer Architecture, ISCA

Volumn , Issue , 2002, Pages 171-182

  Solihin, Yan ^a   Lee, Jaejin ^b   Torrellas, Josep ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; CORRELATION METHODS; MICROPROCESSOR CHIPS;

USER-LEVEL MEMORY THREADS (ULMT);

DYNAMIC RANDOM ACCESS STORAGE;

EID: 0036296856     PISSN: 08847495     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISCA.2002.1003576     Document Type: Article

References (29)

1. Distributed predictive cache design for high performance memory systems
2. Dynamic improvements of locality in virtual memory systems
3. Impulse: Building a smarter memory controller
4. Simultaneous subordinate microthreading (SSMT)
5. Reducing memory latency via non-blocking and prefetching cache
6. Multi-chain prefetching: Effective exploitation of inter-chain memory parallelism for pointer-chasing codes
7. Content-based prefetching: Initial results
8. Prefetching using markov predictors
9. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
10. A prefetching technique for irregular accesses to linked data structures
11. Comparing data forwarding and prefetching for communication-induced misses in shared-memory MPs
12. Scalable processors in the billion-transistor era: IRAM
13. A direct-execution framework for fast and accurate simulation of superscalar processors
14. Dead-block prediction and dead-block correlating prefetchers
15. Spaid: Software prefetching in pointer and call intensive environments
16. Compiler-based prefetching for recursive data structures
17. Evaluating stream buffers as a secondary cache replacement
18. Dependence based prefetching for linked data structures
19. Predictor-directed stream buffers
20. Push vs. Pull: Data movement for linked data structures
21. Speeding up irregular applications in shared-memory multiprocessors: Memory binding and group prefetching