Appeal No. 2006-1540
Application No. 10/113,338
OPINION
At the outset, the recitation of a few definitions from the
instant specification is appropriate.
As per page 3 of the specification, data interleaving is
usually in the form of “data striping,” in which data to be
stored is broken down into blocks called “stripe units” which are
then distributed across an array of disks. Stripe units are
typically predefined as a bit, byte, block or other unit. Stripe
units are further broken into a plurality of sectors where all
sectors are an equivalent predefined size.
A “stripe” is a group of corresponding stripe units, one
stripe unit from each disk in the array.
Thus, a “stripe size” is equal to the size of a stripe unit
times the number of data disks in the array.
With regard to independent claims 1, 6, 11, and 16, the
examiner finds that Ohizumi discloses rebuilding data units in a
disk in a disk array data group by data group, wherein each disk
in the disk array comprises a plurality of data units and wherein
a data group is a group of corresponding data units from each
disk in the disk array. The examiner finds such a teaching in
Ohizumi at column 4, lines 12 et seq.: “‘Further, after the
repair of the faulty disk storage is completed, or the faulty
3
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Next
Last modified: November 3, 2007