Multitolerant Barrier Synchronization (1997)
| Venue: | Information Processing Letters |
| Citations: | 8 - 4 self |
BibTeX
@ARTICLE{Kulkarni97multitolerantbarrier,
author = {Sandeep Kulkarni and Anish Arora},
title = {Multitolerant Barrier Synchronization},
journal = {Information Processing Letters},
year = {1997},
volume = {64},
pages = {29--36}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 t...
Citations
No citations identified.
