Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Multitolerant Barrier Synchronization Sandeep S. Kulkarni Anish Arora
 

Summary: Multitolerant Barrier Synchronization
Sandeep S. Kulkarni Anish Arora
Department of Computer and Information Science 1
The Ohio State University
Columbus, OH 43210 USA
Abstract
We design a multitolerant program for synchronizing the phases of concurrent processes. The
tolerances of the program enable processes to (i) execute all phases correctly in the presence of
faults that corrupt process state in a detectable manner, and (ii) execute only a minimum possible
number of phases incorrectly before resuming correct computation in the presence of faults that
corrupt process state in an undetectable manner.
Keywords: fault­tolerance, detectable and undetectable faults, parallel processing, concurrency
1 Motivation
Barrier synchronization in its general form requires that a set of processes execute a cyclic sequence of
phases so that a phase is executed by each process only after all processes have completed the previous
phase. This form of synchronization generalizes a variety of others, such as clock unison [1], phase
synchronization [2] and atomic commitment [3], and appears frequently in parallel, distributed, and
scientific computation applications.
Often the design of barrier synchronization has to accommodate the occurrence of faults. Commonly
considered examples of faults include incorrect initializations; corruption, loss, reordering, and dupli­

  

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences