1 TRANSPARENT DATA RELOCATION IN HIGHLY AVAILABLE DISTRIBUTED SYSTEMS
Cached
BibTeX
@MISC{Voulgaris_1transparent,
author = {Spyros Voulgaris and Maarten Van Steen and Aline Baggio and Gerco},
title = {1 TRANSPARENT DATA RELOCATION IN HIGHLY AVAILABLE DISTRIBUTED SYSTEMS},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In a distributed system, long-running distributed services are often confronted with changes to the configuration of the underlying hardware. If the service is required to be highly available, the service needs to deal with the problem of adapting to these changes while still providing its service. This problem is increased further if multiple changes can occur concurrently. In this paper, we describe a method that solves this problem by carefully shipping data and forwarding requests to appropriate hosts. Our method specifically enables the distributed service to deal with concurrent changes in a concurrent fashion, thereby promoting the efficiency of the service. 1.
Citations
| 80 | Locating objects in mobile computing - Pitoura, Samaras - 2001 |
| 58 | Online Reconfiguration in Replicated Databases Based on Group Communication - Kemme, Bartoli, et al. |
| 44 | Using attribute-managed storage to achieve QoS - Borowsky, Golding, et al. - 1997 |
| 34 | B.: Integrated Management of Networked Systems - Hegering, Abeck, et al. - 1999 |
| 32 | On Algorithms for Efficient Data Migration - Hall, Hartline, et al. - 2001 |
| 13 | The Placement Optimization Problem: a practical solution to the disk file assignment problem - Wolf - 1989 |
| 11 | Experimental Evaluation of Dynamic Data Allocation Strategies in a Distributed Database With Changing Workloads - Brunstrom, Leutenegger, et al. - 1995 |
