Abstract
We investigate the behavior of data prefetching on an access decoupled machine and a superscalar machine. We assess if there are benefits to using the decoupling paradigm given that an out-of-order (o-o-o) superscalar architecture could in principle prefetch to the same degree as an access decoupled machine. We have found that for large issue width the access decoupled machine can hide memory latency more effectively than a single instruction window o-o-o superscalar architecture. Our findings also demonstrate that an access decoupled machine offers the benefit of reducing the complexity of window issue logic.
Original language | English |
---|---|
Title of host publication | Microarchitecture, 1997. Proceedings., Thirtieth Annual IEEE/ACM International Symposium on |
Pages | 65-70 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 1 Dec 1997 |
Keywords / Materials (for Non-textual outputs)
- cache storage
- instruction sets
- parallel architectures
- parallel machines
- performance evaluation
- access decoupled machine
- data prefetching
- decoupling paradigm
- large issue width
- memory latency
- out-of-order superscalar architecture
- superscalar machine
- window issue logic
- Arithmetic
- Clocks
- Computer architecture
- Computer science
- Costs
- Delay
- Logic design
- Microprocessors
- Parallel processing
- Prefetching