Efficient Causality-Tracking Timestamping
IEEE Transactions on Knowledge and Data Engineering
Efficient algorithms for verifying memory consistency
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Parallel and Distributed Computing
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Detecting Locally Distributed Predicates
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Agreeing to agree: conflict resolution for optimistically replicated data
DISC'06 Proceedings of the 20th international conference on Distributed Computing
K---Resilient server synchronization protocol for session guarantees in MANET environments
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
K-resilient session guarantees synchronization protocol for mobile ad-hoc networks
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Dissemination of reconfiguration policies on mesh networks
DAIS'12 Proceedings of the 12th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Specification and verification of reliability in dispatching multicast messages
The Journal of Supercomputing
Link prediction with social vector clocks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
A distributed computation consists of a set of processes that cooperate to achieve a common goal. A main characteristic of these computations is that the processes do not already share a common global memory and that they communicate only by exchanging messages over a communication network. Moreover, message transfer delays are finite yet unpredictable. This computation model defines what is known as the asynchronous distributed system model, which includes systems that span large geographic areas and are subject to unpredictable loads.