By Topic

Memory versus randomization in on-line algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. Rajhavan ; IBM Research Division, Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598, USA ; M. Snir

On-line algorithms service sequences of requests, one at a time, without knowing future requests. We compare their performance with the performance of algorithms that generate the sequences and service them as well. In many settings, on-line algorithms perform almost as well as optimal off-line algorithms, by using statistics about previous requests in the sequences. Since remembering such information may be expensive, we consider the use of randomization to eliminate memory. In the process, we devise and study performance measures for randomized on-line algorithms. We develop and analyze memoryless randomized on-line algorithms for the cacheing problem and its generalizations.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:38 ,  Issue: 6 )