A competitive dynamic data replication algorithm
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The case for controlled inconsistency in replicated dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive paging algorithmsJournal of Algorithms, 1991
- 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
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- Comparative Models of the File Assignment ProblemACM Computing Surveys, 1982