Trackless on-line paging and computer memory management
type: CreativeWork
description: We consider existing research methodology for dealing with competitiveness analysis of on-line algorithms as well as introduce some newer analysis techniques for testing research hypotheses. Paging is discussed in general and current algorithms are surveyed and analyzed; We also present a new randomized on-line algorithm for the 2-page cache problem that matches the lower bound, and, therefore, is optimal. The algorithm uses fewer resources than currently known algorithms for the same problem, and is, therefore, an improvement on existing results. Experimental findings for this new algorithm are also presented and analyzed.
abstract: We consider existing research methodology for dealing with competitiveness analysis of on-line algorithms as well as introduce some newer analysis techniques for testing research hypotheses. Paging is discussed in general and current algorithms are surveyed and analyzed; We also present a new randomized on-line algorithm for the 2-page cache problem that matches the lower bound, and, therefore, is optimal. The algorithm uses fewer resources than currently known algorithms for the same problem, and is, therefore, an improvement on existing results. Experimental findings for this new algorithm are also presented and analyzed.
author: Mikhalkov, Edward Benjamin
language: English
date published: 2000-01-01T08:00:00Z
date modified: 2026-07-24T05:25:11Z
provider: University of Nevada - Las Vegas
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: University of Nevada, Las Vegas

PropertyValue
property ID: DOI
value: 10.25669/tiwg-mp7x