Speeding up irregular applications in shared-memory multiprocessors: Memory binding and group prefetching (1995) [29 citations — 4 self]
Download:
|
|
by Zheng Zhang, Josep Torrellas
In Proceedings of the 22nd Annual International Symposium on Computer Architecture
http://polaris.cs.uiuc.edu/reports/1466.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zhang95speedingup,author = {Zheng Zhang and Josep Torrellas},
title = {Speeding up irregular applications in shared-memory multiprocessors: Memory binding and group prefetching},
booktitle = {In Proceedings of the 22nd Annual International Symposium on Computer Architecture},
year = {1995},
pages = {188--200}
}
Years of Citing Articles
Abstract:
While many parallel applications exhibit good spatial locality, other important codes in areas like graph problem-solving or CAD do not. Often, these irregular codes contain small records accessed via pointers. Consequently, while the former applications benefit from long cache lines, the latter prefer short lines. One good solution is to combine short lines with prefetching. In this way, each application can exploit the amount of spatial locality that it has. However, prefetching, if provided, should also work for the irregular codes. This paper presents a new prefetching scheme that, while usable by regular applications, is specifically targeted to irregular ones:
