CSTallocator: Call-site tracing based shared memory allocator for false sharing reduction in page-based DSM systems
- Authors
- Lee, Jongwoo; Kim, Sung-Dong; Lee, Jae Won; O, Jangmin
- Issue Date
- Sep-2006
- Publisher
- SPRINGER-VERLAG BERLIN
- Keywords
- false sharing; distributed shared memory; dynamic memory allocation; call site tracing
- Citation
- HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, v.4208, pp 148 - 159
- Pages
- 12
- Journal Title
- HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS
- Volume
- 4208
- Start Page
- 148
- End Page
- 159
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/15441
- DOI
- 10.1007/11847366_16
- ISSN
- 0302-9743
1611-3349
- Abstract
- False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose call-site tracing-based shared memory allocator, shortly CSTallocator. CSTallocator expects that the data objects requested from the different call-sites may have different access patterns in the future. So CSTallocator places each data object requested from the different call-sites into the separate shared pages, and consequently data objects that have the same call-site are likely to get together into the same shared pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our CSTallocator. Our observations show that our CSTallocator outperforms the existing dynamic shared memory allocator.
- Files in This Item
-
Go to Link
- Appears in
Collections - ICT융합공학부 > IT공학전공 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.