US 6,587,919 B2Grant
System and method for disk mapping and data retrieval
Issue Date:2003-07-01
•42 Claims
•6 Drawing Sheets
Abstract
A data storage system includes data storage and a record locator data structure in random access memory. The record locator data structure includes entries having different lengths. For locating variable-length data records in the data storage, for example, at least some but not all of the entries have a data-length portion indicating data length of a respective data record of the entry when the data length of the respective data record fails to match an expected data length. Each entry, for example, has a fixed length portion including an indication of whether or not the entry has a data-length portion, the fixed length portions are stored sequentially in a first region of address locations of the random access memory, and the data-length portions are stored sequentially in a second region of address locations of the random access memory.
Metadata
Assignee
- EMC Corporation
Inventors
- Moshe Yanai
- Natan Vishlitzky
- Bruno Alterescu
- Daniel Castel
Application Information
Application Number:US 10/100,760
Filing Date:2002-03-19
Priority Date:1990-09-24
Art Unit:7
Classifications
IPC:
G06F 1200
Field of Search:
711112710 68
Patent Drawings (6 sheets)
Description
Related Applications
[0002] This application is a divisional of U.S. patent application Ser. No. 09/711,212 filed Nov. 9, 2000 (U.S. Pat. No. 6,418,509 issued Jul. 9, 2002), which is a divisional of U.S. Ser. No. 09/305,127 filed May 4, 1999 (U.S. Pat. No. 6,185,653 issued Feb. 6, 2001), which is a continuation of application Ser. No. 08/851,701 filed May 6, 1997 (U.S. Pat. No. 5,909,692 issued Jun. 1, 1999), which is a continuation of application Ser. No. 08/665,607, filed Jun. 18, 1996 (U.S. Pat. No. 5,664,144 issued Sep. 2, 1997) which is a divisional of U.S. patent application Ser. No. 08/052,039 filed Apr. 23, 1993, entitled REMOTE DATA MIRRORING (U.S. Pat. No. 5,544,347 issued Aug. 6, 1996), which is a continuation-in-part of U.S. patent application Ser. No. 07/586,796 filed Sep. 24, 1990 entitled SYSTEM AND METHOD FOR DISK MAPPING AND DATA RETRIEVAL (U.S. Pat. No. 5,206,939 issued Apr. 27, 1993); Ser. No. 07/587,247 filed Sep. 24, 1990 entitled DYNAMICALLY RECONFIGURABLE DATA STORAGE SYSTEM WITH STORAGE SYSTEM CONTROLLERS SELECTIVELY OPERABLE AS CHANNEL ADAPTERS OR STORAGE DEVICE ADAPTERS (U.S. Pat. No. 5,269,011 issued Dec. 7, 1993) and Ser. No. 07/587,253 filed Sep. 24, 1990 entitled RECONFIGURABLE MULTI-FUNCTION DISK CONTROLLER SELECTIVELY OPERABLE AS AN INPUT CHANNEL ADAPTER AND A DATA STORAGE UNIT ADAPTER (U.S. Pat. No. 5,335,352 issued Aug. 2, 1994).
[0003] The following disclosure in this application is the disclosure in U.S. patent application Ser. No. 07/586,796 as filed on Sep. 24, 1990 and entitled SYSTEM AND METHOD FOR DISK MAPPING AND DATA RETRIEVAL (U.S. Pat. No. 5,206,939 issued Apr. 27, 1993), which is fully incorporated herein by reference.
Field of the Invention
[0004] This invention relates to data storage on disk drives and more particularly, to a method and apparatus for retrieving data records stored on a storage medium utilizing a data record locator index stored in memory.
Background of the Invention
[0005] Large disk storage systems like the 3380 and 3390 direct access storage devices (DASD) systems employed with many IBM mainframe computer systems are implemented utilizing many disk drives. These disk drives are specially made to implement a count, key, and data (CKD) record format on the disk drives. Disk drives utilizing the CKD format have a special “address mark” on each track signifying the beginning of a record on the track. After the address mark comes the three part record beginning with the “COUNT” which serves as the record ID and also indicates the lengths of both the optional key and the data portions of the record, followed by the optional “KEY” portion, which in turn is followed by the “DATA” portion of the record.
[0006] Although this format gives the system and user some flexibility and freedom in the usage of the disk drive, this flexibility forces the user to use more complicated computer programs for handling and searching data on the disk. Since the disk drive track has no physical position indicator, the disk drive controller has no idea of the data which is positioned under the read/write head at any given instant in time. Thus, before data can be read from or written to the disk drive, a search for the record must be performed by sequentially reading all the record ID's contained in the count field of all the records on a track until a match is found. In such a search, each record is sequentially searched until a matching ID is found. Even if cache memory is used, all the records to be searched must first be read into the cache before being searched. Since searching for the record takes much longer than actual data transfer, the disk storage system spends a tremendous amount of time searching for data which drastically reduces system performance.
[0007] Disk drives employing what is known as a Fixed Block Architecture (FBA) are widely available in small, high capacity packages. These drives, by virtue of their architecture, tend to be of higher performance than drives employing a CKD format. Such FBA drives are available, for example, from Fujitsu as 5.25″ drives with 1 gigabyte or greater capacity.
[0008] The distinct advantage of utilizing many small disk drives is the ability to form a disk array. Thus a large storage capacity can be provided in a reduced amount of space, and storage redundancy can be provided in a cost effective manner. A serious problem arises, however, when trying to do a “simple” conversion of data from CKD formatted disks to FBA disks. Two schemes for such a conversion have been considered which do not provide an acceptable solution to the conversion problem. The first of such schemes involves placing every field i.e. Count, Key and Data, of the CKD formatted record into a separate block on the FBA disk drive. Although this scheme does not waste valuable disk space when CKD formatted records contain large amounts of data, the “Count” field which is very short (8 bytes) occupies an entire block which is typically at least 512 bytes. For example, a CKD formatted record containing 47K bytes of data could be converted to 95 blocks of FBA disk, 512 bytes in length. In such a conversion, one block would be used to store the count of the record while 94 blocks (47K bytes length of data divided by 512 bytes of FBA disk block) would be used to store data, for a total of 95 blocks. However, search time for finding the desired record is still a problem since all the records must be sequentially searched.
[0009] For records having very short data lengths such as eight bytes, however, one full track, or 94 CKD formatted data records would need 188 blocks on the FBA disk: 94 blocks for the count portion of the records and 94 blocks for the data portion of the records, even though each data record may only occupy 8 bytes of a 512 byte FBA block. Such a scheme may thus waste nearly 50% of the disk space on an FBA disk drive.
[0010] The second scheme for converting data from CKD to FBA drives involves starting each CKD record in a separate block and then writing the complete record in sequential blocks. Utilizing such a scheme, the first FBA block will contain the “count” portion of the record as well as the optional key portion and the start of the data portion of the record. This scheme, however, produces serious system performance degradation when data must be written to the disk, since before writing data to the disk, the entire record must first be read into memory, modified, and subsequently written back to the disk drive. Such a loss in system performance is generally unacceptable.
Summary of the Invention
[0011] In accordance with a first aspect, the invention provides a data storage system including data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data records of the logical track include variable-length data records. The data processor is programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains respective entries for data records having data stored in the data storage. At least some but not all of the entries have a data-length portion indicating data length of the data record of the entry when the data length of the record of the entry fails to match an expected data length.
[0012] In accordance with another aspect, the invention provides a data storage system including data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one count-key-data (CKD) record of a logical track of CKD records. The data processor is programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the CKD record. The record locator data structure contains entries for the CKD records having data stored in the data storage. At least some but not all of the entries have a respective record modifier portion when the count of the CKD record of the entry fails to match an expected count.
[0013] In accordance with yet another aspect, the invention provides a data storage system including data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data processor is programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains entries for data records having data stored in the data storage. Each entry includes a fixed-length portion, and at least some but not all of the entries have respective variable-length portions, wherein the fixed-length portion of each entry includes an indication of whether or not the entry includes a variable-length portion.
[0014] In accordance with still another aspect, the invention provides a data storage system including data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data processor is programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains respective entries for data records having data stored in the data storage. Each entry includes a fixed-length portion, and at least some but not all of the entries have respective variable-length portions. The fixed-length portions are stored sequentially in a first region of address locations of the random-access memory, and the variable-length portions are stored sequentially in a second region of address locations of the random-access memory.
[0015] In accordance with another aspect, the invention provides a method of maintaining a record locator data structure in random access memory of a data storage system. The data storage system also has data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data records of the logical track include variable-length data records. The data processor is programmed to access the record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains respective entries for data records having data stored in the data storage. At least some but not all of the entries have a data-length portion indicating data length of the data record of the entry. The method includes updating the record locator data structure to include a new entry for a new data record by establishing an expected data length for the new data record, and comparing the data length of the new data record to the expected data length for the new data record. If the data length of the new data record does not match the expected data length of the new data record, then a data-length portion is stored indicating the data length of the new data record of the new entry. If the data length of the new data record matches the expected data length of the new data record, then such a data-length portion is not stored.
[0016] In accordance with yet another aspect, the invention provides a method of maintaining a record locator data structure in random access memory of a data storage system. The data storage system also has data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one count-key-data (CKD) record of a logical track of CKD records. The data processor is programmed to access the record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the CKD record. The record locator data structure contains entries for the CKD records having data stored in the data storage. At least some but not all of the entries have a respective record modifier portion. The method includes updating the record locator data structure to include a new entry for a new CKD record by establishing an expected count for the new CKD record, and comparing the count of the new CKD record to the expected count for the new CKD record. If the count of the new CKD record does not match the expected count of the new CKD record, then a record modifier portion is stored indicating the count of the new CKD record. If the count of the new CKD record matches the expected count of the new CKD record, then such a record modifier portion is not stored.
[0017] In accordance with still another aspect, the invention provides a method of maintaining a record locator data structure in random access memory of a data storage system. The data storage system also has data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data processor is programmed to access the record locator data structure for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains entries for data records having data stored in the data storage. Each entry includes a fixed-length portion, and at least some but not all of the entries have respective variable-length portions. The method includes updating the record locator data structure to include a new entry for a new data record by determining whether or not to include a variable-length portion in the new entry for the new data record, and setting a value in the fixed-length portion of the new entry indicating whether or not the new entry includes a variable-length portion.
[0018] In accordance with yet still another aspect, the invention provides a method of maintaining a record locator data structure in random access memory of a data storage system. The data storage system also has data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage. Each data storage access request specifies at least one data record of a logical track of data records. The data processor is programmed to access the record locator data structure for locating a data storage area in the data storage allocated for storing data of the data record. The record locator data structure contains respective entries for data records having data stored in the data storage. Each entry includes a fixed-length portion, and at least some but not all of the entries have respective variable-length portions. The method includes updating the record locator data structure to include a new entry for a new data record by determining whether or not the new entry is to have a variable-length portion, and storing a fixed-length portion for the new data record in a next address location in a first region of address locations of the random-access memory. If the new entry is to have a variable-length portion, then the variable-length portion of the new entry is stored in a next address location in a second region of address locations of the random-access memory.
Brief Description of the Drawings
[0019] These, and other features and advantages of the present invention are described below in the following detailed description and accompanying drawings, in which:
[0020] FIG. 1 is a block diagram of a system for disk mapping and data retrieval according to the present invention;
[0021] FIG. 2 is a schematic representation of a CKD formatted data record;
[0022] FIG. 3 is a schematic representation of several blocks from a fixed block disk drive in which has been inserted the CKD formatted data transformed according to the method of the present invention;
[0023] FIG. 4 is a detailed schematic representation of a portion of the data identification and locator table of FIG. 3;
[0024] FIG. 5 is a detailed schematic representation of a portion of the data identification and locator table of FIG. 4;
[0025] FIG. 6 is a flowchart of the method for transforming CKD formatted data into fixed block data including a method for preparing a record identification and locator table; and
[0026] FIG. 7 is a flowchart illustrating the method for compressing the length of the record identification and locator table according to the present invention.
Detailed Description of the Invention
[0027] In accordance with the present invention, the disk storage system 10, FIG. 1, for disk mapping and data retrieval includes one or more means for receiving write commands and data such as channel adapter boards 12a-12d.The channel adapter boards are adapted to receive disk read/write commands and data over a plurality of communication channels such as channels 14 from one or more host computers (not shown) over channels identified respectively as 1-8 in FIG. 1.
[0028] The channel adapter boards 12a-12dare connected to temporary or cache semiconductor memory storage unit 16 by means of bus 18. Bus 18 is also connected to one or more disk adapter boards 20 which read and write data to one or more disk drive units 22.
[0029] Each of the disk drive units 22 may include one or more disk drives, depending upon the user's requirements. Also included in the system is one or more uninterruptable power supply (UPS) 24.
[0030] In operation, one or more channel adapter boards 12a-12dreceive write commands along with the accompanying data over one or more channels 14 from one or more host computers. In the preferred embodiment, the data is received in CKD format. In order to improve system performance, the disk storage system of the present invention does not wait for disk adapters 20 to locate and update the data on the appropriate disk drives but rather, the channel adapter boards store the data in CKD format in temporary semiconductor memory storage unit or cache 16.
[0031] In addition to storing the data that must be written to one or more disk drives 22, channel adapter boards 12a-12dstore in the memory, an indication associated with each data record that must be written to disk, indicating to the disk adapters 20 that the associated data record stored in cache must be written to the disk drives. A more detailed description of a disk storage system with write preservation utilizing a write pending indicator is described in U.S. application Ser. No. 07/586,254 filed concurrently with the present application and incorporated herein by reference. U.S. application Ser. No. 07/586,254 was continued in U.S. application Ser. No. 156,394 filed Nov. 22, 1993, which issued on Aug. 23, 1994 as U.S. Pat. No. 5,341,493.
[0032] In one embodiment, the system and method for disk mapping and data retrieval includes mapping CKD formatted data onto fixed block disk drives. To facilitate understanding of the CKD to FBA data transformation a CKD record 30, FIG. 2 is shown and described below.
[0033] In order for a CKD disk drive to locate the first record on any given track, the disk drive read/write head must search the entire track until it encounters a position indicator called an address mark 32. Following a short gap 34 in the track, the first record 30 begins. The CKD record is divided into three fields or portions: the record identification portion, called the count, 36 followed by another gap, 37; the optional key portion 38; and the data portion 40.
[0034] The count portion of the data record uniquely identifies this record. The count is the portion of the record that a host system requesting access to a given record presents to the disk drive in order to enable the disk drive to search for and locate the record.
[0035] The count is comprised of 8 bytes of information. Bytes 0 and 1, as shown at 42, are used to designate the length of the data, while the third byte, 44, designates the length of the optional key field. The fourth byte 46, designates the record number on the track. The fifth and sixth bytes 48, and the seventh and eighth bytes 50, designate the head and cylinder numbers respectively, at which the record is located on the device. The second record 52, is located immediately following the end of the data portion 40 of the first record 30.
[0036] Thus, in accordance with the present invention, a portion of an FBA disk having CKD formatted data stored thereon is shown in FIG. 3 and includes record identification and locator table 58 including the 5 blocks labeled 60a-60e,for the tracks of the previous cylinder which is organized as described below.
[0037] The first data record 61 of the next CKD cylinder being emulated and located on the FBA drive begins in block 62. If the data portion of the record is longer than the length of the second block 62, the data portion of the first record will be continued in the next block 64, and subsequent blocks as necessary to store the data portion of the first record. If the length of the first record 61 is equal to or smaller than block 62, any remaining unused portion of block 62 will not be used and instead, the data portion of record 2, 63, will begin in FBA disk drive block 64. This process will repeat itself until all of the blocks of a given cylinder being emulated have been copied. Thus, because the data portion of every record begins at the beginning of a block, (i.e. there is never more than one data record per block), once the system computes the address or block in which a requested data record resides, immediate access is possible with little or no disk drive search time. Utilizing the record identification and locator table of the present invention, the system is able to compute the number of fixed length blocks that must be read to retrieve all the data of a given record, as illustrated herein below. Each record identification and locator table is subsequently loaded into the system memory to facilitate and greatly reduce data record searching and data retrieval time.
[0038] Shown in greater detail in FIG. 4, is a data record and identification table 70 according to the present invention for one device such as one disk drive including multiple cylinders. Each cylinder being emulated includes such a table on the drive itself, as well as a corresponding copy in the semiconductor cache memory.
[0039] Each device record identification and locator table includes a header portion 72 followed by one or more cylinder portions 74-78. In turn, each cylinder portion is comprised of a plurality of track portions 80.
[0040] Device header portion 72 of the record locator and identification table includes such information as shown in Table 1 below, including the length of the header, line 1; the starting address of the device scratch memory address, line 2; and the length of the device header including the scratch area, line 3. The header also includes one or more bytes for device flags, line 4.
| TABLE 1 |
|---|
| DEVICE ID TABLE HEADER BUFFER AND FLAG OFFSETS |
[0041] Such flags include a write pending flag which is set if one or more records on the device are temporarily stored in cache memory awaiting writing and storing to the disk drive, as well as an in-cache bit indicating that at least one record on the device is located in cache memory to speed up access to the record, line 4. Other bytes of the device header provide various informational, operational, or statistical data to the system.
[0042] For example, the write pending group flags shown at line 11 include one bit indicating a write pending on any one record on any of the 64 preselected consecutive cylinders comprising a cylinder group. Similarly, each cylinder has a write pending flag bit in the device header as shown at line 10. The various write pending flags form a “pyramid” or hierarchy of write pending flags which the system may search when no access to records stored on disks is requested for handling write pending requests. Such a hierarchy structure allows the system to inquire level by level within the structure whether any records on the device; any records within a group of cylinders; any records on a given cylinder; any records on a track; and record by record, whether any write pending flags are set or whether any records are located in cache memory. Such information is useful when processing data such as writing data to disk after a power failure as more fully described in U.S. application Ser. No. 07/586,254 filed concurrently herewith and incorporated herein by reference. U.S. application Ser. No. 07/586,254 was continued in U.S. application Ser. No. 156,394 filed Nov. 22, 1993, which issued on Aug. 23, 1994 as U.S. Pat. No. 5,341,493. The “last track” header is a header of a fictitious or non-existent track and serves to indicate that the record locator table was itself modified and must also be written to disk.
[0043] A more detailed description of the cylinder header portions 82a-82cof the device record identification and locator table 70 of FIG. 4 is shown in Table 2 wherein any given cylinder header includes such information as the length of the cylinder header, line 1; cylinder write pending flags, line 4; the physical address of the cylinder line 6; and the CRC error check byte of the cylinder, line 7.
| TABLE 2 |
|---|
| CYLINDER ID TABLE HEADER BUFFERS AND FLAGS OFFSETS |
[0044] Each track entry in the record identification and locator table is shown in greater detail in FIG. 5 and comprises a track header portion 84 and a track body portion 86. The track header portion 84 includes information as shown in Table 3 below, including a track flag byte, line 1; record-count bytes, line 2; the track CRC check byte, line 3; track compress patterns line 4; and cache address pointer, line 5.
[0045] The body 86, FIG. 5 of the track portion of the record identification and locator table includes a plurality of record flags 83, (line 6, Table 3,) beginning at byte 20 and record modifiers 85 (line 7, Table 3) beginning at byte 159 and extending sequentially backward as necessary or until a collision with the record flags 83 occurs.
| TABLE 3 |
|---|
| ID TABLE TRACK HEADER AND BODY OFFSETS |
[0046] The track flags shown on line 1 in table 3 are described in detail on lines 8-15 and include such bits indicating a defective track bit, line 8; a write pending bit, line 11; and a track in cache bit, line 15. Similarly, the record flag bits of line 6 are shown in greater detail in lines 16-20 including bits comprising the compression algorithm for this record, line 16; key and data fields in cache, lines 17 and 18; and key field and data field write pending bits, lines 19 and 20.
[0047] The channel adapters 12a-12d,FIG. 1, receive data and read/write commands from one or more hosts over its respective channels. The data records are provided by the host in CKD format and are stored in cache memory 16 in CKD format. All records stored in cache whether temporarily while awaiting writing to disk, or records which have been read from the disk to be stored in cache for quicker access, are stored in CKD format. When the record is to be written to the disk drive, one of disk adapters 20 reads the data from cache memory over bus 18 and converts the CKD formatted data to the format of the present invention including a record identifier and locator table all of which can be stored in a plurality of fixed blocks before outputting the data over the disk adapters' SCSI interface to one or more of disk drives 22.
[0048] The present method for mapping CKD formatted data into fixed block disk drives is, in part, based on the recognition that under usual conditions, a sequence of CKD formatted records will include the “R” portion of the count identifying the record number from among a number of sequentially numbered data records of the same length. Further, the records are generally stored on the same device cylinder and accessed by the same device head. Additionally, the key length will generally be zero or some predetermined generally constant number. Thus, the method for disk mapping 100, FIG. 6 of the present invention includes establishing the profile of an expected record, step 110. In the preferred embodiment, the expected record is established with the count CCHH code as the physical cylinder and head identification, as well as the key length (K1)=0, data length (D1)=8 and the “R” byte of the count assigned as record number (n)=0. Further, the record flags are set to 00.
[0049] During step 112, the system employing the method of the present invention obtains the first CKD formatted record and compares the CKD record with the previously established expected record at step 114. At step 116, a determination is made as to whether or not the CKD formatted record including the “count” and record flags match those of the expected data record. If the CKD formatted record and the expected record match, the method proceeds to step 118 wherein the body of the track portion of the record identification and locator table previously discussed in conjunction with FIG. 5 and table 3 is built. Since the CKD formatted record matched the previously established expected data record, the record flag is set to 00 and no entry is made in the record modifier portion of the track ID cable. Subsequently, the “R” byte for the record number of the next expected data record is incremented by one, step 120, before returning to the step of obtaining the next CKD formatted data record at step 112.
[0050] If the results of the comparison at step 116 indicate that the CKD formatted record does not match the expected data record, the method proceeds to step 122 wherein a change format code (see Table 5) and record modifier, as required, are prepared. Next, the record format code and, if required, record modifier are inserted into the track identification table, step 124. If the track ID table is not full as determined at step 126, processing continues to step 128 wherein the current CKD count becomes the next expected count. Processing then returns to step 120 where the “R” byte is incremented by one before getting the next CKD record at step 112.
[0051] If, as indicated at step 126, the track identification table is full, meaning that the record flag portion of the ID table has collided with the record modifier portion of the ID table, the method of the instant invention will attempt to compress or shrink the body of the track ID table as shown in flowchart 130, FIG. 7. During the compression process of the instant invention, the system and method of the present invention attempt to define from one to eight data lengths which are repeated within this track. Such repeating data lengths are then classified as “patterns” and are thereafter referred to by a pattern “code” in the track header as shown on line 4 of Table 3, thus saving up to 2 bytes in the modifier portion of the track ID table for each repeated data length.
[0052] The method of the present invention first reads the ID table, step 132, searching for ID's with format code 03 for repeating values of data lengths, step 134. From those repeating values, the system and method of the present invention build a data length pattern table beginning with the data length that is most frequently repeated, and continuing on to find the seven most repeated data lengths and replaces the old 8 byte pattern with the new 8 byte pattern, step 136.
[0053] The method then proceeds to compare the data lengths of all the CKD records of the current track which have previously been read to determine whether or not any of the data lengths match the data patterns loaded in the pattern table, step 138. If any data lengths match the data patterns in the pattern table, the method proceeds to insert the data pattern code for the data length in a temporary ID table. Thus, the replaced record modifiers which previously contained the changed or modified data lengths are now unnecessary and eliminated, thus compressing or shrinking the size of the record identification and locator table and therefore allowing more room for the system to complete reading the CKD records for a given track. The system verifies at step 140, that the ID table was in fact compressed. If no ID table compression was achieved, the system reports an error, step 142. If ID table compression was achieved, the method replaces the old ID table with the temporary ID table with compressed counts, step 144, before returning to step 120, FIG. 6.
[0054] Although this count compression routine somewhat reduces system performance, the time to compute repeating data patterns and thus, to compress the “count” information in a record identification and locator table is minimal when compared to the tremendous savings of time which results from the ability to search the record locator table containing the count information in semiconductor memory instead of searching the disk drives for the requested record given the respective access times.
[0055] An example of a record identification and locator table for track 0 of a representative disk drive along with decoded information of each record is reproduced below as Table 4. This track identification and record locator table forms part of the device record identification and locator table as discussed previously in conjunction with FIG. 4. Line 2 of Table 4 corresponds to the track header portion 84, FIG. 5 of the track identification table also previously discussed in conjunction with Table 3. The second byte of the header, the number “5” indicates that there are five records on this track.
| TABLE 4 | |
|---|---|
| 1. | TRACK NUMBER 0 |
| 2. | FLAGS/COUNT/H/W/R/S/PAT/CACHE PTR: 00 |
[0056] Line 3 begins the record flag portion of the track identification table and is comprised of five record flags namely, flags: 00; 01; 03; 03; and 01. Each of the record flags is associated with a corresponding record, in ascending order. Thus, record flag 00 is associated with data record 0; record flag 01 is associated with data record 1; and record flag 03 is associated with data record 2 and so forth.
[0057] A representation of a record modifier portion of the track identification and locator table is shown at lines 4-8 of Table 4. As discussed in conjunction with FIG. 5, the record modifier portion of the track identification and record locator table is read backwards beginning with the byte, “A0” of line 8.
[0058] The track identification and record locator table of Table 4 may be further understood in conjunction with lines 9-13. As shown on line 9, which identifies record 0 of this track, the second, third and fourth columns comprise the original “count” information of the CKD record. It should be noted that this record matches the description of the “expected” record utilized in the example associated with the method of FIG. 6 since the first record on the track is record 0, the key length is 0, and the data length is 8 bytes. Thus, the record locator flag associated with that record, “00” is the first record flag byte encountered on line 3.
[0059] Proceeding to line 10, record number 1 on the track has a key length of 04 and a data length of 18 and thus, deviates from the previously established “expected” data record and thus is assigned a record flag of 01.
[0060] Various codes which comprise the record flags are reproduced in Table 5 below wherein as shown in line 1, the code 00 means no change to the previously established “expected” record. As shown in line 2 of the table, record flag format 01 indicates that the first byte of the record modifier is the change flag byte, indicating that every bit flagged with a “1” points to the byte in the record identifier that should be replaced by the following bytes in the record modifier. The order of the record identifier is shown in line 7 of Table 5 and begins with the key length, followed by data length (high), data length (low) and the first byte of the cylinder.
| TABLE 5 |
|---|
| RECORD FORMAT CHANGE CODES |
[0061] Thus, returning now to line 10 of Table 4, the flag code 01 indicates that the first byte of the modifier namely, “A0” indicates the bits that are to be changed in the record identifier. Reading change byte A0 in conjunction with line 7 of Table 5 discloses that the successive bytes in the record modifier will modify the key length and data length (low) of the data record. The record modifier bytes in the track identification table modify the record identifier in reverse order as that shown in line 7 of Table 5 that is, from record number to key length. Thus, the second byte, “18” of the record modifier at line 8 of Table 4 indicates that the previously expected data length is to be replaced with a data length (low) of “18”, while the next byte of the record modifier, “04” is to replace the previously expected key length. It is in this manner that the system “reconstructs” the count portion of a CKD record from the “encoded” record identification and locator table.
[0062] Record number 2, line 11 of Table 4 also has a key length of “04” but the data length changes to “90”. Thus, a flag of 03 is entered. The record flag of 03, as shown at line 9, Table 5, indicates that the next sequential byte of information in the record modifier is to be used as the data length (low) and the data length (high) will equal 0. Thus, the next consecutive entry of “90” in the record modifier portion of the track identification table body is accounted for.
[0063] Similarly, the next byte of the modifier portion of the track identification table is “50” which is the changed data length of record 3 read in conjunction with a record flag of “03” at line 12 of Table 4.
[0064] The final record flag “01” in the record flag portion of this track indicates that the next sequential byte namely, “E0” in the record modifier portion of the table is the changed flag byte pointing to the bytes in the record identifier that are to be changed or modified by the subsequent bytes in the record modifier portion of the table. Code E0 indicates that the key length, data length (high) and data length (low) are to be changed by the three bytes which follow as indicated by line 7, Table 5. Thus, byte “B0” of the record modifier is used as the data length (low); byte “0F” is used as the data length (high) byte, and byte 00 modifies the former key length entry.
[0065] The building of a record identification and locator table in accordance with the present invention greatly reduces the amount of fixed block disk space required to store the “count” portion of a CKD formatted data record.
[0066] An additional example of a track level record identification and locator table is reproduced in Table 6 below and is useful in showing an entry in the data pattern table previously described in conjunction with FIG. 7. Table 6 is a representation of a track identification table for an exemplary track number “D00” and is used for illustrative purposes only.
| TABLE 6 | |
|---|---|
| 1. | TRACK NUMBER D00 |
| 2. | FLAGS/COUNT/H/W/R/S/PAT/CACHE PTR: 11 81 00 00 00 C7 |
[0067] On line 2 of Table 6, the track “header” information is presented including the first byte “11” indicating that on this track, there is at least one record which is in cache, and at least one record which has a write pending, as previously explained in conjunction with Table 3. The second byte of the track header, “81” indicates there are 81 records in this track, while byte 5, “C7” is the CRC byte for this track. The next byte of the header, “3E” is the first byte of the data pattern table which extends for 8 bytes ending with “24”. In this example, bytes 1-7 of the pattern table are not used, but are merely shown for illustrative purposes only. The last four bytes of the track header, “03 FD E0 00” is the cache beginning memory address at which any records from this track which are stored in cache are located.
[0068] Of particular interest in Table 6 is record 03 located at line 11. Since the data length, “3E” of record 3 is a deviation from the previously established data length “28”, a record flag of other than 00 is expected, and thus the record flag “08” is entered. As can be compared from line 14 of the record flag codes in Table 5, record flag code “08” indicates that the data length (low) of this record identifier is to be loaded with pattern 0, the first pattern from the identification table header and thus, the “3E” pattern from line 2 of Table 6 is used as the data length for record number 3 when the system reconstructs the data record. The record flag, “28” which is shown and underlined on line 3 of Table 6 also indicates that the data of this record is stored in cache. The cache address is ascertained by adding up the cache memory starting address (line 2) contained in the header of the track identification table along with the length of any intervening data or key information stored in cache.
[0069] Modifications and substitutions of the present invention by one of ordinary skill in the art are considered to be within the scope of the present invention, which is not to be limited except by the claims which follow.
Claims
What is claimed is:
1. A data storage system comprising data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data records of the logical track including variable-length data records, the data processor being programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing respective entries for data records having data stored in the data storage, at least some but not all of the entries having a data-length portion indicating data length of the data record of the entry when the data length of the record of the entry fails to match an expected data length.
2. The data storage system of claim 1, wherein the data length of the data record of the entry becomes the expected data length for a next data record of the logical track.
3. The data storage system of claim 1, wherein the processor is programmed to compress the entries by searching for a frequently replicated data-length portion, and upon finding a frequently replicated data-length portion, replacing the frequently replicated data-length portion by setting a value in each entry having the frequently replicated data-length portion, the value being representative of the frequently replicated data-length portion, so as to eliminate the frequently replicated data-length portion.
4. A data storage system comprising data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one count-key-data (CKD) record of a logical track of CKD records, the data processor being programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the CKD record, the record locator data structure containing entries for the CKD records having data stored in the data storage, at least some but not all of the entries having a respective record modifier portion when the count of the CKD record of the entry fails to match an expected count.
5. The data storage system of claim 4, wherein the count of the CKD record of each entry determines the expected count for a next CKD record of the logical track.
6. The data storage system of claim 4, wherein the processor is programmed to compress the entries by searching for a frequently replicated record modifier portion, and upon finding a frequently replicated record modifier portion, replacing the frequently replicated record modifier portion by setting a value in each entry having the frequently replicated record modifier portion, the value being representative of the frequently replicated record modifier portion, so as to eliminate the frequently replicated record modifier portion.
7. A data storage system comprising data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data processor being programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing entries for data records having data stored in the data storage, each entry including a fixed-length portion, and at least some but not all of the entries having respective variable-length portions, wherein the fixed-length portion of each entry includes an indication of whether or not the entry includes a variable-length portion.
8. The data storage system of claim 7, wherein the processor is programmed to compress the entries by searching for a frequently replicated variable-length portion, and upon finding a frequently replicated variable-length portion, replacing the frequently replicated variable-length portion by setting a value in the fixed-length portion of each entry having the frequently replicated variable-length portion, the value being representative of the frequently replicated variable-length portion, so as to eliminate the frequently replicated variable-length portion.
9. The data storage system of claim 7, wherein the data records include variable-length data records, and each entry has a variable-length portion indicating data length of the data record of the entry when the data length of the data record of said each entry fails to match an expected data length.
10. The data storage system of claim 9, wherein the data length of the data record of said each entry becomes the expected data length for a next data record of the logical track.
11. The data storage system of claim 7, wherein the data records are count-key-data (CKD) records, and each entry has a variable-length portion indicating the count of the data record of said each entry when the count of the data record of said each entry fails to match an expected count.
12. The data storage system of claim 11, wherein the count of the data record of said each entry determines the expected count for a next data record of the track.
13. A data storage system comprising data storage, random-access memory, and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data processor being programmed to access a record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing respective entries for data records having data stored in the data storage, each entry including a fixed-length portion, and at least some but not all of the entries having respective variable-length portions, the fixed-length portions being stored sequentially in a first region of address locations of the random-access memory, and the variable-length portions being stored sequentially in a second region of address locations of the random-access memory.
14. The data storage system as claimed in claim 13, wherein the fixed-length portion of each entry includes record flags, and one of the record flags indicates whether or not said each entry includes a variable-length portion.
15. The data storage system of claim 13, wherein the first region of memory addresses and the second region of memory addresses are within a block of memory addresses allocated for storing the entries of the records of the logical track, the first region of memory addresses is aligned at one end of the block, and the second region of memory addresses is aligned at another end of the block, so that as entries for records of the track are stored in the block, the first region of memory addresses and the second region of memory addresses each expand toward each other and may eventually collide within the block.
16. The data storage system of claim 15, wherein the processor is programmed to compress the entries when the first region of memory addresses and the second region of memory addresses collide within the block.
17. The data storage system of claim 13, wherein the processor is programmed to compress the entries by searching for a frequently replicated variable-length portion, and upon finding a frequently replicated variable-length portion, replacing the frequently replicated variable-length portion by setting a value in the fixed-length portion of each entry having the frequently replicated variable-length portion, the value being representative of the frequently replicated variable-length portion, so as to eliminate the frequently replicated variable-length portion.
18. The data storage system of claim 13, wherein the data records include variable-length data records, and each entry has a variable-length portion indicating data length of the data record of the entry when the data length of the data record of said each entry fails to match an expected data length.
19. The data storage system of claim 18, wherein the data length of the data record of said each entry becomes the expected data length for a next data record of the logical track.
20. The data storage system of claim 13, wherein the data records are count-key-data (CKD) records, and each entry has a variable-length portion indicating the count of the data record of said each entry when the count of the data record of said each entry fails to match an expected count.
21. The data storage system of claim 20, wherein the count of the data record of said each entry determines the expected count for a next data record of the track.
22. A method of maintaining a record locator data structure in random access memory of a data storage system also having data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data records of the logical track including variable-length data records, the data processor being programmed to access the record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing respective entries for data records having data stored in the data storage, at least some but not all of the entries having a data-length portion indicating data length of the data record of the entry, the method including updating the record locator data structure to include a new entry for a new data record by:
(a) establishing an expected data length for the new data record;
(b) comparing the data length of the new data record to the expected data length for the new data record, and
(i) if the data length of the new data record does not match the expected data length of the new data record, storing a data-length portion indicating the data length of the new data record of the new entry; and
(ii) if the data length of the new data record matches the expected data length of the new data record, not storing a data-length portion indicating the data length of the new data record of the new entry.
23. The method of claim 22, wherein the data length of the data record of the entry becomes the expected data length for a next data record of the logical track.
24. The method of claim 22, which further includes compressing the entries by searching for a frequently replicated data-length portion, and upon finding a frequently replicated data-length portion, replacing the frequently replicated data-length portion by setting a value in each entry having the frequently replicated data-length portion, the value being representative of the frequently replicated data-length portion, so as to eliminate the frequently replicated data-length portion.
25. A method of maintaining a record locator data structure in random access memory of a data storage system also having data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one count-key-data (CKD) record of a logical track of CKD records, the data processor being programmed to access the record locator data structure in the random-access memory for locating a data storage area in the data storage allocated for storing data of the CKD record, the record locator data structure containing entries for the CKD records having data stored in the data storage, at least some but not all of the entries having a respective record modifier portion, the method including updating the record locator data structure to include a new entry for a new CKD record by:
(a) establishing an expected count for the new CKD record;
(b) comparing the count of the new CKD record to the expected count for the new CKD record, and
(i) if the count of the new CKD record does not match the expected count of the new CKD record, storing a record modifier portion indicating the count of the new CKD record of the new entry; and
(ii) if the count of the new CKD record matches the expected count of the new CKD record, not storing a record modifier portion indicating the count of the new CKD record of the new entry.
26. The method of claim 25, which includes determining the expected count for a next CKD record of the logical track from the count of the CKD record of said each entry by incrementing an “R” byte of the count of the CKD record of said each entry.
27. The method of claim 25, which further includes compressing the entries by searching for a frequently replicated record modifier portion, and upon finding a frequently replicated record modifier portion, replacing the frequently replicated record modifier portion by setting a value in each entry having the frequently replicated record modifier portion, the value being representative of the frequently replicated record modifier portion, so as to eliminate the frequently replicated record modifier portion.
28. A method of maintaining a record locator data structure in random access memory of a data storage system also having data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data processor being programmed to access the record locator data structure for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing entries for data records having data stored in the data storage, each entry including a fixed-length portion, and at least some but not all of the entries having respective variable-length portions, the method including updating the record locator data structure to include a new entry for a new data record by:
(a) determining whether or not to include a variable length portion in the new entry for the new data record, and
(b) setting a value in the fixed-length portion of the new entry indicating whether or not the new entry includes a variable-length portion.
29. The method of claim 28, which further includes compressing the entries by searching for a frequently replicated variable-length portion, and upon finding a frequently replicated variable-length portion, replacing the frequently replicated variable-length portion by setting a value in the fixed-length portion of each entry having the frequently replicated variable-length portion, the value being representative of the frequently replicated variable-length portion, so as to eliminate the frequently replicated variable-length portion.
30. The method of claim 28, wherein the data records include variable-length data records, and each entry has a variable-length portion indicating data length of the record of the entry when the data length of the record of said each entry fails to match an expected data length.
31. The method of claim 30, wherein the data length of the data record of said each entry becomes the expected data length for a next data record of the logical track.
32. The method of claim 28, wherein the data records are count-key-data (CKD) records, and each entry has a variable-length portion indicating the count of the data record of said each entry when the count of the data record of said each entry fails to match an expected count.
33. The method of claim 32, which includes determining the expected count for a next CKD record of the logical track from the count of the CKD record of said each entry by incrementing an “R” byte of the count of the CKD record of said each entry.
34. A method of maintaining a record locator data structure in random access memory of a data storage system also having data storage and at least one processor responsive to data storage access requests for access to data stored in the data storage, each data storage access request specifying at least one data record of a logical track of data records, the data processor being programmed to access the record locator data structure for locating a data storage area in the data storage allocated for storing data of the data record, the record locator data structure containing respective entries for data records having data stored in the data storage, each entry including a fixed-length portion, and at least some but not all of the entries having respective variable-length portions, the method including updating the record locator data structure to include a new entry for a new data record by:
(a) determining whether or not the new entry is to have a variable-length portion, and
(b) storing a fixed-length portion for the new data record in a next address location in a first region of address locations of the random-access memory, and if the new entry is to have a variable-length portion, storing the variable-length portion of the new entry in a next address location in a second region of address locations of the random-access memory.
35. The method as claimed in claim 34, which includes setting record flags in the fixed-length portion of the new entry, wherein one of the record flags indicates whether or not the new entry includes a variable-length portion.
36. The method as claimed in claim 34, wherein the first region of memory addresses and the second region of memory addresses are within a block of memory addresses allocated for storing the entries of the records of the logical track, the first region of memory addresses is aligned at one end of the block, and the second region of memory addresses is aligned at another end of the block, and the method includes storing entries for records of the track in the block so that the first region of memory addresses and the second region of memory addresses each expand toward each other and eventually collide within the block.
37. The method as claimed in claim 36, which further includes compressing the entries when the first region of memory addresses and the second region of memory addresses collide within the block.
38. The method as claimed in claim 34, which includes compressing the entries by searching for a frequently replicated variable-length portion, and upon finding a frequently replicated variable-length portion, replacing the frequently replicated variable-length portion by setting a value in the fixed-length portion of each entry having the frequently replicated variable-length portion, the value being representative of the frequently replicated variable-length portion, so as to eliminate the frequently replicated variable-length portion.
39. The method of claim 34, wherein the data records include variable-length data records, and the method includes storing in each entry a variable-length portion indicating data length of the data record of the entry when the data length of the data record of said each entry fails to match an expected data length.
40. The method of claim 39, wherein the data length of the data record of said each entry becomes the expected data length for a next data record of the logical track.
41. The method of claim 34, wherein the data records are count-key-data (CKD) records, and the method includes storing in each entry a variable-length portion indicating the count of the data record of said each entry when the count of the data record of said each entry fails to match an expected count.
42. The method of claim 41, which includes determining the expected count for a next CKD record of the logical track from the count of the CKD record of said each entry by incrementing an “R” byte of the count of the CKD record of said each entry.
Patent Citations (40)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4262332(A) | 1981-04-01 | Bass et al. | Applicant |
| US4310883(A) | 1982-01-01 | Clifton et al. | Applicant |
| US4467421(A) | 1984-08-01 | White | Applicant |
| US4500954(A) | 1985-02-01 | Duke et al. | Applicant |
| US4533996(A) | 1985-08-01 | Hartung et al. | Applicant |
| US4593354(A) | 1986-06-01 | Ushiro | Applicant |
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4775969(A) | 1988-10-01 | Osterlund | Applicant |
| US4780808(A) | 1988-10-01 | Moreno et al. | Applicant |
| US4825406(A) | 1989-04-01 | Bean et al. | Applicant |
| US4837675(A) | 1989-06-01 | Bean et al. | Applicant |
| US4837680(A) | 1989-06-01 | Crockett et al. | Applicant |
| US4862411(A) | 1989-08-01 | Dishon et al. | Applicant |
| US4875155(A) | 1989-10-01 | Iskiyan et al. | Applicant |
| US4914656(A) | 1990-04-01 | Dunphy, Jr. et al. | Applicant |
| US4939598(A) | 1990-07-01 | Kulakowski et al. | Applicant |
| US4993030(A) | 1991-02-01 | Krakauer et al. | Applicant |
| US5034914(A) | 1991-07-01 | Osterlund | Applicant |
| US5072378(A) | 1991-12-01 | Manka | Applicant |
| US5124987(A) | 1992-06-01 | Milligan et al. | Applicant |
| US5155809(A) | 1992-10-01 | Baker et al. | Applicant |
| US5155845(A) | 1992-10-01 | Beal et al. | Applicant |
| US5206939(A) | 1993-04-01 | Yanai et al. | Applicant |
| US5237675(A) | 1993-08-01 | Hannon, Jr. | Applicant |
| US5247638(A) | 1993-09-01 | O'Brien et al. | Applicant |
| US5263145(A) | 1993-11-01 | Brady et al. | Applicant |
| US5297124(A) | 1994-03-01 | Plotkin et al. | Applicant |
| US5301304(A) | 1994-04-01 | Menon | Applicant |
| US5392390(A) | 1995-02-01 | Crozier | Applicant |
| US5414834(A) | 1995-05-01 | Alexander et al. | Applicant |
| US5664144(A) | 1997-09-01 | Yanai et al. | Applicant |
| US5909692(A) | 1999-06-01 | Yanai et al. | Applicant |
| US6185653(B1) | 2001-02-01 | Yanai et al. | Applicant |
| EP347032 | 1989-12-01 | Applicant | |
| JP58-223862 | 1983-12-01 | Applicant | |
| JP61-21525 | 1986-01-01 | Applicant | |
| JP4-21041 | 1992-01-01 | Applicant | |
| WO91/06053 | 1991-05-01 | Applicant | |
| WO91/08536 | 1991-06-01 | Applicant | |
| WO91/08537 | 1991-06-01 | Applicant |
Non-Patent Literature (53)
- US 4,533,955, 8/1985, Christian et al. (withdrawn)Applicant
- N. S. Prasad, “IBM Mainframes Architecture and Design”, 1989, pp. 297-298.Applicant
- Complaint of EMC Corporation Under Section 337 of the Tariff Act of 130, As Amended, United States International Trade Commission, In the Matter of Certain Data Storage Systems and Components Thereof, Investigation No. 337-TA-—, Apr. 11, 2002.Applicant
- Complaint for Patent Infringement, In the United States District Court for the District of Massachusetts (Central Section), Civil Action No. BBO#546481, EMC Corporation v. Hitachi Data Systems Corporation and Hitachi, Ltd., Apr. 11, 2002.Applicant
- Notice of Investigation, United States International Trade Commission, Inv. No. 337-TA-471, In the Mater of Certain Data Storage Systems and Components Thereof, May 9, 2002.Applicant
- Notice of Investigation, United States International Trade Commission, Inv. No. 337-TA-471, In the Mater of Certain Data Strorage Systems and Components Thereof, Federal Register, vol. 67, No. 93, Tuesday, May 14, 2002, pp. 34472-34473.Applicant
- R.D. Tennison, “Compacting Indexed Data,” IBM Technical Disclosure Bulletin, vol. 24, No. 7A, Dec. 1981, pp. 3202-3203.Applicant
- N.K. Ouchi, “System for Blocking Variable-Length Records,” IBM Technical Disclosure Bulletin, vol. 16, No. 4, Sep. 1973, pp. 1239-1240.Applicant
- IBM Publication GA 33-1528-2, Third Edition, “IBM 4321/4331 Processors Compatibility Features,” Sep. 1982, pp. 1-1, 1-4, 1-5, 2-1, 2-2, and 2-3.Applicant
- Patterson et al., A Case for Redundant Arrays of Inexpensive Disks (RAID), Report No. UCB/CSD 87/391, Computer Science Division (EECS), University of California, Berkeley, California, Dec. 1987 (pp. 1 to 24).Applicant
- Patterson et al., “Introduction to Redundant Arrays of Inexpensive Disks (RAID),” COMPCON 89 Proceedings, Feb. 27—Mar. 3, 1989, IEEE Computer Society, pp. 112-117.Applicant
- Ousterhout et al., “Beating the I/O Bottleneck: A Case for Log-Structured File Systems,” Operating Systems Review, vol. 23, No. 1, ACM Press, Jan., 1989, pp. 11-28.Applicant
- Douglis et al., “Log Structured File Systems,” COMPCON 89 Proceedings, Feb. 27—Mar. 3, 1989, IEEE Computer Society, pp. 124-129.Applicant
- Jeff Moad, “Relief for Slow Storage Systems,” Datamation, Sep. 1, 1990, pp. 25-28.Applicant
- Storage Technology Corporation's Responses to Plaintiff's Interrogatories Nos. 4-5, EMC Corp. v. Storage Technology Corp., Civil Action No. 94-482, in the United States District Court for District of Delaware, Jan. 19, 1995, pp. 1-5.Applicant
- Storage Technology Corporation's Outline of the Issues for the Sep. 7 and 8 Mediation, EMC Corp. v. Storage Technology Corp., Civil Action No. 94-482, in the United States District Court for the District of Delaware.Applicant
- Stipulated Protective Order, EMC Corp. v. Storage Technology Corp., Civil Action No. 94-482, in the United States District Court for the District of Delaware,pp. 1-10.Applicant
- Storage Technology Corporation's Third Supplemental Responses to Plaintiff's Interrogatories Nos. 1-3, EMC Corp. v. Storage Technology Corp., Cilvil Action No. 94-482, in the United States District Court for the District of Delaware, Oct. 18, 1995, pp. 1-17 & pp. 1-3 Notice of Service.Applicant
- Storage Technology Corporation's Third Supplemental Responses to Plaintiff's Interrogatories Nos. 1-3, EMC Corp. v. Storage Technology Corp., Civil Action No. 94-482, in the United States District Court for the District of Delaware, May 16, 1995, pp. 1-31.Applicant
- Plaintiff EMC Corporation's Response to Defendant's Third Set of Interrogatories Nos. 18, Jun. 30, 1995, EMC Corp. v. Storage Technology Corp., Civil Action No. 94-482, in the United States District Court for the District of Delaware, pp. 1-10.Applicant
- Baird, R., “Rapid Access Method for Fixed Block DASD Records,” IBM Technical Disclosure Bulletin, vol. 20, No. 4, Sep. 1997, pp. 1565-1566.Applicant
- “Virtual Count-Key Data,” IBM Technical Disclosure Bulletin, vol. 36, No. 3, Mar. 1993, pp. 13-15.Applicant
- Moad, J., “Will Storage Tek's Iceberg Float?”, Datamation, Feb. 1, 1992, pp. 59-60.Applicant
- Postel, J., and Reynolds, J., “File Transfer Protocol,” RFC 959, ISI (Oct. 1985).Applicant
- Bhushan, A., et al., “The File Transfer Protocol,” RFC 265, Network Working Group (Nov. 1971).Applicant
- Bhushan, A., The Use of ‘Set Data Type’ Transaction in File Transfer Protocol, FRC 294, Network Working Group (Jan. 1972).Applicant
- Bressler, “Mail Retrieval via FTP”, RFC 458, Network Working Group (Feb. 1973).Applicant
- Day, J., “Proposed File Access Protocol Specification,” RFC 520, Network Working Group (Jun. 25, 1973).Applicant
- Postel, “File Transfer Protocol,” RFC 65, ISI (Jun. 1980).Applicant
- Bohl, M., Introduction to IBM Direct Access Storage Devices, Science Research Associates, Inc., Palo Alto, Ca, 1981.Applicant
- IBM 3390 Storage Control Reference, No. GA32-009903, Fourth Edition (Dec. 1989), IBM Corporation.Applicant
- Knuth, Donald E., The Art of Computer Programming, vol. 1, Fundamental Algorithms, Addison Wesley, 2d(Ed. 1973).Applicant
- Knuth, Donald E., The Art of Computer Programming, vol. 2, Seminumerical Algorithms, Addison Wesley, (2d Ed. 1973).Applicant
- Knuth, Donald E., The Art of Computer Programming, vol. 3, Searching and Sorting, Addison Wesley, (2d Ed. 1973).Applicant
- Hitachi, Ltd's and Hitachi Data Systems Corporation's Response to the Notice of Investigation and Complaint Jun. 10, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets. usitc.gov.Applicant
- Respondent's Hitachi, Ltd. and Hitachi Data Systems Corporation's Unopposed Motion for a Modification to the Protective Order, Jul. 11, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 5 Modifying Protective Order, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant
- Hitachi, Ltd. And Hitachi Data Systems Corporation, Submission of Representative Invalidity Charts, Jul. 26, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- Hitachi, Ltd's and Hitachi Data Systems Corporation's First Amended Response to the Notice of Investigation and Complaint, Aug. 20, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- Lupo, R.V., letter dated Aug. 21, 2002, regarding typographical errors and enclosed replacement pages for Hitachi, Ltd's and Hitachi Data Systems Corporation's First Amended Response to the Notice of Investigation and Complaint, Aug. 20, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- Hitachi, Ltd. And Hitachi Data Systems Corporation, Citations of prior art and other references (5 pages), Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 11 Granting Respondents' Motion to Amend Response and Ordering Submission by Private Parties, Sep. 12, 2002, Investigation No. 337-TA-471, public version published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 20 Denying Hitachi's Motion No. 471-16 To Compel, Oct. 25, 2002, Investigation No. 337-TA-471, public version published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 9 Denying Complainant's Motion No. 471-3 To Modify the Protective Order (Order No. 2), Oct. 31, 2002, Investigation No. 337-TA-471, public version published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Commission Investigative Staff's Response to Order No. 29, Nov. 15, 2002, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant
- Complainant EMC Corporation's Submission of Responses to Specific Questions Raised in Order No. 29, Nov. 15, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- Respondents Hitachi, Ltd. and Hitachi Data Corporations's Responses to Order No. 29, Nov. 15, 2002, Investigation No. 337-TA-471, United States International Trade Commission, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Notice of Commission Decision Not To Review and Initial Determination Granting Complainant EMC's Motion To Terminate the Investigation as to Certain Claims and to Amend the Complaint and Notice of Investigation by Adding Two Claims, Federal Register, vol. 87, No. 226, Nov. 22, 2002.Applicant
- United States International Trade Commission, Order No. 32 Granting Respondents'Motion No. 471-25 To File A Second Amended Response To The Complaint and Notice of Investigation, Dec. 4, 2002, Investigation No. 337-TA-471, public version published at docket.usitc.gov.Applicant
- United States International Trade Commission, Commission Investigative Staff's Response to Respondent' Motion for Summary Determination That Prosecution Laches Renders U.S. Patent No. 5,909,692 Unenforceable, Dec. 20, 2002, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 42 Denying Hitachi's Motion No. 471-35 for Summary Determination the Prosecution Laches Renders The '692 Patent Unenforceable, Jan. 14, 2003, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 44 Requiring Submission From Respondents, Jan. 17, 2003, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant
- United States International Trade Commission, Order No. 45 Requiring Submission From Respondents, Jan. 21, 2003, Investigation No. 337-TA-471, published at dockets.usitc.gov.Applicant