Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.
Karp, Michael Luby, Lyle A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Managing Multiple Mobile Resources
Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.