Article

Latencies of conflicting writes on contemporary multicore architectures

Authors:

Josef Weidendorfer,

Michael Ott,

Tobias Klug, and

Carsten TrinitisAuthors Info & Claims

PaCT'07: Proceedings of the 9th international conference on Parallel Computing Technologies

September 2007

Pages 318 - 327

Published: 03 September 2007 Publication History

Publisher Site

Abstract

This paper provides a detailed investigation of latency penalties caused by repeated memory writes to nearby memory cells from different threads in parallel programs. When such writes map to the same corresponding cache lines in multiple processors, one can observe the so called false sharing effect. This effect can unnecessarily hamper parallel code due to the line granularity based cache hierarchy, which is common on contemporary processor architectures. In this contribution, a benchmark allowing for quantitative estimates about the consequences of the false sharing effect, is presented. Results show that multicore architectures with shared cache can reduce unwanted effects of false sharing.

References

[1]

Intel Corporation: Intel 64 and IA-32 Architectures: Software Developer's Manual, Denver, CO, USA (2006)

Google Scholar

[2]

Torrellas, J., Lam, H.S., Hennessy, J.L.: False sharing and spatial locality in multiprocessor caches. IEEE Trans. Comput. 43(6), 651-663 (1994)

Digital Library

Google Scholar

[3]

Papamarcos, M.S., Patel, J.H.: A low-overhead coherence solution for multiprocessors with private cache memories. In: ISCA '98: 25 years of the international symposia on Computer architecture (selected papers), pp. 284-290. ACM Press, New York (1998)

Digital Library

Google Scholar

[4]

Archibald, J., Baer, J.-L.: Cache coherence protocols: evaluation using a multiprocessor simulation model. ACM Trans. Comput. Syst. 4(4), 273-298 (1986)

Digital Library

Google Scholar

[5]

Bolosky, W.J., Scott, M.L.: False sharing and its effect on shared memory performance. In: Proc. of the USENIX Symposium on Experiences with Distributed and Multiprocessor Systems (SEDMS IV), San Diego, CA, pp. 57-71 (1993)

Digital Library

Google Scholar

[6]

Desikan, R., Burger, D., Keckler, S.W.: Sharing speculation: A mechanism for lowlatency access to falsely shared data. Technical Report CS-TR-03-05, The University of Texas at Austin, Department of Computer Sciences, Friday, 11 August, 106 16:16:41 GMT (2003)

Google Scholar

[7]

