Heat and Dump: competitive distributed paging

  • Authors:

  • B. Awerbuch;Y. Bartal;A. Fiat

  • Affiliations:

  • Lab. for Comput. Sci., MIT, Cambridge, MA, USA;-;-

  • Venue:
  • SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper gives a randomized competitive distributed paging algorithm called Heat and Dump, The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio.