By Topic

On-line Measurement of Paging Behavior by the Multivalued MIN Algorithm

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
$31 $31
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)
Belady, L.A. ; IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598, USA ; Palermo, F.P.

An algorithm is presented that extracts the sequence of minimum memory capacities (MMCs) from the sequence of page references generated by a program as it is executed in a demand paging environment. The new algorithm combines the advantages of existing approaches in that the MMC's are produced in a single pass, as is the output of the MIN algorithm for a single memory size, and the MMC sequence is identical to the optimum stack distances provided by the OPT algorithm, which requires two passes. A hardware implementation is outlined as an extension to existing page management mechanisms. The resulting device could be used to produce continuously the MMC information, while the (paging) machine executes the program at essentially full speed. The paper also discusses the possible impact of the algorithm on the study of program behavior and on the development of space sharing (paging) algorithms. Finally, a proof is provided that the algorithm in fact produces an output identical to that of OPT.

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:18 ,  Issue: 1 )