Sciweavers

31 search results - page 1 / 7
» An Efficient Causal Order Algorithm for Message Delivery in ...
Sort
View
FTDCS
1997
IEEE
13 years 9 months ago
An Efficient Causal Order Algorithm for Message Delivery in Distributed System
Though causal order of message delivery simplifies the design and development of distributed applications, the overhead of enforcing it is not negligible. Causal order algorithm w...
Ikhyeon Jang, Jaehyung Park, Jung Wan Cho, Hyunsoo...
SAC
2010
ACM
13 years 11 months ago
Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms
We study the fifo and causal multicast problem, two group-communication abstractions that deliver messages in an order consistent with their context. With fifo multicast, the co...
Nicolas Schiper, Fernando Pedone
IPPS
2007
IEEE
13 years 11 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
SAC
2006
ACM
13 years 4 months ago
From spontaneous total order to uniform total order: different degrees of optimistic delivery
A total order protocol is a fundamental building block in the construction of distributed fault-tolerant applications. Unfortunately, the implementation of such a primitive can be...
Luís Rodrigues, José Mocito, Nuno Ca...
ICDCS
1996
IEEE
13 years 9 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg