Abstract
In response to a sequence of requests for files, where each file has a specified size and retrieval cost, the total size of each file in cache was maintained at some specified k so as to minimize the total retrieval cost. A simple deterministic on-line algorithm was proposed. In this algorithm, many well-known paging and weighted caching strategies were generalized, and the retrieval cost was either insignificant or at most a constant (independent of k) times the optimum value for most k. This helps explain why competition ratios of many on-line paging algorithms have been typically observed to be constant in practice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
