Partitioned Garbage Collection of a Large Object Store (2002)
Umesh Maheshwari, Barbara Liskov
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. The heap is divided into partitions that are collected...
TDB: A Database System for Digital Rights Management (2001)
Vadpeht Vuvt H, Radek Vingralek, Umesh Maheshwari, William Shapiro
Some emerging applications challenge the assumptions that have influenced the design of database systems in the past. One example is Digital Rights Management (DRM) systems, which ensure that digital...
Hula: An Efficient Protocol for Reliable Delivery of Messages (2001)
We present a new protocol for reliable delivery of messages over a network that might lose, duplicate, reorder, or arbitrarily delay packets. It is the first protocol that guarantees exactly-once and...
Partitioned Garbage Collection of a Large Object Store (2001)
Umesh Maheshwari, Barbara Liskov
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. The heap is divided into partitions that are collected...
Garbage Collection in a Large, Distributed Object Store (2001)
Systems that store a large number of persistent objects over many sites in a network pose new challenges to storage management. This thesis presents a comprehensive design for collecting garbage...
Charge-Based Proportional Scheduling (2001)
Most priority-based schedulers lack the ability to control the relative execution rates of applications. A recent scheme, called lottery scheduling [WW94], uses randomization to control the execution...
Hula: An Efficient Protocol for Reliable Delivery of Messages (1999)
We present a new protocol for reliable delivery of messages over a network that might lose, duplicate, reorder, or arbitrarily delay packets. It is the first protocol that guarantees exactly-once and...
Collecting Cyclic Distributed Garbage (1999)
This paper presents simple techniques to avoid unnecessary migration. We use a heuristic to detect objects that are highly likely to be cyclic garbage and migrate only those. Further, we avoid...
Collecting Cyclic Distributed Garbage by Controlled Migration (1999)
Umesh Maheshwari, Barbara Liskov
Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. A common proposal is...
Collecting Cyclic Distributed Garbage by Controlled Migration (1999)
Umesh Maheshwari, Barbara Liskov
Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. A common proposal is...
Partitioned Garbage Collection of a Large Object Store (1999)
Umesh Maheshwari, Barbara Liskov
We present new techniques for efficient garbage collection in a large persistent object store. The store is divided into partitions that are collected independently using information about...
Collecting Distributed Garbage Cycles by Back Tracing (1999)
Umesh Maheshwari, Barbara Liskov
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-site references as...
Collecting Distributed Garbage Cycles by Back Tracing (1999)
Umesh Maheshwari, Barbara Liskov
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-site references as...
References to Remote Mobile Objects in Thor (1999)
Mark Day, Barbara Liskov, Umesh Maheshwari, Andrew C. Myers
Thor is a distributed object-oriented database where objects are stored persistently at highly-available servers called object repositories, or ORs. In a large Thor system, performance tuning and...
Distributed Garbage Collection in a Client-Server, Transactional, Persistent Object System (1999)
We present a design for distributed garbage collection in a new object-oriented database system called Thor. Garbage collection in Thor is different from that in conventional distributed systems...
References to Remote Mobile Objects in Thor (1999)
Mark Day, Barbara Liskov, Umesh Maheshwari, Andrew C. Myers
Thor is a distributed object-oriented database where objects are stored persistently at highly-available servers called object repositories, or ORs. In a large Thor system, performance tuning and...
Distributed Garbage Collection in a Client-Server, Transactional, Persistent Object System (1999)
We present a design for distributed garbage collection in a new object-oriented database system called Thor. Garbage collection in Thor is different from that in conventional distributed systems...
Partitioned Garbage Collection of a Large Object Store (1999)
Umesh Maheshwari, Barbara Liskov
We present new techniques for efficient garbage collection in a large persistent object store. The store is divided into partitions that are collected independently using information about...
Garbage Collection in a Large, Distributed Object Store (1999)
Systems that store a large number of persistent objects over many sites in a network pose new challenges to storage management. This thesis presents a comprehensive design for collecting garbage...
Garbage Collection in a Large, Distributed Object Store (1999)
Systems that store a large number of persistent objects over many sites in a network pose new challenges to storage management. This thesis presents a comprehensive design for collecting garbage...
Partitioned Garbage Collection of a Large Object Store (1998)
Umesh Maheshwari, Barbara Liskov
We present new techniques for efficient garbage collection in a large persistent object store. The store is divided into partitions that are collected independently using information about...
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (1998)
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage...
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (1998)
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage...
Hula: An Efficient Protocol for Reliable Delivery of Messages (1997)
We present a new protocol for reliable delivery of messages over a network that might lose, duplicate, reorder, or arbitrarily delay packets. It is the first protocol that guarantees exactly-once and...
Garbage Collection in a Large, Distributed Object Store (1997)
Systems that store a large number of persistent objects over many sites in a network pose new challenges to storage management. This thesis presents a comprehensive design for collecting garbage...
Garbage Collection in a Large, Distributed Object Store (1997)
Systems that store a large number of persistent objects over many sites in a network pose new challenges to storage management. This thesis presents a comprehensive design for collecting garbage...
Collecting Distributed Garbage Cycles by Back Tracing (1997)
Umesh Maheshwari, Barbara Liskov
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-site references as...
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...
Partitioned Garbage Collection of a Large Object Store (1997)
Umesh Maheshwari, Barbara Liskov
We present new techniques for efficient garbage collection in a large persistent object store. The store is divided into partitions that are collected independently using information about...
Partitioned Garbage Collection of a Large Object Store (1997)
Umesh Maheshwari, Barbara Liskov
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. The heap is divided into partitions that are collected...
Charge-Based Proportional Scheduling (1996)
Most priority-based schedulers lack the ability to control the relative execution rates of applications. A recent scheme, called lottery scheduling [WW94], uses randomization to control the execution...
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...
Collecting Cyclic Distributed Garbage by Controlled Migration (1995)
Umesh Maheshwari, Barbara Liskov
Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. A common proposal is...
Collecting Cyclic Distributed Garbage (1995)
This paper presents simple techniques to avoid unnecessary migration. We use a heuristic to detect objects that are highly likely to be cyclic garbage andmigrate only those. Further, we avoid...
Introduction We present a design for electronic whiteboards. Multiple users can open the same board and see the edits made by others in real time. Editing includes printing text and drawing figures....
This paper has presented a simple and effective design for electronic whiteboards. There are two main components in the design:
Collecting Cyclic Distributed Garbage (1995)
This paper presents simple techniques to avoid unnecessary migration. We use a heuristic to detect objects that are highly likely to be cyclic garbage andmigrate only those. Further, we avoid...
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks (1995)
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Maheshwari
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage...
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...
Extensible Operating Systems (1994)
To exploit the high performance afforded by the hardware, applications must be allowed to customize the operating system according to their needs. A pertinent question is: What interface should the...
Fault-Tolerant Distributed Garbage Collection in a Client-Server Object-Oriented Database (1994)
Umesh Maheshwari, Barbara H. Liskov
We present a scalable garbage collection scheme for systems that store objects at multiple servers while clients run transactions on locally cached copies of objects. It is the first scheme that...
References to Remote Mobile Objects in Thor (1994)
Mark Day, Barbara Liskov, Umesh Maheshwari, Andrew C. Myers
Thor is a distributed object-oriented database where objects are stored persistently at highly-available servers called object repositories, or ORs. In a large Thor system, performance tuning and...
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...
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...
References to Remote Mobile Objects in Thor (1993)
Mark Day, Barbara Liskov, Umesh Maheshwari, Andrew C. Myers
Thor is a distributed object-oriented database where objects are stored persistently at highly-available servers called object repositories, or ORs. In a large Thor system, performance tuning and...
References to Remote Mobile Objects in Thor (1993)
Mark Day, Barbara Liskov, Umesh Maheshwari, Andrew C. Myers
Thor is a distributed object-oriented database where objects are stored persistently at highly-available servers called object repositories, or ORs. In a large Thor system, performance tuning and...
Distributed Garbage Collection in a Client-Server, Persistent Object System (1993)
this paper we ignore migration of objects between servers.) The latency of these operations is directly visible to the clients. Therefore, the performance goal is to minimize the overhead added to...
Distributed Garbage Collection in a Client-Server, Transactional, Persistent Object System (1993)
We present a design for distributed garbage collection in a new object-oriented database system called Thor. Garbage collection in Thor is different from that in conventional distributed systems...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.