CSTallocator: call-site tracing based shared memory allocator for false sharing reduction in page-based DSM systems

Authors:
Jongwoo Lee;Sung-Dong Kim;Jae Won Lee;Jangmin O
Affiliations:
Dept. of Multimedia Science, Sookmyung Women's University, Seoul, Korea;Dept. of Computer Engineering, Hansung University, Seoul, Korea;School of Computer Science and Engineering, Sungshin Women's University, Seoul, Korea;NHN corp., Gyunggi-do, Korea
Venue:
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Year:
2006

Citing 5
Cited 1

SPLASH: Stanford parallel applications for shared-memory

ACM SIGARCH Computer Architecture News
Distributed operating systems

Distributed operating systems
The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
MINT: A Front End for Efficient Simulation of Shared-Memory Multiprocessors

MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Mint Tutorial and User Manual

Mint Tutorial and User Manual

SCSTallocator: sized and call-site tracing-based shared memory allocator for false sharing reduction in page-based DSM systems

IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning

Quantified Score

Hi-index	0.00

Visualization

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.