Distributed paging
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 97-117
- https://doi.org/10.1007/bfb0029566
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Probabilistic approximation of metric spaces and its algorithmic applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sparse partitionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Competitive access time via dynamic storage rearrangementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Page migration with limited local memory capacityLecture Notes in Computer Science, 1995
- New on-line algorithms for the page replication problemLecture Notes in Computer Science, 1994
- Competitive distributed file allocationPublished by Association for Computing Machinery (ACM) ,1993
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- Dynamic file migration in distributed computer systemsCommunications of the ACM, 1990
- Competitive snoopy cachingAlgorithmica, 1988
- Comparative Models of the File Assignment ProblemACM Computing Surveys, 1982