Operating Systems Design and Implementation · 2010 · 145 citations · 47 references
ComputingComputer ScienceComputer SystemsFault ToleranceOperating SystemsParallel ComputingDistributed ComputingParallel Computing SystemsParallel DebuggingParallel Runtime SystemsShared-memory MultiprocessingShared-memory ParallelismDeterministic ExecutionFault Tolerance MechanismsMulticore ArchitecturesMulticore SystemsMultithreadingParallel Program SynchronizationRepeatabilitySynchronization
Deterministic execution offers many benefits for debugging, fault tolerance, and security. Current methods of executing parallel programs deterministically, however, often incur high costs, allow misbehaved software to defeat repeatability, and transform time-dependent races into input- or path-dependent races without eliminating them. We introduce a new parallel programming model addressing these issues, and use Determinator, a proof-of-concept OS, to demonstrate the model's practicality. Determinator's microkernel API provides only shared-nothing address spaces and deterministic interprocess communication primitives to make execution of all unprivileged code--well-behaved or not-- precisely repeatable. Atop this microkernel, Determinator's user-level runtime adapts optimistic replication techniques to offer a private workspace model for both thread-level and process-level parallel programing. This model avoids the introduction of read/write data races, and converts write/write races into reliably-detected conflicts. Coarse-grained parallel benchmarks perform and scale comparably to nondeterministic systems, on both multicore PCs and across nodes in a distributed cluster.
47
Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie et al. · 1995 · 3.6K citations · Full text
Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh et al. · 2008 · 3.4K citations
Maurice Herlihy, J. Eliot B. Moss · 1993 · 2.2K citations