Aldelir Fernando Luiz

Learn More
Transaction commit is a problem much investigated, both in the databases and systems communities, from the theoretical and practical sides. We present a modular approach to solve this problem in the context of database replication on environments that are subject to Byzantine faults. Our protocol builds on a total order multicast abstraction and is proven(More)
A major challenge of computer systems is making these more robust, reliable and secure. In recent years, it has been found that the state machine replication is one of the most common techniques for designing systems that need high reliability. This paper introduces a new architecture for replication of Byzantine fault tolerant service, based on the tuple(More)
Replication is often considered a cost-effective solution for building dependable systems with off-the-shelf hardware. Replication software is usually designed to tolerate crash faults, but Byzantine (or arbitrary) faults such as software bugs are well-known to affect transactional database management systems (DBMSs) as many other classes of software.(More)
We present an architecture and an algorithm for Byzantine faulttolerant state machine replication. Our algorithm explores the advantages of virtualization to reliably detect and tolerate faulty replicas, allowing the transformation of Byzantine faults into omission faults. Our approach reduces the total number of physical replicas from 3f+1 to 2f+1. Our(More)
—The reliability and availability of distributed services can be ensured using replication. We present an architecture and an algorithm for Byzantine fault-tolerant state machine replication. We explore the benefits of virtualization to reliably detect and tolerate faulty replicas, allowing the transformation of Byzantine faults into omission faults. Our(More)
Clouds are a suitable place to store data with scalability and financial flexibility. However, it is difficult to ensure the reliability of the data stored in a cloud. Byzantine fault tolerance can improve reliability, but at a high cost. This paper presents a technique that anticipates requests in order to reduce that cost. We show that this technique(More)
In this work we present the Byzantine Fault Tolerant Non-Blocking Weak Atomic Commitment (BFTNBWAC), a new proposal to solve the Non-Blocking Atomic Commitment (NBAC) problem, where the participants of protocol may fail in a Byzantine way. Our approach is based on virtualization technology, in which we specify a distributed system's architecture that makes(More)
  • 1