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

Publishing Venue

IBM

Related People

Authors:
Duvall, KE Fisher, DT [+details]

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.