Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2006-11-30
Parallel Computing 35 (2009), 12-28
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
10.1016/j.parco.2008.09.011
Asynchronous executions of a distributed algorithm differ from each other due to the nondeterminism in the order in which the messages exchanged are handled. In many situations of interest, the asynchronous executions induced by restricting nondeterminism are more efficient, in an application-specific sense, than the others. In this work, we define partially ordered executions of a distributed algorithm as the executions satisfying some restricted orders of their actions in two different frameworks, those of the so-called event- and pulse-driven computations. The aim of these restrictions is to characterize asynchronous executions that are likely to be more efficient for some important classes of applications. Also, an asynchronous algorithm that ensures the occurrence of partially ordered executions is given for each case. Two of the applications that we believe may benefit from the restricted nondeterminism are backtrack search, in the event-driven case, and iterative algorithms for systems of linear equations, in the pulse-driven case.
Barbosa Valmir C.
Correa Ricardo C.
No associations
LandOfFree
Partially ordered distributed computations on asynchronous point-to-point networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Partially ordered distributed computations on asynchronous point-to-point networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partially ordered distributed computations on asynchronous point-to-point networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-422720