Efficient variable-block data storage system employing a staggered fixed-block-architecture array

Claim 3

The method of claim 1 wherein said fixed block format is a NO-ID Fixed Block Access (FBA) format without separate block identification fields.

Claim 4

The method of claim 2 wherein said logical data storage system includes an array of (N+1) DASDs, said method comprising the additional steps of: (bb) forming a corresponding parity block for each said diagonal-major sequence of no more than N said blocks concurrently with said writing step (b) and writing said corresponding parity block on the (N+1) st DASD; and (e) reconstructing one or more unavailable said blocks stored in a failed said DASD by combining the available said blocks in each said diagonal-major sequence with the corresponding said parity block in said (N+1) st DASD.

Claim 5

The method of claim 3 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 6

The method of claim 4 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 7

The method of claim 2 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 8

The method of claim 2 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 9

The method of claim 1 wherein said logical data storage system includes an array of (N+1) DASDs, said method comprising the additional steps of: (bb) forming a corresponding parity block for each said diagonal-major sequence of no more than N said blocks concurrently with said writing step (b) and writing said corresponding parity block on the (N+1) st DASD; and (e) reconstructing one or more unavailable said blocks stored in a failed said DASD by combining the available said blocks in each said diagonal-major sequence with the corresponding said parity block in said (N+1) st DASD.

Claim 10

The method of claim 8 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 11

The method of claim 9 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with a physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks of equal size distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 12

The method of claim 8 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 13

The method of claim 1 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 14

The method of claim 1 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 15

A logical data storage system for accessing variable length records each having at least a count field and one data field, said system comprising: an array of N synchronized fixed block formatted Direct Access Storage Devices (DASDs), each said DASD having a plurality of physical tracks and a data transfer rate (D), each said physical track having one or more blocks of size (B) separated by gaps of size (G), wherein N>1 is a positive integer; reformatting means coupled to said array for reformatting each said variable length record into a first said block representing said count field and one or more additional said blocks representing said at least one data field and all other fields; writing means coupled to each said DASD and to said reformatting means for synchronously writing, on said physical tracks, said first block and said additional blocks of said each variable length record in a predetermined toroidal traverse having one or more diagonal-major sequences over at least some of said N DASDs such that the j th said block on the i th said physical track of the k th said DASD follows the (j-g) th said block on the i th said physical track of the (k-1) th said DASD, said diagonal-major sequences wrapping around from the j th said block on the N th said DASD to the (j+h) th said block on the first said DASD, wherein g, h, i, j, and k are non-zero positive integers; pointer means coupled to said writing means for adding to each said count field a pointer representing the number of said blocks separating the first subsequent said count field from said each count field; and retrieving means coupled to said array for accessing said blocks forming a requested variable length record in sequence responsive to a request for at least one said variable length record.

Claim 16

A logical data storage system for accessing variable length records each having at least a count field and one data field, said system comprising: an array of N synchronized fixed block formatted Direct Access Storage Devices (DASDs), each said DASD having a plurality of physical tracks and a data transfer rate (D), each said physical track having one or more blocks of size (B) separated by gaps of size (G), wherein N>1 is a positive integer; reformatting means coupled to said array for reformatting each said variable length record into a first said block representing said count field and one or more additional said blocks representing said at least one data field and all other fields; writing means coupled to each said DASD and to said reformatting means for synchronously writing, on said physical tracks, said first block and said additional blocks of said each variable length record in a predetermined toroidal traverse having one or more diagonal-major sequences over at least some of said N DASDs such that the j th said block on the i th said physical track of the k th said DASD follows the (j-g) th said block on the i th said physical track of the (k-1) th said DASD, said diagonal-major sequences wrapping around from the j th said block on the N th said DASD to the (j+h) th said block on the first said DASD, wherein g, h, i, j, and k are non-zero positive integers; pointer means coupled to said writing means for adding to each said count field a pointer representing the number of said blocks separating the first subsequent said count field from said each count field; and retrieving means coupled to said array for accessing said blocks forming a requested variable length record in sequence responsive to a request for at least one said variable length record.

Claim 17

The logical data storage system of claim 14 wherein said array includes (N+1) DASDs, said system further comprising: parity means coupled to said writing means for forming a corresponding parity block for each said diagonal-major sequence of no more than N said blocks and for writing said corresponding parity block on the (N+1) st DASD; and reconstructing means coupled to said retrieving means for reconstructing one or more unavailable said blocks stored in a failed said DASD by combining the available said blocks in each said diagonal-major sequence with the corresponding said parity block in said (N+1) st DASD.

