Sciweavers

369 search results - page 59 / 74
» Canonical finite state machines for distributed systems
Sort
View
EGC
2005
Springer
14 years 1 months ago
Transparent Fault Tolerance for Grid Applications
A major challenge facing grid applications is the appropriate handling of failures. In this paper we address the problem of making parallel Java applications based on Remote Method...
Pawel Garbacki, Bartosz Biskupski, Henri E. Bal
SOSP
2007
ACM
14 years 4 months ago
Zyzzyva: speculative byzantine fault tolerance
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond...
Ramakrishna Kotla, Lorenzo Alvisi, Michael Dahlin,...
USENIX
2007
13 years 10 months ago
A Memory Soft Error Measurement on Production Systems
Memory state can be corrupted by the impact of particles causing single-event upsets (SEUs). Understanding and dealing with these soft (or transient) errors is important for syste...
Xin Li, Kai Shen, Michael C. Huang, Lingkun Chu
ESOP
2012
Springer
12 years 3 months ago
Multiparty Session Types Meet Communicating Automata
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Pierre-Malo Deniélou, Nobuko Yoshida
POPL
2012
ACM
12 years 3 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni