Master of Science (MS)
First Committee Member
Wolfgang W. Bein
Number of Pages
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.
Computer; Line; Management; Memory; Paging; Trackless
Computer science; Mathematics
University of Nevada, Las Vegas
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 firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Mikhalkov, Edward Benjamin, "Trackless on-line paging and computer memory management" (2000). UNLV Retrospective Theses & Dissertations. 1151.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/