Liu, K.C., King, C.T.: On the effectiveness of sectored caches in reducing false sharing misses. In: International Conference on Parallel and Distributed Systems (ICPADS '97), December 11-13, 1997, Seoul, Korea, Proceedings, pp. 352-359 (1997)

Digital Library

Google Scholar

[8]

Kadiyala, M., Bhuyan, L.N.: A dynamic cache sub-block design to reduce false sharing. In: ICCD '95: Proceedings of the 1995 International Conference on Computer Design, Washington, DC, USA, p. 313. IEEE Computer Society Press, Los Alamitos (1995)

Digital Library

Google Scholar

[9]

Sweazey, P., Smith, A.J.: A class of compatible cache consistency protocols and their support by the ieee futurebus. In: ISCA '86: Proceedings of the 13th annual international symposium on Computer architecture, pp. 414-423. IEEE Computer Society Press, Los Alamitos (1986)

Digital Library

Google Scholar

Cited By

View all

Jayasena SAmarasinghe SAbeyweera AAmarasinghe GDe Silva HRathnayake SMeng XLiu YGropp WMatsuoka S(2013)Detection of false sharing using machine learningProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.1145/2503210.2503269(1-9)Online publication date: 17-Nov-2013
https://dl.acm.org/doi/10.1145/2503210.2503269
Klug TOtt MWeidendorfer JTrinitis C(2011)autopinTransactions on high-performance embedded architectures and compilers III10.5555/1980776.1980792(219-235)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/1980776.1980792
Zhao QKoh DRaza SBruening DWong WAmarasinghe S(2011)Dynamic cache contention detection in multi-threaded applicationsACM SIGPLAN Notices10.1145/2007477.195268846:7(27-38)Online publication date: 9-Mar-2011
https://dl.acm.org/doi/10.1145/2007477.1952688
Show More Cited By

Recommendations

Reactive NUCA: near-optimal block placement and replication in distributed caches
ISCA '09: Proceedings of the 36th annual international symposium on Computer architecture

Increases in on-chip communication delay and the large working sets of server and scientific workloads complicate the design of the on-chip last-level cache for multicore processors. The large working sets favor a shared cache design that maximizes the ...
Read More
Reactive NUCA: near-optimal block placement and replication in distributed caches

Increases in on-chip communication delay and the large working sets of server and scientific workloads complicate the design of the on-chip last-level cache for multicore processors. The large working sets favor a shared cache design that maximizes the ...
Read More
SRM-buffer: an OS buffer management technique to prevent last level cache from thrashing in multicores
EuroSys '11: Proceedings of the sixth conference on Computer systems

Buffer caches in operating systems keep active file blocks in memory to reduce disk accesses. Related studies have been focused on how to minimize buffer misses and the caused performance degradation. However, the side effects and performance ...
Read More

Comments

Information & Contributors

Information

Published In

PaCT'07: Proceedings of the 9th international conference on Parallel Computing Technologies

September 2007

631 pages

ISBN:3540739394

Editor:
Victor Malyshkin
Russian Academy of Sciences, Institute of Computational Mathematics and Mathematical Geophysics, Supercomputer Software Department, Novosibirsk, Russia

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 September 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jayasena SAmarasinghe SAbeyweera AAmarasinghe GDe Silva HRathnayake SMeng XLiu YGropp WMatsuoka S(2013)Detection of false sharing using machine learningProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.1145/2503210.2503269(1-9)Online publication date: 17-Nov-2013
https://dl.acm.org/doi/10.1145/2503210.2503269
Klug TOtt MWeidendorfer JTrinitis C(2011)autopinTransactions on high-performance embedded architectures and compilers III10.5555/1980776.1980792(219-235)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/1980776.1980792
Zhao QKoh DRaza SBruening DWong WAmarasinghe S(2011)Dynamic cache contention detection in multi-threaded applicationsACM SIGPLAN Notices10.1145/2007477.195268846:7(27-38)Online publication date: 9-Mar-2011
https://dl.acm.org/doi/10.1145/2007477.1952688
Zhao QKoh DRaza SBruening DWong WAmarasinghe SPetrank ELea D(2011)Dynamic cache contention detection in multi-threaded applicationsProceedings of the 7th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments10.1145/1952682.1952688(27-38)Online publication date: 9-Mar-2011
https://dl.acm.org/doi/10.1145/1952682.1952688
Klug TOtt MWeidendorfer JTrinitis C(2011)autopin --- Automated Optimization of Thread-to-Core Pinning on Multicore SystemsProceedings of the 2011 conference on Transactions on High-Performance Embedded Architectures and Compilers III - Volume 659010.1007/978-3-642-19448-1_12(219-235)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.1007/978-3-642-19448-1_12
Zuckerman SJalby W(2010)Tackling cache-line stealing effects using run-time adaptationProceedings of the 23rd international conference on Languages and compilers for parallel computing10.5555/1964536.1964541(62-76)Online publication date: 7-Oct-2010
https://dl.acm.org/doi/10.5555/1964536.1964541
Günther SWeidendorfer JCohn RHollingsworth JKumar N(2009)Assessing cache false sharing effects by dynamic binary instrumentationProceedings of the Workshop on Binary Instrumentation and Applications10.1145/1791194.1791198(26-33)Online publication date: 12-Dec-2009
https://dl.acm.org/doi/10.1145/1791194.1791198

Abstract

References

Cited By

Recommendations

Reactive NUCA: near-optimal block placement and replication in distributed caches

Reactive NUCA: near-optimal block placement and replication in distributed caches

SRM-buffer: an OS buffer management technique to prevent last level cache from thrashing in multicores

Comments

Information

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations