Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Practical byzantine fault tolerance and proactive recovery
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.
Speedy transactions in multicore in-memory databases
A commit protocol based on optimistic concurrency control that provides serializability while avoiding all shared-memory writes for records that were only read, which achieves excellent performance and scalability on modern multicore machines.
A behavioral notion of subtyping
This paper presents a way of specifying types that makes it convenient to define the subtype relation, and discusses the ramifications of this notion of subtyping on the design of type families.
Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
This thesis presents the first implementation-independent specifications of existing ANSI isolation levels and a number of levels that are widely used in commercial systems, e.g., Cursor Stability, Snapshot Isolation, and specifies a variety of guarantees for predicate-based operations in an implementation- independent manner.
A decentralized model for information flow control
This paper presents a new model for controlling information flo w in systems with mutual distrust and decentralized authority that improves on existing multilevel security models by allowing users to declassify information in a decentralized way, and by improving support for fine-grained data sharing.
Protecting privacy using the decentralized label model
The article introduces the language Jif, an extension to Java that provides static checking of information flow using the decentralized label model, which improves on existing multilevel security models by allowing users to declassify information in a decentralized way, and by improving support for fine-grained data sharing.
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
- James A. Cowling, Daniel S. Myers, B. Liskov, R. Rodrigues, L. Shrira
- Computer ScienceOSDI '06
- 6 November 2006
HQ is presented, a hybrid Byzantine-fault-tolerant state machine replication protocol that employs a lightweight quorum-based protocol when there is no contention, but uses BFT to resolve contention when it arises and shows that both HQ and the new implementation of BFT scale as f increases.
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
This paper presents a new replication algorithm that has desirable performance properties, based on the primary copy technique, and uses a special kind of timestamp called a viewstamp to detect lost information.
Providing high availability using lazy replication
This paper describes a new way of implementing causal operations that performs well in terms of response time, operation-processing capacity, amount of stored state, and number and size of messages; it does better than replication methods based on reliable multicast techniques.