|Publication number||US6219767 B1|
|Application number||US 09/139,091|
|Publication date||Apr 17, 2001|
|Filing date||Aug 24, 1998|
|Priority date||Aug 24, 1998|
|Publication number||09139091, 139091, US 6219767 B1, US 6219767B1, US-B1-6219767, US6219767 B1, US6219767B1|
|Inventors||William S. Cadden|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (8), Referenced by (1), Classifications (11), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application contains subject matter which is related to the subject matter of the following applications, each of which is assigned to the same assignee as this application and filed on the same day as this application. Each of the below-listed applications is hereby incorporated herein by reference in its entirety:
“METHOD FOR RECORD-BASED BACKWARD SKIPPING WITHIN PHYSICAL BLOCKS OF DATA,” by William S. Cadden, U.S. Ser. No. 09/139,068, (Docket No. PO9-97-147); and
“RECORD-BASED BACKWARD SKIPPING WITHIN PHYSICAL BLOCKS OF DATA,” by William S. Cadden, U.S. Ser. No. 09/138,710, (Docket No. PO9-98-143).
The present invention relates to mass storage of computer systems. More particularly, the invention relates to backward skipping of logical records of one or more physical blocks of a storage medium.
A wide variety of computer systems employ an ability to write data to and read from a remote storage medium, which can provide a number of system advantages. For example, in a distributed client/server storage environment, the ability to write data to a remote storage medium allows an application program to use hardware that is associated with processors other than the one the application program is running on.
One difficulty in accessing data from a storage medium arises from the difference between blocks which comprise a physical expression of data in the storage medium and records which are a logical expression of the data. Within a given block, there may only comprise a part of a record (herein referred to as a “segment”), an entire record or multiple records. The ability to access storage medium data by moving backward through the blocks of a tape is readily provided because blocks are the physical storage unit on the storage medium, such as a direct access storage device (DASD). If, however, an application program on a computing node coupled to the storage medium wishes to skip access records of the file rather than blocks, there is no convenient technique for accomplishing this. Again, there may be several records per block, or in the case of variable blocked spanned (VBS) format records, a logical record may be spread out over several physical blocks.
Thus, an enhanced approach to skipping through the physical blocks of a storage medium based upon logical records contained therein is desired, and in particular, a capability for skipping backwards using logical records is needed.
Briefly summarized, the invention comprises in one aspect a system for skipping back to a desired logical record within a physical block of a storage medium. The physical block comprises one block of a plurality of physical blocks within the storage medium. The system includes: means for evaluating a current block to determine a number of logical records within the current block; and means for determining whether the desired logical record is within the current block using the number of records int eh current block, and if so, for providing a pointer to the desired logical record for skipping back to the desired logical record.
In still another aspect, a system is provided for skipping back to a desired logical record within a physical block of a storage medium. The physical block comprises one block of a plurality if physical blocks within the storage medium. The system includes a computing unit coupled to the storage medium and having memory for holding a current block read from the storage medium. The computing unit is adapted to determine a number of logical records in the current block, and to determine whether the desired logical record is within the current block using the number of records in the current block. If the desired logical record is within the current block, then the computing unit is further adapted to provide a pointer to the desired logical record for use in skipping back to the desire logical record. Otherwise, a next previous block is retrieved from the storage medium and the computing unit's evaluating and determining processes are repeated. The retrieval of previous blocks from the storage medium continues until the desired logical record is located within a current block under analysis.
To restate, a record-based capability is provided for skipping backward through a file according to its logical record format rather than its physical format. This capability is useful since records are more likely to reflect the organization of the data than physical blocks of the storage medium. For example, if each record contains information about one client of a company, the capability of the present invention can be used to skip backwards through some number of client records. If physical blocks were used rather than records, the process of finding the client information would be more difficult. Another advantage of the capability of the present invention is that when placed into an application interface, the capability frees the calling application program from knowing the physical layout of the records. The invention will work with a number of different record formats, for example, variable, variable blocked, variable blocked spanned, fixed, and fixed blocked. Thus, an application program can call an API function which uses this invention to skip through records of a number of different formats without the application having knowledge of the formats. This frees the application to concentrate on the logical content of the data rather than its physical layout.
The above-described objects, advantages and features of the present invention, as well as others, will be more readily understood from the following detailed description of certain preferred embodiments of the invention, when considered in conjunction with the accompanying drawings in which:
FIG. 1 is a simplified diagram of a data processing system usable with the present invention;
FIG. 2 is a block diagram of one example of a file saved to a storage medium;
FIG. 3 is a block diagram of an array of pointers employed by a computing unit when reading a block of data from the storage medium into the read/write memory of FIG. 1;
FIG. 4 is a diagram of block 5 of FIG. 2 showing creation of the array of pointers to records;
FIG. 5 is a flowchart of one embodiment of a record-based process for skipping back to a desired logical record of a physical block of a storage medium in accordance with the principles of the present invention;
FIG. 6 is a flowchart of one embodiment of the initialization step of FIG. 5;
FIG. 7 is a flowchart of one embodiment of the update array of pointers to records and increment segment_pointer to point to next segment step of FIG. 5;
FIG. 8 is a flowchart of one embodiment of the set current_pointer to desired record for skipping back to step of FIG. 5; and
FIG. 9 is a flowchart of one embodiment of the skip back to previous block and check previous block's records for the desired record step of FIG. 5.
In accordance with the principles of the present invention, a data access capability is provided which enables a computing unit to skip backwards based on logical records within a block of data or among blocks of data. As used herein, a “block” or “block of data” comprises a physical block or unit of storage space within a storage medium associated with the computing node. The “record” is a logical expression of data stored within one or more blocks. In one embodiment, the data access approach of the present invention involves evaluating a current block to determine a number of logical records in the current block, and thereafter, determining whether the desired logical record is within the current block using the number of records within the current block. If the desired logical record is in the current block, then a pointer is provided to that logical record.
One example of a computer environment incorporating and using the record-based backward skipping capability of the present invention is depicted in FIG. 1. As shown, computer environment 100 includes, for instance, a computing unit 110 having at least one central processing unit 112 and read/write memory 115. As is known, central processing unit 112 is the controlling center of computing unit 110 and provides the sequencing and processing facilities for instruction execution, interruption action, timing functions, initial program loading and other machine related functions. The central processing unit executes at least one operating system, which as known, is used to control the operation of the computing unit by controlling the execution of other programs, controlling communication with peripheral devices and controlling use of the computer resources.
Central processing unit 112 employs read/write memory 115 for writing data to and reading data from a storage medium 120. Storage medium 120 may comprise any conventional storage media such as a magnetic storage media (e.g., tape or disk), or direct access storage device, etc. In one example, computer environment 100 is a single system environment, which includes an RS/6000 computer system running an AIX operating system. (RS/6000 and AIX are offered by International Business Machines Corporation). However, the invention is not limited to such an environment. The capabilities of the present invention can be incorporated and used within many types of computer environments and many types of computer systems. For instance, computer environment 100 can include a UNIX workstation running a UNIXbased operating system. Other variations are also possible and considered a part of the claimed invention.
For instance, in another embodiment, the computing unit could comprise a PS/2 offered by International Business Machines Corporation. In a further embodiment, the computing unit could be based upon the Enterprise Systems Architecture offered by International Business Machines Corporation. Further, the operating system need not be UNIX-based or AIX-based. For example, the operating system can include the Multiple Virtual Storage (MVS) operating system offered by International Business Machines Corporation.
In yet a further embodiment, the environment can comprise a large parallel system with a plurality of computing units (for example, 512 nodes) coupled to one another and to the storage device via a network connection, such as a switch. Additionally, in other environments, the units can be of differing types connected to one another via one or more connections. The invention is not limited to a particular number of units coupled together nor to the type of units that are coupled. To restate, a computing unit can include other types of nodes, computers, processors, systems, workstations, and/or environments without departing from the spirit of the present invention.
By way of further explanation of the environment, many storage access methods allow a user application to skip forward and backward by physical blocks of data on the storage medium. This blockbased function is provided for files because blocks are the physical storage unit on a typical storage medium, such as a tape. By way of example, skipping forward and backward through blocks of a tape are capabilities documented in an International Business Machines Corporation publication entitled “IBM Network Tape Access and Control System for AIX and IBM NetTape Tape Library Connections User's Guide and Reference”, NetTape User Guide, Release 1.1, Fourth Edition (August, 1996), and an International Business Machines Corporation publication entitled “IBM Network Tape Access and Control System for AIX and IBM NetTape Tape Library Connections User's Guide and Reference”, NetTape User Guide, Release 1.2, Fifth Edition (August, 1997), the entirety of both of which are hereby incorporated herein by reference. In both these publications, a function call (“ctpskpr”) is provided to skip forward or backward some number of physical blocks in a tape file.
Existing algorithms are thus useful for skipping backwards based on physical blocks of a storage medium, but are generally unable to do record-based backward skipping. As shown in FIG. 2, there may be several logical records per physical block, only one record per block, or only a segment of a record for an entire physical block. For example, record 6 is shown to have a first segment in block 2, a middle segment in block 3, another middle segment in block 4, and a last segment in block 5.
Access methods exist which read logical records from blocks while moving in a forward direction, so skipping forward is relatively straightforward. In order to implement a record-based forward skip, all that needs to be done is to read forward, ignoring records until the required number of records has been skipped. Skipping backwards, however, is not so trivial. Described hereinbelow is a technique in accordance with the present invention for skipping backward through the blocks of a file, understanding the records that are within each block, until the required number of logical records has been skipped, thereby providing a record-based backward skip.
In one implementation of the backward skipping capability of the present invention, an array of pointers to records is used for a current block under analysis. FIG. 3 depicts such an array wherein each element (or slot) of the array of pointers points to the beginning address of a different record in the current block of data, which, for example, has been read from the main storage medium into local memory within the computing unit. A first slot in the array of pointers points to the beginning of record 1, a second slot to the beginning of record 2, a third slot to the beginning of record 3 and a fourth slot to the beginning of record 4. In this example, a current pointer is shown to record 5.
The array of pointers needs to be large enough to accommodate the maximum number of logical records in the block. If a block comprises 32 kilobytes of data, and each record needs to be at least 4 bytes long, then the array of pointers to records needs to be able to handle up to 8 kilobytes of records. As described further below, the array of pointers is assembled by traversing segments from the beginning to the end of a block. As the start of each record in the block is located, the array of pointers to records is updated with a pointer to that record.
Once assembled, the record-based skipping capability of the present invention employs the array of pointers to records to accomplish the backwards skip. For example, each current block is searched and the array of pointers is set up to point to the various records in that block. If the record being skipped back to is within the current block, its address is directly indexed within the array of pointers. By way of example, if the current record is record 5 of FIG. 3, and it is desired to skip two records backwards so that processing accesses record 3, the address of record 3 is directly available from the array of pointers to records. Note that special care needs to be taken when dealing with segments of VBS records. As shown in FIG. 4, only the segments which start a record are pointed to. Even though the last part of record 6 is within block 5, the segment is not treated as a record.
If the record being skipped back to is not within the current block, preceding blocks in the storage medium must be read until the correct block is found. For example, assume that record 7 of FIG. 2 is the current record and it is desired to skip back three records. To accomplish this, blocks 4, 3, 2 and 1 will be checked (pursuant to the present invention) before record 4 is found and an address is identified which may be used for the backwards skip from record 7.
FIG. 5 depicts one embodiment of skip backwards processing in accordance with the present invention. Processing begins by initializing for the backward skip 200. One embodiment of this initialization process is depicted in FIG. 6. After calling for initialization 200, processing allocates an array of pointers to records for the current block read from the storage medium 300. Again, this array must be as large as the maximum number of logical records within a single physical block of storage. As one example, the array of pointers to records is allocated in memory within the computing unit. Next, a current block is loaded into the read/write memory of the computing unit 310, and a variable “current_pointer” is set to point to a current record in the current block 320. Skipping backward occurs from the record pointed to by current_pointer.
Next, a “segment_pointer” is defined to point to the first record or segment in the current block read from the storage medium 330. This segment_pointer is employed to loop through the block and count the records before the current pointer. A “number_of_records” variable, which is a count of how many records are in the current block, is initialized to zero 340, and finally, a “number_left_to_skip” variable is initialized with the number of records to skip backwards over 350. For example, if the current record is record 7, and the desired record is record 4, then the number_left_to_skip is 3. Note although blocks are read backwards from the storage medium from a current block to a next previous block, processing within a block is forward from a beginning segment to an ending segment of the block. This forward processing of segments within the blocks, which allows pointers to each record to be assigned, is a limitation imposed by the physical layout of the block itself, i.e., processing necessarily starts at the beginning of a block and moves forward within the current block. After setting the number_left_to_skip variable, processing returns to the main flow of FIG. 5.
As shown in FIG. 5, after initialization processing determines whether the number_left_to_skip variable is greater than zero 210. If “no”, then processing is complete and the current_pointer points to the record that has been skipped back to 220. Assuming that more records remain to be skipped over, then processing determines whether the segment pointer is less than the current_pointer 230. If “yes”, the array of pointers to records is updated and the segment_pointer is incremented to point to the next segment in the current block 240. FIG. 7 depicts one example of this processing.
As shown in FIG. 7, processing to update the array of pointers to records and increment the segment_pointer to point to next segment 240 initially determines whether the segment_pointer is pointing to the beginning of a record 400. If “no”, then the segment_pointer is pointing to a segment, and since only records receive pointers in the array of pointers, no action needs to be taken other than incrementing the segment_pointer to point to the next segment 430. Thereafter, processing returns to the point of call of FIG. 5440.
If segment_pointer is pointing to the beginning of a record, then processing sets the next element in the array of pointers to records to point to the segment_pointer position 410, and increments the number_of_records by 1 420. Note that by incrementing the number_of_records with assignment of the pointer, processing is counting the number of logical records in the current block as the segment pointer moves through the block. Next, the segment_pointer is moved to 1 byte past the end of the current segment or record 430. This sets the segment_pointer to point to the beginning of the next record or segment, or in the case of the end of the block, to 1 byte past the end of the block. After updating the segment_pointer, processing returns to point of call in FIG. 5440.
Continuing with FIG. 5, if the segment_pointer is not less than the current_pointer, then processing inquires whether the number_of_records is greater than or equal to the number_left_to_skip variable 250. If “yes”, then the desired record is within the current block, the index to the desired record is found and the current_pointer is set to that index 260. FIG. 8 depicts one embodiment of this processing. Upon calling this routine 260, a number for new_current_record is calculated as the number_of_records minus the number_left_to_skip 500. For example, referring to FIG. 3, if current_pointer is pointing to record 5 and the desired record is record 3, the number_left_to_skip is 2 and the new_current_record is calculated as 5−2=3. Thereafter, the current_pointer is set to the pointer within the array of pointers to records that is at the index of the new_current_record 510, which sets the current pointer to the desired record to be skipped back to, thereby completing the skip back process. Finally, the number_left_to_skip is reset to zero 520 and processing returns to the point of call of FIG. 5530. Referring to FIG. 5, from routine 260 processing returns to inquiry 210 and ascertains that the number_left_to_skip is not greater than zero, (i.e., equals zero) and therefore the skip back process is complete 220.
Continuing with FIG. 5, if the number_of_records is not greater than or equal to the number_left_to skip 250, then the skip back process requires access to at least one previous block for the checking of that block's records 270. One embodiment of this process is presented in FIG. 9.
As shown, processing 270 begins by setting the number_left_to_skip equal to the number_left_to_skip minus the number_of_records 600. Since the records in the current block are being skipped over, those records are subtracted from the number_left_to_skip variable before reading another block for analysis. Again, processing at this point means the desired record is not within the current block being examined. Therefore, skip back to a previous block is required along with further processing within the loop of FIG. 5.
After adjusting the number_left_to_skip, processing of FIG. 9 reads a previous block from the storage medium and assigns that previous block to be the new current block 610. The current_pointer is then set to 1 byte past the end of the new current block. This pointer will be employed as processing loops through the block as a reference to the end of the block. The segment_pointer is then set to point to the first record or segment within the new current block 630 and the number_of_records is reset to zero 640. Again, the segment_pointer is employed to count the number of records in the new current block as discussed above. The array of pointers to records is then reset for filling from the beginning of the new current block when the main loop is next traversed 650. Processing finally returns to point of call in FIG. 5660. After initializing the new current block, processing loops back to inquiry 210 for traversal of the new current block as described above. This process of retrieving previous blocks of data from the storage medium is repeated until the block of data containing the desired logical record is obtained.
The present invention can be included in an article of manufacture (e.g., one or more computer program products) having, for instance, computer usable media. The media has embodied therein, for instance, computer readable program code means for providing and facilitating the capabilities of the present invention. The article of manufacture can be included as part of a computer system or sold separately.
The flow diagrams depicted herein are exemplary. There may be other variations to these diagrams or the steps (or operations described herein) without departing from the spirit of the invention. For instance, the steps may be performed in differing order, or steps may be added, deleted, or modified. All these variations are considered a part of the claimed invention.
Although preferred embodiments have been depicted and described in detail herein, it will be apparent to those skilled in the art that various modifications, additions, substitutions and the like can be made without departing from the spirit of the invention and these are therefore considered to be within the scope of the invention as defined in the following claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US3585601||Aug 19, 1969||Jun 15, 1971||Kaiser Aluminium Chem Corp||Remote input management system|
|US4228471||Dec 4, 1978||Oct 14, 1980||Victor Company Of Japan, Limited||Apparatus for searching a piece of information recorded on a magnetic tape|
|US4811131||Sep 17, 1987||Mar 7, 1989||Dictaphone Corporation||Method and apparatus for scanning and recovering information from a record medium|
|US5101494 *||Mar 15, 1990||Mar 31, 1992||Bull Hn Information Systems Inc.||System for producing memory maps by interpreting a descriptor file which identifies and describes the data structures present in memory|
|US5287478 *||Aug 6, 1991||Feb 15, 1994||R-Byte, Inc.||Digital data tape storage system utilizing plurality of read/write heads with system diagnostic capability|
|US5442390||Jul 7, 1993||Aug 15, 1995||Digital Equipment Corporation||Video on demand with memory accessing and or like functions|
|US5829004 *||May 20, 1996||Oct 27, 1998||Au; Lawrence||Device for storage and retrieval of compact contiguous tree index records|
|JPS5712407A||Title not available|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|WO2009112964A1 *||Feb 27, 2009||Sep 17, 2009||Nxp B.V.||Method and apparatus for locating information on storage media|
|U.S. Classification||711/154, 711/111, G9B/27.019, G9B/27.02|
|Cooperative Classification||G11B27/107, G11B2220/20, G11B2220/90, G11B27/105|
|European Classification||G11B27/10A2, G11B27/10A1|
|Aug 24, 1998||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CADDEN, WILLIAM S.;REEL/FRAME:009412/0689
Effective date: 19980821
|Oct 22, 1998||AS||Assignment|
Owner name: GENENTECH, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ADAMS, CAMELLIA W.;CARTER, PAUL J.;FENDLY, BRIAN M.;AND OTHERS;REEL/FRAME:009543/0469;SIGNING DATES FROM 19981012 TO 19981018
|Sep 22, 2004||FPAY||Fee payment|
Year of fee payment: 4
|Oct 27, 2008||REMI||Maintenance fee reminder mailed|
|Apr 17, 2009||LAPS||Lapse for failure to pay maintenance fees|
|Jun 9, 2009||FP||Expired due to failure to pay maintenance fee|
Effective date: 20090417