Sciweavers

113 search results - page 2 / 23
» Timestamping messages and events in a distributed system usi...
Sort
View
CONCUR
2007
Springer
13 years 9 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
ATAL
2008
Springer
13 years 7 months ago
Synchronization protocols for reliable communication in fully distributed agent systems
In order to prevent misunderstandings within groups of interacting agents, it is necessary to ensure that the agents' beliefs regarding the overall state of the interaction a...
Hywel R. Dunn-Davies, Jim Cunningham, Shamimabi Pa...
ICDCS
2005
IEEE
13 years 11 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
ECRTS
2000
IEEE
13 years 9 months ago
Prototyping distributed multimedia systems using communicating real-time state machines
This paper describes a methodology for the development of real-time systems and shows its application to the modeling, analysis and implementation of distributed multimedia system...
Giancarlo Fortino, Libero Nigro
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 2 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski