Krace: Data race fuzzing for kernel file systems
Data races occur when two threads fail to use proper synchronization when accessing
shared data. In kernel file systems, which are highly concurrent by design, data races are …
shared data. In kernel file systems, which are highly concurrent by design, data races are …
What are race conditions? Some issues and formalizations
RHB Netzer, BP Miller - ACM Letters on Programming Languages and …, 1992 - dl.acm.org
In shared-memory parallel programs that use explicit synchronization, race conditions result
when accesses to shared memory are not properly synchronized. Race conditions are often …
when accesses to shared memory are not properly synchronized. Race conditions are often …
Weak ordering—a new definition
A memory model for a shared memory, multiprocessor commonly and often implicitly
assumed by programmers is that of sequential consistency. This model guarantees that all …
assumed by programmers is that of sequential consistency. This model guarantees that all …
RAP: A real-time communication architecture for large-scale wireless sensor networks
C Lu, BM Blum, TF Abdelzaher… - … . Eighth IEEE Real …, 2002 - ieeexplore.ieee.org
Large-scale wireless sensor networks represent a new generation of real-time embedded
systems with significantly different communication constraints from traditional networked …
systems with significantly different communication constraints from traditional networked …
Race directed random testing of concurrent programs
K Sen - Proceedings of the 29th ACM SIGPLAN Conference on …, 2008 - dl.acm.org
Bugs in multi-threaded programs often arise due to data races. Numerous static and
dynamic program analysis techniques have been proposed to detect data races. We …
dynamic program analysis techniques have been proposed to detect data races. We …
Efficient on-the-fly data race detection in multithreaded C++ programs
E Pozniansky, A Schuster - Proceedings of the ninth ACM SIGPLAN …, 2003 - dl.acm.org
Data race detection is highly essential for debugging multithreaded programs and assuring
their correctness. Nevertheless, there is no single universal technique capable of handling …
their correctness. Nevertheless, there is no single universal technique capable of handling …
[PDF][PDF] On-the-fly detection of data races for programs with nested fork-join parallelism
J Mellor-Crummey - Proceedings of the 1991 ACM/IEEE Conference on …, 1991 - dl.acm.org
Detecting data races in shared-memory parallel programs is an important debugging
problem. This paper presents a new protocol for run-time detection of data races in …
problem. This paper presents a new protocol for run-time detection of data races in …
[PDF][PDF] Detecting access anomalies in programs with critical sections
A Dinning, E Schonberg - Proceedings of the 1991 ACM/ONR workshop …, 1991 - dl.acm.org
ThE paper presents an efficient on-the-fly method for detecting accessanomalies in
programs that contain critical section coordinw tion. For a large class of programs, a single …
programs that contain critical section coordinw tion. For a large class of programs, a single …
Effective race detection for event-driven programs
Like shared-memory multi-threaded programs, event-driven programs such as client-side
web applications are susceptible to data races that are hard to reproduce and debug. Race …
web applications are susceptible to data races that are hard to reproduce and debug. Race …
[图书][B] Memory consistency models for shared-memory multiprocessors
K Gharachorloo - 1996 - search.proquest.com
The memory consistency model for a shared-memory multiprocessor specifies the behavior
of memory with respect to read and write operations from multiple processors. As such, the …
of memory with respect to read and write operations from multiple processors. As such, the …