z-logo
open-access-imgOpen Access
Efficient methods for calculating the success function of fixed-space replacement policies
Author(s) -
F. Olken
Publication year - 1981
Language(s) - English
Resource type - Reports
DOI - 10.2172/6051879
Subject(s) - cache , bounded function , computer science , function (biology) , cache algorithms , cpu cache , variable (mathematics) , algorithm , parallel computing , mathematics , evolutionary biology , biology , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here