Award Date
1-1-2000
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science
First Committee Member
Wolfgang W. Bein
Number of Pages
102
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.
Keywords
Computer; Line; Management; Memory; Paging; Trackless
Controlled Subject
Computer science; Mathematics
File Format
File Size
2119.68 KB
Degree Grantor
University of Nevada, Las Vegas
Language
English
Permissions
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to digitalscholarship@unlv.edu and include clear identification of the work, preferably with URL.
Repository Citation
Mikhalkov, Edward Benjamin, "Trackless on-line paging and computer memory management" (2000). UNLV Retrospective Theses & Dissertations. 1151.
http://dx.doi.org/10.25669/tiwg-mp7x
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/
