Abstract
Every cache must utilize a mechanism to free some of its storage once it becomes full. The goal of this paper is to compare the performance of several cache replacement algorithms which we have collected or devised ourselves. In addition, we discuss the benefit of users sharing a cache over dividng the same disk space into private storages.
full text (postscript file)