Title :
On optimal replacement of nonuniform cache objects
Author :
Hosseini-Khayat, Saied
Author_Institution :
Dept. of Electr. Eng., Ferdowski Univ. of Mashad, Iran
fDate :
8/1/2000 12:00:00 AM
Abstract :
This paper studies a generalized version of the well-known page replacement problem. It assumes that page sizes and page fault penalties are nonuniform. This problem arises in distributed information systems, in particular the World Wide Web. It is shown that finding an optimal solution of this problem is an NP-complete problem. A dynamic programming algorithm that finds an optimal solution is presented. Since this algorithm is inefficient, we explore modified algorithms that allow a trade-off between optimality and speed
Keywords :
computational complexity; dynamic programming; information resources; paged storage; NP-complete problem; World Wide Web; distributed information systems; dynamic programming; nonuniform cache objects; optimal replacement; page fault penalties; page replacement problem; page sizes; Computer applications; Cost function; Distributed information systems; Dynamic programming; Heuristic algorithms; Large-scale systems; NP-complete problem; Web server; Web sites; Yarn;
Journal_Title :
Computers, IEEE Transactions on
