• DocumentCode
    2367142
  • Title

    Heat and Dump: competitive distributed paging

  • Author

    Awerbuch, Baruch ; Bartal, Yair ; Fiat, Amos

  • Author_Institution
    Lab. for Comput. Sci., MIT, Cambridge, MA, USA
  • fYear
    1993
  • fDate
    3-5 Nov 1993
  • Firstpage
    22
  • Lastpage
    31
  • 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
  • Keywords
    paged storage; Heat and Dump; competitive distributed paging; total storage capacity; Algorithm design and analysis; Computer science; Contracts; Cost function; Electronic mail; File servers; Memory management; Phase change random access memory; Programming profession; Runtime;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
  • Conference_Location
    Palo Alto, CA
  • Print_ISBN
    0-8186-4370-6
  • Type

    conf

  • DOI
    10.1109/SFCS.1993.366885
  • Filename
    366885
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2367142