HQ Replication: Properties and Optimizations (2007)
Cowling, James, Myers, Daniel, Liskov, Barbara, Rodrigues, Rodrigo, Shrira, Liuba
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a...
HQ Replication: Properties and Optimizations (2007)
Cowling, James, Myers, Daniel, Liskov, Barbara, Rodrigues, Rodrigo, Shrira, Liuba
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a...
Automatic Software Upgrades for Distributed Systems (2005)
Ajmani, Sameer, Liskov, Barbara, Shrira, Liuba, Curtis, Dorothy
Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting...
Automatic Software Upgrades for Distributed Systems (2005)
Ajmani, Sameer, Liskov, Barbara, Shrira, Liuba, Curtis, Dorothy
Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting...
The Design of a Robust Peer-to-Peer System (2004)
Rodrigo Rodrigues, Barbara Liskov, Liuba Shrira
Peer-to-peer (P2P) overlay networks have recently become one of the hottest topics in OS research. These networks bring with them the promise of harnessing idle storage and network resources from...
Lazy Modular Upgrades in Persistent Object Stores (2003)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira, Chuang-hue Moh, Steven Richman
Persistent object stores require a way to automatically upgrade persistent objects, to change their code and storage representation. Automatic upgrades are a challenge for such systems. Upgrades must...
Lazy Modular Upgrades in Persistent Object Stores (2003)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira, Chuang-hue Moh, Steven Richman
Persistent object stores require a way to automatically upgrade persistent objects, to change their code and storage representation. Automatic upgrades are a challenge for such systems. Upgrades must...
Ownership Types for Object Encapsulation (2003)
Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira
object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that enforces strict object encapsulation is too constraining: it does...
ACM Symposium on Principles of Programming Languages (POPL), January 2003 (2003)
Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira
object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that enforces strict object encapsulation is too constraining: it does...
Scheduling and Simulation: How to Upgrade Distributed Systems (2003)
Sameer Ajmani, Barbara Liskov, Liuba Shrira
Upgrading the software of long-lived distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be down and halting the system for an...
Scheduling and Simulation: How to Upgrade Distributed Systems (2003)
Sameer Ajmani, Barbara Liskov, Liuba Shrira
Upgrading the software of long-lived distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be down and halting the system for an...
Lazy Modular Upgrades in Persistent Object Stores (2003)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira, Chuang-hue Moh, Steven Richman
Persistent object stores require a way to automatically upgrade persistent objects. Automatic upgrades are a challenge for such systems. Upgrades must be performed in a way that is efficient both in...
Scheduling and Simulation: How to Upgrade Distributed Systems (2003)
Sameer Ajmani, Barbara Liskov, Liuba Shrira
Upgrading the software of long-lived distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be down and halting the system for an...
Ownership Types for Object Encapsulation (2003)
Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira
Ownership types provide a statically enforceable way of specifying object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that...
Replication in the Harp File System (2002)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira, Michael Williams
technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicates This paper describes the design and implementation of the with other backup servers and...
Ownership Types and Safe Lazy Upgrades in Object-Oriented Databases (2002)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira
This paper describes a novel mechanism for upgrading objects in an object-oriented database. Unlike earlier systems, our mechanism is expressive, supporting a rich set of upgrades; it is ecient and...
Ownership Types and Safe Lazy Upgrades in Object-Oriented Databases (2002)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira
This paper describes a novel mechanism for upgrading objects in an object-oriented database. Unlike earlier systems, our mechanism is expressive, supporting a rich set of upgrades; it is ecient and...
Providing Persistent Objects in Distributed Systems (2002)
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul Adya
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic transactions. The...
Ownership Types and Safe Lazy Upgrades in Object-Oriented Databases (2002)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira
This paper describes a novel mechanism for upgrading objects in an object-oriented database. Unlike earlier systems, our mechanism is expressive, supporting a rich set of upgrades; it is efficient...
Ownership Types and Safe Lazy Upgrades in Object-Oriented Databases (2002)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira
This paper describes a novel mechanism for upgrading objects in an object-oriented database. Unlike earlier systems, our mechanism is expressive, supporting a rich set of upgrades; it is efficient...
Ownership Types and Safe Lazy Upgrades in Object-Oriented Databases (2002)
Rasekhar Boyapati, Barbara Liskov, Liuba Shrira
This paper describes a novel mechanism for upgrading objects in an object-oriented database. Unlike earlier systems, our mechanism is expressive, supporting a rich set of upgrades; it is ecient and...
Hybrid Caching for Scalable Object Systems (Think Globally, Act Locally) (2002)
Object-based client caching allows clients to keep more frequently accessed objects while discarding colder objects that reside on the same page. However, when these objects are modified and sent to...
Opportunistic Log: Efficient Installation Reads (2002)
In a distributed storage system, client caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page...
Safe Lazy Software Upgrades in Object-Oriented Databases (2002)
Barbara Liskov, Chuang-hue Moh, Steven Richman, Liuba Shrira, Yin Cheung, Rasekhar Boyapati
Object-oriented databases allow objects that are manipulated by programs to be stored reliably so that they can be used again later and shared with other programs. Since objects in the OODB may live...
The Design of a Robust Peer-to-Peer System (2002)
Rodrigo Rodrigues, Barbara Liskov, Liuba Shrira
Peer-to-peer (P2P) overlay networks have recently become one of the hottest topics in OS research. These networks bring with them the promise of harnessing idle storage and network resources from...
The Design of a Robust Peer-to-Peer System (2002)
Rodrigo Rodrigues, Barbara Liskov, Liuba Shrira
Peer-to-peer (P2P) overlay networks have recently become one of the hottest topics in OS research. These networks bring with them the promise of harnessing idle storage and network resources from...
Safe Lazy Software Upgrades in Object-Oriented Databases (2002)
Barbara Liskov, Chuang-hue Moh, Steven Richman, Liuba Shrira, Yin Cheung, Rasekhar Boyapati
Object-oriented databases allow objects that are manipulated by programs to be stored reliably so that they can be used again later and shared with other programs. Since objects in the OODB may live...
Safe Lazy Software Upgrades in Object-Oriented (2002)
Barbara Liskov, Chuang-hue Moh, Steven Richman, Liuba Shrira, Yin Cheung, Rasekhar Boyapati
Object-oriented databases allow objects that are manipulated by programs to be stored reliably so that they can be used again later and shared with other programs. Since objects in the OODB may live...
Lazy Replication: Exploiting the Semantics of Distributed Services (2001)
Barbara Llskov, Liuba Shrira, Sanjay Ghemawat
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the...
Coordinated Resource Management (2001)
Sanjay Ghemawat, Robert Gruber, Liuba Shrira
We propose several new techniques for resource management in a replicated object server. By coordinating cache and disk usage among the replicas, these techniques increase throughput and reduce fetch...
Hybrid Caching for Scalable Object Systems (Think Globally, Act Locally) (2001)
Object-based client caching allows clients to keep more frequently accessed objects while discarding colder objects that reside on the same page. However, when these objects are modified and sent to...
Efficient At-Most-Once Messages Based On Synchronized Clocks (2001)
This paper describes a new message passing protocol that provides guaranteed detection of duplicate messages even when the receiver has no state stored for the sender. It also discusses how to use...
Correctness Proof For A Network Synchronizer (2001)
Harish Devarajan, Alan Fekete, Nancy Lynch, Liuba Shrira
In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O...
A Technique for Constructing Highly-Available Services (2001)
Barbara Liskov, Liuba Shrira, Liuba Shrlra
service consists of replicas that reside at several different locations in a network. It presents its clients with a consistent view of its state, but the view may contain old information. Clients...
Barbara Llskov, Liuba Shrira, Sanjay Ghemawat
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the...
Coordinated Resource Management (2000)
Sanjay Ghemawat, Robert Gruber, Liuba Shrira
We propose several new techniques for resource management in a replicated object server. By coordinating cache and disk usage among the replicas, these techniques increase throughput and reduce fetch...
How to Scale a Transactional Storage System in a Cluster (1999)
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
this paper we describe a new transactional storage system architecture, split caching, that adapts cooperative caching in a novel way to provide this support; our scheme achieves this goal in a way...
Providing Persistent Objects in Distributed Systems (1999)
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul Adya
. THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic transactions....
Providing Persistent Objects in Distributed Systems (1999)
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul Adya
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic transactions. The...
Lazy Replication: Exploiting the Semantics of Distributed Services. (1998)
Ladin, Rivka, Liskov, Barbara, Shrira, Liuba, Ghemawat, Sanjay
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the...
Replication in the Harp File System. (1998)
Liskov, Barbara, Ghemawat, Sanjay, Gruber, Robert, Johnson, Paul, Shrira, Liuba
This paper describes the design and implementation of the Harp (Highly Available Reliable Persistent) file system. Harp is a replicated Unix file system accessible via the VFS (Virtual File System)...
Trust but Check: Mutable Objects in Untrusted Cooperative Caches (1998)
Cooperative caching is known to be an effective technique for improving the performance of large scale distributed storage systems [5, 6, 7, 11, 1]. Nevertheless, current cooperative caching...
Replication in the Harp File System (1997)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira, Michael Williams
technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicates This paper describes the design and implementation of the with other backup servers and...
Providing High Availability Using Lazy Replication (1997)
Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the...
Fragment Reconstruction: Providing Global Cache Coherence in a Transactional Storage System (1997)
Atul Adya, Miguel Castro, Barbara Liskov, Umesh Maheshwari, Liuba Shrira
Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by servicing client...
Fragment Reconstruction: Providing Global Cache Coherence in a Transactional Storage System (1997)
Atul Adya, Miguel Castro, Barbara Liskov, Umesh Maheshwari, Liuba Shrira
Cooperative caching is a promising technique to avoid the increasingly formidable disk bottleneck problem in distributed storage systems; it reduces the number of disk accesses by servicing client...
How to Scale a Transactional Storage System in a Cluster (1996)
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
this paper we describe a new transactional storage system architecture, split caching, that adapts cooperative caching in a novel way to provide this support; our scheme achieves this goal in a way...
How to Scale Transactional Storage Systems (1996)
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distributed file systems...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
Fragment reconstruction is a cache coherence protocol for transactional storage systems based on global caching in a network of workstations. It supports fine-grained sharing and works in the...
How to Scale Transactional Storage Systems (1996)
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distributed file systems...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
Fragment reconstruction is a cache coherence protocol for transactional storage systems based on global caching in a network of workstations. It supports fine-grained sharing and works in the...
How to Scale Transactional Storage Systems (1996)
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
Applications of the future will need to support large numbers of clients and will require scalable storage systems that allow state to be shared reliably. Recent research in distributed file systems...
Opportunistic Log: Efficient Installation Reads in a Reliable Storage Server (1996)
In a distributed storage system, client caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page...
Hybrid Caching for Large-Scale Object Systems (Think Globally, Act Locally) (1996)
Object-based client caching allows clients to keep more frequently accessed objects while discarding colder objects that reside on the same page. However, when these objects are modified and sent to...
Hybrid Caching for Large-Scale Object Systems (1996)
Object-based client caching allows clients to keep more frequently accessed objects while discarding colder objects that reside on the same page. However, when these objects are modified and sent to...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
This paper describes a new scalable memory management architecture, split caching, for networkbased transactional object storage systems. The architecture allows storage system clients and servers to...
Liuba Shrira, Barbara Liskov, Miguel Castro, Atul Adya
This paper describes a new scalable memory management architecture, split caching, for networkbased transactional object storage systems. The architecture allows storage system clients and servers to...
Barbara Liskov, Atul Adya, Miguel Castro, Eui-suk Chung, Dorothy Curtis, Sanjay Ghemawat, ...
This document provides an introduction to using Thor, an object oriented database, and its language Theta. This document applies to Thor Release 0.1. Topics include installation, writing Theta code...
Replication in the Harp File System (1995)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira, Michael Williams
technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicates This paper describes the design and implementation of the with other backup servers and...
Disconnected Operation in the Thor Object-Oriented Database System (1995)
Robert Gruber, Frans Kaashoek, Barbara Liskov, Liuba Shrira
This paper discusses issues raised by providing disconnected operation in the Thor object-oriented database system. Disconnected operation in such a system poses new challenges because of the small...
The Language-Independent Interface of the Thor Persistent Object System (1995)
Barbara Liskov, Mark Day, Sanjay Ghemawat, Robert Gruber, Umesh Maheshwari, Andrew C. Myers, ...
Thor is a new object-oriented database system being developed at MIT. It allows applications written in different programming languages, and possibly running on heterogeneous machines and operating...
Disconnected Operation in the Thor Object-Oriented Database System (1994)
Robert Gruber, Frans Kaashoek, Barbara Liskov, Liuba Shrira
This paper discusses issues raised by providing disconnected operation in the Thor object-oriented database system. Disconnected operation in such a system poses new challenges because of the small...
Opportunistic Log: Efficient Installation Reads in a Reliable Storage Server (1994)
In a distributed storage system, client caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page...
Efficient Recovery in Harp (1994)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira
Introduction Harp is a replicated Unix file system accessible via the VFS interface. It provides highly available and reliable storage for files and guarantees that file operations are executed...
Distributed Object Management in Thor (1994)
Barbara Liskov, Mark Day, Liuba Shrira
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share...
The Language-Independent Interface of the Thor Persistent Object System (1994)
Barbara Liskov, Mark Day, Sanjay Ghemawat, Robert Gruber, Umesh Maheshwari, Andrew C. Myers, ...
Thor is a new object-oriented database system being developed at MIT. It allows applications written in different programming languages, and possibly running on heterogeneous machines and operating...
Opportunistic Log: Efficient Reads in a Reliable Object Server (1994)
Object servers offer the potential of improved client caching. However, in comparison to page servers, object servers must perform additional disk reads. These installation reads are required to...
The Language-Independent Interface of the Thor Persistent Object System (1994)
Barbara Liskov, Mark Day, Sanjay Ghemawat, Robert Gruber, Umesh Maheshwari, Andrew C. Myers, ...
Thor is a new object-oriented database system being developed at MIT. It allows applications written in different programming languages, and possibly running on heterogeneous machines and operating...
The Language-Independent Interface of the Thor Persistent Object System (1994)
Barbara Liskov, Mark Day, Sanjay Ghemawat, Robert Gruber, Umesh Maheshwari, Andrew C. Myers, ...
Thor is a new object-oriented database system being developed at MIT. It allows applications written in different programming languages, and possibly running on heterogeneous machines and operating...
Coordinated Resource Management in a Replicated Object Server (1994)
Sanjay Ghemawat, Robert Gruber, Liuba Shrira
We propose several new techniques for resource management in a replicated object server. By coordinating cache and disk usage among the replicas, these techniques increase throughput and reduce fetch...
Distributed Object Management in Thor (1993)
Barbara Liskov, Mark Day, Liuba Shrira
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share...
Distributed Object Management in Thor (1993)
Barbara Liskov, Mark Day, Liuba Shrira
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share...
Efficient Recovery in Harp (1993)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira
Introduction Harp is a replicated Unix file system accessible via the VFS interface. It provides highly available and reliable storage for files and guarantees that file operations are executed...
Efficient Recovery in Harp (1993)
Barbara Liskov, Sanjay Ghemawat, Robert Gruber, Paul Johnson, Liuba Shrira
Introduction Harp is a replicated Unix file system accessible via the VFS interface. It provides highly available and reliable storage for files and guarantees that file operations are executed...