Abstract
The classical online paging problem mathematically abstracts memory management systems. Early worst-case results for paging algorithms leave a significant gap to practical experience: Many “reasonable” algorithms, such as Least Recently Used, are empirically superior to “intuitively inferior” ones, like First-In First-Out or Flush When Full. But they have identical theoretical worst-case performance guarantees. Moreover, these guarantees do not adequately reflect empirical evidence. To overcome this unsatisfying situation, many adversarial models intended to reflect the “typical” situation have been proposed. This article surveys the most prominent of them.
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.
