Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
DMP: Deterministic Shared Memory Multiprocessing Joseph Devietti Brandon Lucia Luis Ceze Mark Oskin
 

Summary: DMP: Deterministic Shared Memory Multiprocessing
Joseph Devietti Brandon Lucia Luis Ceze Mark Oskin
Computer Science & Engineering, University of Washington
{devietti,blucia0a,luisceze,oskin}@cs.washington.edu
Abstract
Current shared memory multicore and multiprocessor sys-
tems are nondeterministic. Each time these systems execute
a multithreaded application, even if supplied with the same
input, they can produce a different output. This frustrates de-
bugging and limits the ability to properly test multithreaded
code, becoming a major stumbling block to the much-needed
widespread adoption of parallel programming.
In this paper we make the case for fully deterministic
shared memory multiprocessing (DMP). The behavior of an
arbitrary multithreaded program on a DMP system is only a
function of its inputs. The core idea is to make inter-thread
communication fully deterministic. Previous approaches to
coping with nondeterminism in multithreaded programs have
focused on replay, a technique useful only for debugging. In
contrast, while DMP systems are directly useful for debug-

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle
Oskin, Mark - Department of Computer Science and Engineering, University of Washington at Seattle

 

Collections: Computer Technologies and Information Sciences