Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Allocation Procedures

IP.com Disclosure Number: IPCOM000059918D
Original Publication Date: 1986-Feb-01
Included in the Prior Art Database: 2005-Mar-08
Document File: 2 page(s) / 38K

Publishing Venue

IBM

Related People

Duvall, KE: AUTHOR [+2]

Abstract

Allocation of data sets to data storage volumes is based upon sorting the volume candidates from least-to-most fragmentation levels. Such sorting can include weighting factors. As a result of the sort, the best volumes for a given data set are readily available based upon the lowest risk of allocation failures. The allocation of a data storage volume to a data set is identified firstly by comparing a set of data set parameters with virtual data storage volume parameters. The parameters are matched and sorted in order to establish a list of volume candidates capable of receiving the data sets. The list of candidate volumes is then sorted to generate a sorted list of the candidates from the least-fragmented volumes to the most-fragmented volumes. Various weighting factors can be employed in the sort.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 98% of the total text.

Page 1 of 2

Allocation Procedures

Allocation of data sets to data storage volumes is based upon sorting the volume candidates from least-to-most fragmentation levels. Such sorting can include weighting factors. As a result of the sort, the best volumes for a given data set are readily available based upon the lowest risk of allocation failures. The allocation of a data storage volume to a data set is identified firstly by comparing a set of data set parameters with virtual data storage volume parameters. The parameters are matched and sorted in order to establish a list of volume candidates capable of receiving the data sets. The list of candidate volumes is then sorted to generate a sorted list of the candidates from the least- fragmented volumes to the most-fragmented volumes. Various weighting factors can be employed in the sort. Such weighting factors can be two, three, four or five times the size of the data set, as one example. As the result of the fragmentation sort, the list now identifies those volumes having the least amount of fragmentation, which corresponds to the lowest risk of failure for an allocation of the given data sets. The best volume is selected based not only upon the fragmentation level, but other parameters as indicated in the first step of matching volume parameters to data set parameters. The space in the selected volume is then allocated to the data set. The data set then is stored using usual procedures.

1

Page 2 of 2

2

[This page contains 2 pic...