← Back to Patent Explorer
US5678061A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for employing doubly striped mirroring of data and reassigning data streams scheduled to be supplied by failed disk to respective ones of remaining disks

Assignee: Nokia of America Corp
•
Filing: 1995-07-19
•
Granted: 1997-10-14
•
Expires: 2015-07-19
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The reliability of supplying data stored in a plurality of different memories to different users is enhanced by (a) dividing each of the memories into primary and secondary sections, (b) partitioning the data into successive blocks and (c) storing the blocks of data in sequence in respective ones of the primary sections. Then storing in sequence the blocks of data that have been stored in the primary section of one of the memories in respective ones of the secondary sections of the other ones of said disks.

Inventors

  • 👤 Antoine N. Mourad

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 23:43
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/16; G06F11/20; G06F11/2053; G06F11/2094; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1803; G11B20/1806; G11B20/1809; G11C; G11C29/00; G11C29/70; G11C29/74; H; H04; H04N; H04N7/00; H04N7/16; H04N7/173; H04N7/17309; H04N7/17336

Claims Analysis

Total Claims: 3
Claim 1
Independent Claim 240 words
A method of storing data in a plurality of N independent disks comprising the steps of dividing the storage area of each of said disks into primary and secondary sections, partitioning said data into a plurality of successive blocks of data and storing said successive blocks of data in sequence in respective ones of the primary sections of said disks in a predetermined order, storing in sequence the blocks of data that have been stored in one of said primary sections of one of said disks in respective secondary sections of the other ones of said disks, unloading in sequence a block of data from the primary section of each of the N disks during respective Nth cycles and supplying the unloaded block of data to a particular one of a plurality of data streams being served by the N disks, where N>1, and responsive to one of the N disks failing, re-assigning the data streams scheduled to be supplied by the failed one of said disks for a respective one of the cycles to respective ones of the remaining disks containing a restart data block for a respective one of such data streams, in which said re-assigning is constrained so that no more than n/N additional streams are assigned to any one of the remaining disks, where n is the maximum number of data streams that can be served concurrently by any one of the disks in one cycle.
Claim 2
Independent Claim 240 words
A method of storing data in a plurality of N independent disks comprising the steps of dividing the storage area of each of said disks into primary and secondary sections, partitioning said data into a plurality of successive blocks of data and storing said successive blocks of data in sequence in respective ones of the primary sections of said disks in a predetermined order, storing in sequence the blocks of data that have been stored in one of said primary sections of one of said disks in respective secondary sections of the other ones of said disks, unloading in sequence a block of data from the primary section of each of the N disks during respective Nth cycles and supplying the unloaded block of data to a particular one of a plurality of data streams being served by the N disks, where N>1, and responsive to one of the N disks failing, re-assigning the data streams scheduled to be supplied by the failed one of said disks for a respective one of the cycles to respective ones of the remaining disks containing a restart data block for a respective one of such data streams, in which said re-assigning is constrained so that no more than n/N additional streams are assigned to any one of the remaining disks, where n is the maximum number of data streams that can be served concurrently by any one of the disks in one cycle.
Claim 3
Dependent Claim 48 words
The method of claim 1 further comprising the step of, responsive to not being able to reassign a particular one of the data streams to the disk containing the restart data block for a current cycle, then reassigning that data stream to the preceding disk in the sequence.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-10-13 2001-04-14 2001-10-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-10-13 2005-04-14 2005-10-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-10-13 2009-04-14 2009-10-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag