Stable and fault-tolerant object allocation

Authors:
Gregory Johnson;Ambuj K. Singh
Affiliations:
Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA;Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA
Venue:
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Year:
2000

Citing 5
Cited 5

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for distributed data management (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed file allocation

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
Reliable distributed objects: reasoning, analysis, and implementation

Reliable distributed objects: reasoning, analysis, and implementation

Web-Based System Configuration and Performance Evaluation Using a Knowledge-Based Methodology

EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
Flexible on-device service object replication with replets

Proceedings of the 13th international conference on World Wide Web
An object replication algorithm for real-time distributed databases

Distributed and Parallel Databases
Practically Realizable Efficient Data Allocation and Replication Strategies for Distributed Databases with Buffer Constraints

IEEE Transactions on Parallel and Distributed Systems
A dynamic object allocation and replication algorithm for distributed systems with centralized control

International Journal of Computers and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Support for efficient dynamic migration and replication of objects is essential for achieving adequate performance and scalability. Traditional solutions to the problem focused on competitiveness. This means that the algorithm's complexity matches the offline adversary's complexity within an acceptable ratio. We define and study the allocation problem under two new measures: stability and fault tolerance. Stability considers the performance of an object allocation algorithm when the object access patterns at the individual nodes of a distributed system stabilize. We present a new algorithm for uniform networks based on the idea of sliding windows. Besides being optimally competitive, the algorithm also exhibits good stability. For fault-tolerance, we consider the performance of allocation algorithms when at least t copies need to be maintained. We derive a lower bound on the competitiveness of such algorithms. Finally, we modify our earlier solution so that it is also optimally fault-tolerant.