Skip to Main Content
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.