Browse Prior Art Database

Paging Space Size Heuristic

IP.com Disclosure Number: IPCOM000062343D
Original Publication Date: 1986-Nov-01
Included in the Prior Art Database: 2005-Mar-09
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Dodson, FB: AUTHOR [+2]

Abstract

An algorithm is described which calculates the recommended paging space size based on memory size, coupled with the available space across 'n' (e.g., 3) physical disk devices. These devices are weighted, based on a schema of reduction in which the weights are based on the size of each disk, in order of their attachment, since the first disk will normally have a more primary and fundamental functional role in the system. The algorithm utilizes these factors along with the natural log of the values and is expressed as: [ln(HD0)] + [ln(HD1) x.5] + [ln(HD2) * .2]* MS 3/4 where HD = Hard Disk size in megabytes MS = Memory size in megabytes This produces an optimal displayed characteristic default for page space mini-disk size default.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Paging Space Size Heuristic

An algorithm is described which calculates the recommended paging space size based on memory size, coupled with the available space across 'n' (e.g., 3) physical disk devices. These devices are weighted, based on a schema of reduction in which the weights are based on the size of each disk, in order of their attachment, since the first disk will normally have a more primary and fundamental functional role in the system. The algorithm utilizes these factors along with the natural log of the values and is expressed as: [ln(HD0)] + [ln(HD1)
x.5] + [ln(HD2) * .2]* MS 3/4 where HD = Hard Disk size in megabytes MS = Memory size in megabytes This produces an optimal displayed characteristic default for page space mini-disk size default.

1