|
Descripción
|
|
|---|---|
| Large-scale applications are ever-increasingly geo-distributed. Maintaining the highest possible data locality is crucial to ensure high performance of such applications. Dynamic replication addresses this problem by dynamically creating replicas of frequently accessed data close to the clients. This data is often stored in decentralized storage systems such as Dynamo or Voldemort, which offer support for mutable data. However, existing approaches to dynamic replication for such mutable data remain centralized, thus incompatible with these systems. In this paper we introduce a write-enabled dynamic replication scheme that leverages the decentralized architecture of such storage systems. We propose an algorithm enabling clients to locate tentatively the closest data replica without prior request to any metadata node. Largescale experiments on various workloads show a read latency decrease of up to 42% compared to other state-of-the-art, caching-based solutions. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Future Generation Computer Systems-the International Journal of Escience |
|
ISSN
|
0167-739X |
|
Factor de impacto JCR
|
3,997 |
|
Información de impacto
|
|
|
Volumen
|
|
|
DOI
|
|
|
Número de revista
|
|
|
Desde la página
|
1 |
|
Hasta la página
|
13 |
|
Mes
|
SIN MES |
|
Ranking
|
|