ACM Home Page
Please provide us with feedback. Feedback
Prefetch throttling and data pinning for improving performance of shared caches
Full text PdfPdf (563 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2008 ACM/IEEE conference on Supercomputing - Volume 00 table of contents
Austin, Texas
SECTION: Papers table of contents
Article No. 59  
Year of Publication: 2008
ISBN:978-1-4244-2835-9
Authors
Ozcan Ozturk  Bilkent University
Seung Woo Son  Pennsylvania State University
Mahmut Kandemir  Pennsylvania State University
Mustafa Karakoy  Imperial College
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 144,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In this paper, we (i) quantify the impact of compiler-directed I/O prefetching on shared caches at I/O nodes. The experimental data collected shows that while I/O prefetching brings some benefits, its effectiveness reduces significantly as the number of clients (compute nodes) is increased; (ii) identify interclient misses due to harmful I/O prefetches as one of the main sources for this reduction in performance with increased number of clients; and (iii) propose and experimentally evaluate prefetch throttling and data pinning schemes to improve performance of I/O prefetching. Prefetch throttling prevents one or more clients from issuing further prefetches if such prefetches are predicted to be harmful, i.e., replace from the memory cache the useful data accessed by other clients. Data pinning on the other hand makes selected data blocks immune to harmful prefetches by pinning them in the memory cache. We show that these two schemes can be applied in isolation or combined together, and they can be applied at a coarse or fine granularity. Our experiments with these two optimizations using four disk-intensive applications reveal that they can improve performance by 9.7% and 15.1% on average, over standard compiler-directed I/O prefetching and no-prefetch case, respectively, when 8 clients are used.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
 
5
 
6
Z. Chen, Y. Zhou, and K. Li. Eviction-based Cache Placement for Storage Caches. In Proceedings of the USENIX Annual Technical Conference, pages 269--281, 2003.
 
7
F. J. Corbato. A Paging Experiment with the Multics System, 1969.
 
8
 
9
 
10
 
11
 
12
 
13
 
14
 
15
16
 
17
18
19
 
20
21
 
22
 
23
 
24
25
26
27
28
 
29
 
30
31
 
32
 
33
34
 
35
 
36
 
37
 
38

Collaborative Colleagues:
Ozcan Ozturk: colleagues
Seung Woo Son: colleagues
Mahmut Kandemir: colleagues
Mustafa Karakoy: colleagues