Patent US6662268B1 successfully refreshed from Google Patents.
US6662268B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for striped mirror re-synchronization by logical partition rather than stripe units
Assignee: Google LLC
•
Filing: 1999-09-02
•
Granted: 2003-12-09
•
Expires: 2019-09-02
Abstract
Abstract Striped mirrors are re-synchronized by logical partition rather than by stripe unit for stale partitions. While re-synchronizing physical partitions, data is serialized across both the stripe unit and the real partition region. The re-sync Read operation uses the normal logical partition offsets to read on a physical partition boundary rather than using the stripe units. In so doing, a single disk in a striped mirror can be replaced without re-synchronizing the entire mirror. The resync Read is not broken up into individual stripe unit reads.
Inventors
- 👤 Gerald Francis McBrearty
- 👤 Johnny Meng-Han Shieh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 23:29
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/16; G06F11/20; G06F11/2053; G06F11/2056; G06F11/2082
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
63 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: receiving information that a disk is stale, wherein the disk is associated with a mirror; and performing a resynchronizing Read for a block on only the stale disk, wherein prior to performing a resynchronizing Read, the method comprises: serializing an IO request across both a stripe unit and a partition boundary.
Claim 2
Dependent Claim
63 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: receiving information that a disk is stale, wherein the disk is associated with a mirror; and performing a resynchronizing Read for a block on only the stale disk, wherein prior to performing a resynchronizing Read, the method comprises: serializing an IO request across both a stripe unit and a partition boundary.
Claim 3
Dependent Claim
44 words
The method recited in claim 1 , wherein performing a resynchronizing Read further comprises: determining an active mirror for the block; reading the block from an active partition on the active mirror; and writing the block to the stale partition on the stale disk.
Claim 4
Dependent Claim
24 words
The method recited in claim 2 , wherein reading the block further comprises: reading the block from the active partition as a single Read.
Claim 5
Dependent Claim
25 words
The method recited in claim 2 , wherein reading the block further comprises: reading the block on a real partition boundary on the active partition.
Claim 6
Dependent Claim
21 words
The method recited in claim 2 , wherein reading the block further comprises: reading the entire block from the active partition.
Claim 7
Dependent Claim
22 words
The method recited in claim 2 , wherein reading the block further comprises: reading the entire block as a single re-sync request.
Claim 8
Dependent Claim
24 words
The method recited in claim 2 , wherein writing the block further comprises: writing the block to the stale partition as a single Write.
Claim 9
Dependent Claim
25 words
The method recited in claim 2 , wherein writing the block further comprises: writing the block to a real partition boundary on the stale partition.
Claim 10
Dependent Claim
22 words
The method recited in claim 2 , wherein reading the block further comprises: writing the entire block as a single re-sync request.
Claim 11
Dependent Claim
87 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: serializing IO requests to both a logical region boundary and stripe units issuing a re-sync Read IO request for a block; determining an available mirror for the block; issuing a single Read for reading the block from a boundary on a first disk, wherein the first disk is associated with the available mirror; and issuing a single Write for writing the block from a boundary on a second disk, wherein the second disk is stale.
Claim 12
Dependent Claim
87 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: serializing IO requests to both a logical region boundary and stripe units issuing a re-sync Read IO request for a block; determining an available mirror for the block; issuing a single Read for reading the block from a boundary on a first disk, wherein the first disk is associated with the available mirror; and issuing a single Write for writing the block from a boundary on a second disk, wherein the second disk is stale.
Claim 13
Dependent Claim
130 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: issuing a Read IO request for a first block; determining at least two stripe units associated with the first block; identifying a physical region for each stripe unit; issuing separate Read IO requests for each stripe unit associated with the block for each physical region; issuing a re-sync Read IO request for a second block; determining an available mirror for the second block; issuing a single Read IO request for reading the second block from a boundary on a second physical region, wherein the second physical region is associated with the available mirror; and issuing a single Write IO request for writing the second block from a boundary on a third region, wherein the third region is stale.
Claim 14
Dependent Claim
130 words
A data processing system implemented method for resynchronizing a striped mirror, comprising: issuing a Read IO request for a first block; determining at least two stripe units associated with the first block; identifying a physical region for each stripe unit; issuing separate Read IO requests for each stripe unit associated with the block for each physical region; issuing a re-sync Read IO request for a second block; determining an available mirror for the second block; issuing a single Read IO request for reading the second block from a boundary on a second physical region, wherein the second physical region is associated with the available mirror; and issuing a single Write IO request for writing the second block from a boundary on a third region, wherein the third region is stale.
Claim 15
Dependent Claim
60 words
A data processing system for resynchronizing a striped mirror, comprising: receiving means for receiving information that a disk is stale, wherein the disk is associated with a mirror; performing means for perform a resynchronizing Read for a block on only the stale disk; and serializing means for serializing an IO request across both a stripe unit and a partition boundary.
Claim 16
Dependent Claim
60 words
A data processing system for resynchronizing a striped mirror, comprising: receiving means for receiving information that a disk is stale, wherein the disk is associated with a mirror; performing means for perform a resynchronizing Read for a block on only the stale disk; and serializing means for serializing an IO request across both a stripe unit and a partition boundary.
Claim 17
Dependent Claim
57 words
The system recited in claim 12 , wherein the performing means for performing a resynchronizing Read further comprises: determining means for determining an active mirror for the block; reading means for reading the block from an active partition on the active mirror; and writing means for writing the block to the stale partition on the stale disk.
Claim 18
Dependent Claim
31 words
The system recited in claim 13 , wherein the reading means for reading the block further comprises: reading means for reading the block from the active partition as a single Read.
Claim 19
Dependent Claim
32 words
The system recited in claim 14 , wherein the reading means for reading the block further comprises: reading means for reading the block on a real partition boundary on the active partition.
Claim 20
Dependent Claim
28 words
The system recited in claim 13 , wherein the reading means for reading the block further comprises: reading means for reading the entire block from the active partition.
Claim 21
Dependent Claim
29 words
The system recited in claim 13 , wherein the reading means for reading the block further comprises: reading means for reading the entire block as a single re-sync request.
Claim 22
Dependent Claim
31 words
The system recited in claim 13 , wherein the writing means for writing the block further comprises: writing means for writing the block to the stale partition as a single Write.
Claim 23
Dependent Claim
32 words
The system recited in claim 13 , wherein the writing means for writing the block further comprises: writing means for writing the block to a real partition boundary on the stale partition.
Claim 24
Dependent Claim
29 words
The system recited in claim 13 , wherein the reading means for reading the block further comprises: writing means for writing the entire block as a single re-sync request.
Claim 25
Dependent Claim
100 words
A data processing system for resynchronizing a striped mirror, comprising: serializing means for serializing IO requests to both stripe units and a logical region boundary; issuing means for issuing a re-sync Read IO request for a block; determining means for determining an available mirror for the block; issuing means for issuing a single Read for reading the block from a boundary on a first disk, wherein the first disk is associated with the available mirror; and issuing means for issuing a single Write for writing the block from a boundary on a second disk, wherein the second disk is stale.
Claim 26
Dependent Claim
100 words
A data processing system for resynchronizing a striped mirror, comprising: serializing means for serializing IO requests to both stripe units and a logical region boundary; issuing means for issuing a re-sync Read IO request for a block; determining means for determining an available mirror for the block; issuing means for issuing a single Read for reading the block from a boundary on a first disk, wherein the first disk is associated with the available mirror; and issuing means for issuing a single Write for writing the block from a boundary on a second disk, wherein the second disk is stale.
Claim 27
Dependent Claim
144 words
A data processing system for resynchronizing a striped mirror, comprising: issuing means for issuing a Read request IO request for a first block; determining means for determining at least two stripe units associated with the first block; identifying means for identifying a physical region for each stripe unit; issuing means for issuing separate Reads for each stripe unit associated with the block for each physical region; issuing means for issuing a re-sync Read IO request for a second block; determining an available mirror for the second block; issuing means for issuing a single Read for reading the second block from a boundary on a second physical region, wherein the second physical region is associated with the available mirror; and issuing means for issuing a single Write for writing the second block from a boundary on a third region, wherein the third region is stale.
Claim 28
Dependent Claim
144 words
A data processing system for resynchronizing a striped mirror, comprising: issuing means for issuing a Read request IO request for a first block; determining means for determining at least two stripe units associated with the first block; identifying means for identifying a physical region for each stripe unit; issuing means for issuing separate Reads for each stripe unit associated with the block for each physical region; issuing means for issuing a re-sync Read IO request for a second block; determining an available mirror for the second block; issuing means for issuing a single Read for reading the second block from a boundary on a second physical region, wherein the second physical region is associated with the available mirror; and issuing means for issuing a single Write for writing the second block from a boundary on a third region, wherein the third region is stale.
Claim 29
Dependent Claim
64 words
A computer program product for implementing a method for resynchronizing a striped mirror, comprising: receiving instructions for receiving information that a disk is stale, wherein the disk is associated with a mirror; performing instructions for performing a resynchronizing Read for a block on only the stale disk; and serializing instructions for serializing an IO request across both a stripe unit and a partition boundary.
Claim 30
Dependent Claim
64 words
A computer program product for implementing a method for resynchronizing a striped mirror, comprising: receiving instructions for receiving information that a disk is stale, wherein the disk is associated with a mirror; performing instructions for performing a resynchronizing Read for a block on only the stale disk; and serializing instructions for serializing an IO request across both a stripe unit and a partition boundary.
References Cited (Backward Citations)
US5845295A
Cited
US5897661A
Cited
US6216211B1
Cited
US6366986B1
Cited
US6260124B1
Cited
US6463573B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-12-08 | 2007-06-09 | 2007-12-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-12-08 | 2011-06-09 | 2011-12-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-12-08 | 2015-06-09 | 2015-12-09 | $7700.00 | Window Closed / Lapsed |