The impact of memory models on software reliability in multiprocessors

Authors:
Alexander Jaffe;Thomas Moscibroda;Laura Effinger-Dean;Luis Ceze;Karin Strauss
Affiliations:
University of Washington, Seattle, WA, USA;Microsoft Research, Redmond, WA, USA;University of Washington, Seattle, WA, USA;University of Washington, Seattle, WA, USA;Microsoft Research, Redmond, WA, USA
Venue:
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2011

Citing 14
Cited 0

Memory access buffering in multiprocessors

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
The SPARC architecture manual: version 8

The SPARC architecture manual: version 8
Is SC + ILP = RC?

ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Weak ordering—a new definition

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Memory consistency and event ordering in scalable shared-memory multiprocessors

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Shared Memory Consistency Models: A Tutorial

Computer
A type and effect system for atomicity

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Hiding Relaxed Memory Consistency with Compilers

PACT '00 Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Memory Model = Instruction Reordering + Store Atomicity

Proceedings of the 33rd annual international symposium on Computer Architecture
BulkSC: bulk enforcement of sequential consistency

Proceedings of the 34th annual international symposium on Computer architecture
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics

Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Foundations of the C++ concurrency memory model

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated in terms of their impact on performance, hardware complexity and programmability. This paper adds a new dimension to this discussion: the impact of memory models on software reliability. By allowing some instructions to reorder, weak memory models may expand the window between critical memory operations. This can increase the chance of an undesirable thread-interleaving, thus allowing an otherwise-unlikely concurrency bug to manifest. To explore this phenomenon, we define and study a probabilistic model of shared-memory parallel programs that takes into account such reordering. We use this model to formally derive bounds on the vulnerability to concurrency bugs of different memory models. Our results show that for 2 concurrent threads, weaker memory models do indeed have a higher likelihood of allowing bugs. On the other hand, we show that as the number of parallel, buggy threads increases, the gap between the different memory models becomes proportionally insignificant, and thus the importance of using a strict memory model diminishes.