Abstract / Description of output
This paper presents a study into the theoretical limits of a latency hiding technique called access decoupling. Access decoupling is effective at hiding memory latency for low ILP and conservative dependency analysis [9,12,13]. We assess if this result still applies for maximum ILP and perfect dependency analysis.
We find that access decoupling with a basic decoupled memory model fails to hide latency. However, when the memory system is optimised to capture temporal locality exposed by decoupling, sensitivity to memory latency is almost removed. The optimised memory is also found to be a powerful bandwidth filter.
We find that access decoupling with a basic decoupled memory model fails to hide latency. However, when the memory system is optimised to capture temporal locality exposed by decoupling, sensitivity to memory latency is almost removed. The optimised memory is also found to be a powerful bandwidth filter.
Original language | English |
---|---|
Title of host publication | Euro-Par'97 Parallel Processing |
Subtitle of host publication | Third International Euro-Par Conference Passau, Germany, August 26–29, 1997 Proceedings |
Editors | Christian Lengauer, Martin Griebl, Sergei Gorlatch |
Publisher | Springer |
Pages | 1102-1111 |
Number of pages | 10 |
ISBN (Electronic) | 978-3-540-69549-3 |
ISBN (Print) | 978-3-540-63440-9 |
DOIs | |
Publication status | Published - 1997 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Berlin Heidelberg |
Volume | 1300 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |