Average-case competitive ratio for evaluating scheduling algorithms of multi-user cache Academic Article uri icon


  • Abstract. The goal of this paper is to present an efficient realistic metric for evaluating cache scheduling algorithms in multi-user multi-cache environments. In a previous work, the requests sequence was set deliberately by an opponent (offline optimal) algorithm in an extremely unrealistic way, leading to an unlimited competitive ratio and to extremely unreasonable and unrealistic cache management strategies. In this paper, we propose to analyze the performance of cache management in a typical scenario, ie, we consider all …

publication date

  • June 29, 2017