Hidden costs in avoiding false sharing in software DSMs

DOI10.1007/3-540-45307-5_26MaRDI QIDQ4473948zbMATH OpenFDO

Authors K. V. Manjunath, Rama Govindarajan

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2228/22280294.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Recommendations

• Performance analysis of methods that overcome false sharing effects in software DSMs
• Limited multiple-writer: An approach to dealing with false sharing in software DSMs
• Sharing cost information: A counterexample
• Sharing non-anonymous costs of multiple resources optimally
• Flaws in Some Secret Sharing Schemes Against Cheating
• Incentive and trust issues in assured information sharing
• The Cost of Privatization in Software Transactional Memory

Cited in

(5)

• Supporting flexible data distribution in software DSMs
• Limited multiple-writer: An approach to dealing with false sharing in software DSMs
• Performance analysis of methods that overcome false sharing effects in software DSMs
• False sharing and spatial locality in multiprocessor caches
• IMPROVING THE EXECUTION EFFICIENCY OF BARRIER SYNCHRONIZATION IN SOFTWARE DSM THROUGH STATIC ANALYSIS

This page was built for publication: Hidden costs in avoiding false sharing in software DSMs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473948)