Lightweight memory tracing for hot data identification
- Authors
- Lee, Yunjae; Kim, Yoonhee; Yeom, Heon Y.
- Issue Date
- Sep-2020
- Publisher
- SPRINGER
- Keywords
- Memory tracing; Hot data identification; Performance; Optimization; Memory management
- Citation
- CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, v.23, no.3, pp 2273 - 2285
- Pages
- 13
- Journal Title
- CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
- Volume
- 23
- Number
- 3
- Start Page
- 2273
- End Page
- 2285
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/1248
- DOI
- 10.1007/s10586-020-03130-1
- ISSN
- 1386-7857
1573-7543
- Abstract
- The low capacity of main memory has become a critical issue in the performance of systems. Several memory schemes, utilizing multiple classes of memory devices, are used to mitigate the problem; hiding the small capacity by placing data in proper memory devices based on the hotness of the data. Memory tracers can provide such hotness information, but existing tracing tools incur extremely high overhead and the overhead increases as the problem size of a workload grows. In this paper, we propose Daptrace built for tracing memory access with bounded and light overhead. The two main techniques, region-based sampling and adaptive region construction, are utilized to maintain a low overhead regardless of the program size. For evaluation, we trace a wide range of 20 workloads and compared with baseline. The results show that Daptrace has a very small amount of runtime overhead and storage space overhead (1.95% and 5.38 MB on average) while maintaining the tracing quality regardless of the working set size of a workload. Also, a case study on out-of-core memory management exhibits a high potential of Daptrace for optimal data management. From the evaluation results, we can conclude that Daptrace shows great performance on identifying hot memory objects.
- Files in This Item
-
Go to Link
- Appears in
Collections - 공과대학 > 소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.