Competitive distributed file allocation
- 1 August 2003
- journal article
- Published by Elsevier in Information and Computation
- Vol. 185 (1) , 1-40
- https://doi.org/10.1016/s0890-5401(03)00055-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Sparse partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On-line distributed data managementPublished by Springer Nature ,1994
- On-line Steiner trees in the Euclidean planePublished by Association for Computing Machinery (ACM) ,1992
- Competitive algorithms for distributed data management (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- Concurrent online tracking of mobile usersACM SIGCOMM Computer Communication Review, 1991
- On the power of randomization in online algorithmsPublished by Association for Computing Machinery (ACM) ,1990
- Competitive snoopy cachingAlgorithmica, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- Comparative Models of the File Assignment ProblemACM Computing Surveys, 1982