Sciweavers

35 search results - page 7 / 7
» State Machine Replication with Byzantine Faults
Sort
View
115
Voted
DSN
2002
IEEE
15 years 8 months ago
Generic Timing Fault Tolerance using a Timely Computing Base
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
Antonio Casimiro, Paulo Veríssimo
113
Voted
IPPS
2002
IEEE
15 years 8 months ago
Fault-Tolerance in the Network Storage Stack
This paper addresses the issue of fault-tolerance in applications that make use of network storage. A network abstraction called the Network Storage Stack is presented, along with...
Scott Atchley, Stephen Soltesz, James S. Plank, Mi...
121
Voted
EGC
2005
Springer
15 years 9 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
144
Voted
AICCSA
2001
IEEE
95views Hardware» more  AICCSA 2001»
15 years 7 months ago
An Environment Physically Distributed in Java
- This paper presents an environment for development of distributed applications. It consists basically of adding to language Java a library of methods to manipulate shared objects...
Denivaldo Lopes, Zair Abdelouahab
113
Voted
EUROSYS
2010
ACM
16 years 23 days ago
The Next 700 BFT Protocols
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
Rachid Guerraoui, Nikola Knezevic, Vivien Quéma, ...