Title :
Reduction of false sharing by using process affinity in page-based distributed shared memory multiprocessor systems
Author :
Hung, K.P. ; Yung, N.H.C. ; Cheung, Y.S.
Author_Institution :
Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong
Abstract :
In page-based distributed shared memory systems, a large page size makes efficient use of interconnection network, but increases the chance of false sharing, while a small page size reduces the level of false sharing but results in an inefficient use of the network. This paper proposes a technique that uses process affinity to achieve data pages clustering so as to optimize the temporal data locality on DSM systems, and therefore reduces the chance of false sharing and improves the data locality. To quantify the degree of process affinity for a piece of data, a measure called process affinity index is used that indicates the closeness between this piece of data and the process. Simulation results show that process affinity technique improves the execution performance as page size increases due to the effective reduction of fair sharing. In the best case an order of magnitude performance improvement is achieved
Keywords :
digital simulation; distributed memory systems; paged storage; shared memory systems; data locality; data pages clustering; false sharing; interconnection network; page-based distributed shared memory multiprocessor systems; process affinity; simulation results; temporal data locality; Cache storage; Concurrent computing; Delay; Distributed computing; Laboratories; Memory architecture; Multiprocessing systems; Multiprocessor interconnection networks; Prefetching; Processor scheduling;
Conference_Titel :
Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on
Print_ISBN :
0-7803-3529-5
DOI :
10.1109/ICAPP.1996.562899