DMCA
False Sharing and its Effect on Shared Memory Performance (1993)
| Venue: | IN PROCEEDINGS OF THE USENIX SYMPOSIUM ON EXPERIENCES WITH DISTRIBUTED AND MULTIPROCESSOR SYSTEMS (SEDMS IV |
| Citations: | 68 - 4 self |
BibTeX
@INPROCEEDINGS{Bolosky93falsesharing,
author = {William J. Bolosky and Michael L. Scott},
title = {False Sharing and its Effect on Shared Memory Performance },
booktitle = {IN PROCEEDINGS OF THE USENIX SYMPOSIUM ON EXPERIENCES WITH DISTRIBUTED AND MULTIPROCESSOR SYSTEMS (SEDMS IV},
year = {1993},
pages = {57--71},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
False sharing occurs when processors in a shared-memory parallel system make references to different data objects within the same coherence block (cache line or page), thereby inducing "unnecessary" coherence operations. False sharing is widely believed to be a serious problem for parallel program performance, but a precise definition and quantification of the problem has proven to be elusive. We explain why. In the process, we present a variety of possible definitions for false sharing, and discuss the merits and drawbacks of each. Our discussion is based on experience gained during a fouryear study of multiprocessor memory architecture and its effect on the behavior of applications in a sixteen-program suite. Using
Keyphrases
false sharing shared memory performance shared-memory parallel system multiprocessor memory architecture sixteen-program suite parallel program performance possible definition different data object serious problem coherence block precise definition cache line unnecessary coherence operation fouryear study