Claim 18

The logical data storage system of claim 15 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 19

The logical data storage system of claim 16 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 20

The logical data storage system of claim 14 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 21

The logical data storage system of claim 18 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 22

The logical data storage system of claim 14 wherein said fixed block format is a NO-ID Fixed Block Access (FBA) format without separate block identification fields.

Claim 23

The logical data storage system of claim 14 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 24

A computer program product for use with a computer system having a central processing unit for accessing variable length records in a logical data storage system having an array of N synchronized fixed block formatted Direct Access Storage Devices (DASDs), each said DASD having a plurality of physical tracks and a data transfer rate (D), each said variable length record having at least a count field and one data field, each said physical track having one or more blocks of size (B) separated by gaps of size (G), wherein N>1 is a positive integer, said computer program product comprising: a recording medium; means recorded on said recording medium for directing said computer system to reformat each said variable length record into a first said block representing said count field and one or more additional said blocks representing said at least one data field and all other fields; means recorded on said recording medium for directing said computer system to synchronously write, on said physical tracks, said first block and said additional blocks of said each variable length record in a predetermined toroidal traverse having one or more diagonal-major sequences over at least some of said N DASDs such that the j th said block on the i th said physical track of the k th said DASD follows the (j-g) th said block on the i th said physical track of the (k-1) th said DASD, said diagonal-major sequences wrapping around from the j th said block on the N th said DASD to the (j+h) th said block on the first said DASD, wherein g, h, i, j, and k are non-zero positive integers; means recorded on said recording medium for directing said computer system to add to each said count field a pointer representing the number of said blocks separating the first subsequent said count field from said each count field; and means recorded on said recording medium for directing said computer system to access said blocks forming said requested variable length record in sequence responsive to a request for at least one said variable length record.

Claim 25

A computer program product for use with a computer system having a central processing unit for accessing variable length records in a logical data storage system having an array of N synchronized fixed block formatted Direct Access Storage Devices (DASDs), each said DASD having a plurality of physical tracks and a data transfer rate (D), each said variable length record having at least a count field and one data field, each said physical track having one or more blocks of size (B) separated by gaps of size (G), wherein N>1 is a positive integer, said computer program product comprising: a recording medium; means recorded on said recording medium for directing said computer system to reformat each said variable length record into a first said block representing said count field and one or more additional said blocks representing said at least one data field and all other fields; means recorded on said recording medium for directing said computer system to synchronously write, on said physical tracks, said first block and said additional blocks of said each variable length record in a predetermined toroidal traverse having one or more diagonal-major sequences over at least some of said N DASDs such that the j th said block on the i th said physical track of the k th said DASD follows the (j-g) th said block on the i th said physical track of the (k-1) th said DASD, said diagonal-major sequences wrapping around from the j th said block on the N th said DASD to the (j+h) th said block on the first said DASD, wherein g, h, i, j, and k are non-zero positive integers; means recorded on said recording medium for directing said computer system to add to each said count field a pointer representing the number of said blocks separating the first subsequent said count field from said each count field; and means recorded on said recording medium for directing said computer system to access said blocks forming said requested variable length record in sequence responsive to a request for at least one said variable length record.

Claim 26

The computer program product of claim 22 wherein said array includes (N+1) DASDs, said computer program product further comprising: means recorded on said recording medium for directing said computer system to form a corresponding parity block for each said diagonal-major sequence of no more than N said blocks and to write said corresponding parity block on the (N+1) st DASD; and means recorded on said recording medium for directing said computer system to reconstruct one or more unavailable said blocks stored in a failed said DASD by combining the available said blocks in each said diagonal-major sequence with the corresponding said parity block in said (N+1) st DASD.

Claim 27

The computer program product of claim 23 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 28

The computer program product of claim 24 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 29

The computer program product of claim 22 wherein each said DASD has read and write head-to-track alignments and a micro-jog time (T) delay between said read alignment and said write alignment in said each DASD, and wherein said DASD plurality N satisfies the inequality N≦(B+DT)/(B+G).

Claim 30

The computer program product of claim 26 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.

Claim 31

The computer program product of claim 22 wherein said fixed block format is a NO-ID Fixed Block Access (FBA) format without separate block identification fields.

Claim 32

The computer program product of claim 22 wherein said each DASD is organized into two or more concentric bands, each said band having a plurality of physical tracks with identical physical block storage capacity and wherein said first block and said additional blocks are organized in one or more logical tracks distributed in one or more diagonal-major sequences over at least some of said N DASDs.