By Topic

Permutation Clustering: An Approach to On-Line Storage Reorganization

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)
B. T. Bennett ; IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598, USA ; P. A. Franaszek

A class of dynamic reorganization algorithms is described which embodies a number of desirable systems properties. Experiments on a trace taken from a large data base application indicate that a member of this class may be used to obtain time-varying or quasistatic organizations that exhibit improved paging performance.

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:21 ,  Issue: 6 )