Competitive Paging Algorithms

Details Competitive Paging Algorithms Competitive Paging Algorithms

2002-05-18

arxiv.org/abs/cs/0205038v1

Journal of Algorithms 12:685-699 (1991)

Computer Science

Data Structures and Algorithms

Scientific paper

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k.

Affiliated with

Also associated with

No associations

Rating

Competitive Paging Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Competitive Paging Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Competitive Paging Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599143