A demand based algorithm for rapid updating of replicas
| Autor: | L. Navarro-Moldes, J. Acosta-Elias |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors, Universitat Politècnica de Catalunya. DSG - Distributed Systems Group |
| Jazyk: | angličtina |
| Rok vydání: | 2002 |
| Předmět: |
Consistency algorithms
Weak consistency business.industry Computer science Distributed computing Strong consistency Eventual consistency Replication Scale (descriptive set theory) Distributed systems Replication (computing) Informàtica::Arquitectura de computadors::Arquitectures distribuides [Àrees temàtiques de la UPC] Data integrity The Internet Sistemes distribuïts business Algorithm Internet scale replicatited systems |
| Zdroj: | ICDCS Workshops UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| Popis: | In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits that can be obtained by prioritizing replicas with greater demand, and considerable improvements have been achieved. In zones of higher demand, the consistent state is reached up to six times quicker than with a normal weak consistency algorithm, without incurring the additional costs of the strong consistency. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|