Coping with anomalies in parallel branch-and-bound algorithms
IEEE Transactions on Computers - The MIT Press scientific computation series
Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
Concerning the size of logical clocks in distributed systems
Information Processing Letters
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
An efficient implementation of vector clocks
Information Processing Letters
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Randomized parallel algorithms for backtrack search and branch-and-bound computation
Journal of the ACM (JACM)
Massively parallel models of computation: distributed parallel processing in artificial intelligence and optimisation
An introduction to distributed algorithms
An introduction to distributed algorithms
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
A New Algorithm to Implement Causal Ordering
Proceedings of the 3rd International Workshop on Distributed Algorithms
On reducing the complexity of matrix clocks
Parallel Computing
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
Concurrent and Distributed Computing in Java
Concurrent and Distributed Computing in Java
Black hole search in asynchronous rings using tokens
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Requirements and challenges for building service-oriented pervasive middleware
Proceedings of the 2009 international conference on Pervasive services
Implementing endogenous and exogenous connectors with the common component architecture
Proceedings of the 2009 Workshop on Component-Based High Performance Computing
| Hi-index | 0.00 |
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. We provide some experimental evidence in these two cases.