However if we assume LRU replacement we can compute the maximal priority depth across references in a workload [23]; this is the smallest LRU cache size ...
確定! 回上一頁