Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
1999-11-24
2003-01-07
Breene, John E. (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
C711S100000
Reexamination Certificate
active
06505217
ABSTRACT:
COPYRIGHT NOTICE
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to xerographic reproduction by anyone of the patent document or the patent disclosure in exactly the form it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
REFERENCE TO COMPUTER PROGRAM LISTING APPENDIX
A computer program listing appendix in a file entitled “AppendixA.txt” is submitted with this application on two identical compact discs, one being the primary compact disc and the other being a duplicate thereof, the entire material on which being incorporated herein by reference.
BACKGROUND OF THE INVENTION
One of the many uses of computing systems is the creation and management of very large databases of various types of records. Such databases typically include a processing element coupled to a pool of storage devices (“storage volumes”) in the form of disk, tape or even optical storage. And while there may be various processes (e.g., a disk process for storage volumes that are disk) to handle the actual creation of files, it typically has been the user (e.g., application program) who determines the volume on which a file should be created.
Unfortunately, for larger systems, there can often be many users creating files on the available volumes. This, in turn, can result in problems trying to determine on which storage volume the file should be created on. Often, a file will be created on a storage volume with insufficient room, and only later will this fact be discovered when the file is attempted to be written. This will produce an error that will require the user to go through the creation process once again.
Accordingly, an efficient and economical file placement method is needed.
SUMMARY OF THE INVENTION
The present invention is a file placement method that monitors the use of storage volumes (e.g. disk storage) maintained in a pool by a processing system to periodically gather from the storage volumes information concerning space availability. When a file is requested to be created by a user, the request is accompanied by certain file requirements or attributes. Those attributes include a specification of the size of the primary and secondary extents of the file and the maximum number of extents that the file will use. The volume storage information is searched to produce a list of those volumes, having characteristics matching specified file requirements of the file to be created. The storage volume most closely (if not exactly) matching those file attributes will be the one selected the least number of times before file creation. The available space for the selected storage volume is decremented by the size of the primary extent of the file to be created, and a value indicative of the least number of times the volume has been selected is incremented.
The search initially attempts to find a storage volume that can accommodate the entire file and having a fragment sufficiently large to store the larger of the primary or secondary extent of the file to be created. If that search is unsuccessful, the subset of storage volumes is then searched for storage volumes having a fragment that is sufficiently large to store the larger of the requested primary or secondary extents and a predetermined minimum number of extents. Should this search fail, additional searches are made in an effort to find a storage volume that can at least minimally accommodate the file.
In a further embodiment, each storage volume is allotted a random value between one and the number of storage volumes available as the “times selected” value. Then, when a storage volume is selected for a file creation, the times selected value is incremented by a number equal to the number of storage volumes.
These features, as well as additional aspects and advantages of the invention, may be had from a reading of the following detailed description of the invention, which should be taken in conjunction with the accompanying drawings.
REFERENCES:
patent: 4310883 (1982-01-01), Clifton et al.
patent: 4415969 (1983-11-01), Bayliss et al.
patent: 4945475 (1990-07-01), Bruffey et al.
patent: 5119291 (1992-06-01), Flannagan et al.
patent: 5778392 (1998-07-01), Stockman et al.
patent: 5832526 (1998-11-01), Schuyler
patent: 6023744 (2000-02-01), Shoroff et al.
patent: 6122362 (2000-09-01), Smith et al.
patent: 6182088 (2001-01-01), Kawakami et al.
“Multi-Spindle File-Placement Algorithm”, IBM Technical Disclosure Bulletine, Feb. 1986, vol. 28, Issue 9, pp. 4153-4155.
Kaushik Susheel R.
Pereira Joseph
Shende Vivek V.
Venkatraman Sitaram
Breene John E.
Compaq Computer Corporation
Oppenheimer Wolff & Donnelly LLP
Pham Khanh
LandOfFree
Method and apparatus for file placement does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for file placement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for file placement will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3021854