Limited multiple-writer: An approach to dealing with false sharing in software DSMs
I tiakina i:
| I whakaputaina i: | Journal of Computer Science and Technology vol. 15, no. 5 (Sep 2000), p. 453 |
|---|---|
| Kaituhi matua: | |
| Ētahi atu kaituhi: | |
| I whakaputaina: |
Springer Nature B.V.
|
| Ngā marau: | |
| Urunga tuihono: | Citation/Abstract Full Text - PDF |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
| Whakarāpopotonga: | False sharing is one of the most important factors impacting the performance of DSM (distributed shared memory) systems. The single-writer approach is simple, but it cannot avoid the ping-pong effect of the data page thrashing, while the multiple-writer approach is effective for false sharing but with high cost. This paper proposes a new approach, called limited multiple-writer (LMW) to handling multiple writers in software DSM. It distinguishes two kinds of multiple-writer as lock-based form and barrier-based form, and handles them with different policies. It discards theTwin andDiff in traditional multiple-writer approach, and simplifies the implementation of multiple-writer in software DSM systems. The implementation of LMW in a CVM (Coherent Virtual Machine) software DSM system, which is based on a network of workstations, is introduced. Evaluation results show that for some applications such as SOR (Successive Over-Relaxation), LU (Lower triangular and Upper triangular), FFT (Fast Fourier Transformation), and IS (Integer Sorting), LMW provides a significant reduction in execution time (11%, 16%, 33% and 46%) compared with the traditional multiple-writer approach on the platform. |
|---|---|
| ISSN: | 1000-9000 1860-4749 |
| DOI: | 10.1007/BF02950409 |
| Puna: | ABI/INFORM Global |