An algorithm for dynamic data distribution
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper we propose a practical algorithm,called Dynamic-Data-Allocation (DDA), that changesthe replication scheme of an object (i.e. the processorswhich store a replica of the object) dynamicallyas the read-write pattern of the object changes in thenetwork. We assume that the changes in the readwritepattern are not known a priori.The algorithm DDA is based on the primary copymethod, it preserves 1-copy-serializability, and it isdistributed in the sense that the decision on whether...Keywords
This publication has 10 references indexed in Scilit:
- The case for controlled inconsistency in replicated dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Distributed algorithms for dynamic replication of dataPublished by Association for Computing Machinery (ACM) ,1992
- Bounded ignorance in replicated systemsPublished by Association for Computing Machinery (ACM) ,1991
- The multicast policy and its relationship to replicated data placementACM Transactions on Database Systems, 1991
- Data caching issues in an information retrieval systemACM Transactions on Database Systems, 1990
- A technique for constructing highly available servicesAlgorithmica, 1988
- Competitive snoopy cachingAlgorithmica, 1988
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Comparative Models of the File Assignment ProblemACM Computing Surveys, 1982