Asynchronous data replication

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S167000, C711S162000

Reexamination Certificate

active

07809892

ABSTRACT:
Technologies are provided herein for asynchronous data replication. A primary server maintains and exposes a storage volume for use by storage clients. The primary server receives write operations directed toward the storage volume and performs the writes on the storage volume. The primary server also creates buckets containing each of the write operations. The buckets are opened at a first point in time and closed at a second point in time that may be selected based upon the contents of the buckets, a predefined time period, or based upon an indication from an application program. The buckets are transmitted to a second server computer asynchronously. When each bucket is received completely by the second server, its contents are written to a storage volume maintained by the second computer. The buckets may be created from pages of a write-back cache utilizing a zero buffer copy mechanism.

REFERENCES:
patent: 4849978 (1989-07-01), Dishon et al.
patent: 4942579 (1990-07-01), Goodlander et al.
patent: 5257367 (1993-10-01), Goodlander et al.
patent: 5524204 (1996-06-01), Verdoorn, Jr.
patent: 5604862 (1997-02-01), Midgely et al.
patent: 5678061 (1997-10-01), Mourad
patent: 5720027 (1998-02-01), Sarkozy et al.
patent: 5732238 (1998-03-01), Sarkozy
patent: 5787459 (1998-07-01), Stallmo et al.
patent: 5790774 (1998-08-01), Sarkozy
patent: 5893919 (1999-04-01), Sarkozy et al.
patent: 5907849 (1999-05-01), Dias et al.
patent: 6098128 (2000-08-01), Velez-McCaskey et al.
patent: 6105122 (2000-08-01), Muller et al.
patent: 6108748 (2000-08-01), Ofek et al.
patent: 6128654 (2000-10-01), Runaldue et al.
patent: 6282619 (2001-08-01), Islam et al.
patent: 6289398 (2001-09-01), Stallmo et al.
patent: 6434681 (2002-08-01), Armangau
patent: 6487561 (2002-11-01), Ofek et al.
patent: 6502166 (2002-12-01), Cassidy
patent: 6671757 (2003-12-01), Mutler et al.
patent: 6694336 (2004-02-01), Multer et al.
patent: 6826711 (2004-11-01), Moulton et al.
patent: 7069385 (2006-06-01), Fujimoto et al.
patent: 7089448 (2006-08-01), Hinshaw et al.
patent: 7155466 (2006-12-01), Rodriguez et al.
patent: 7159150 (2007-01-01), Kenchammana-Hosekote et al.
patent: 7231493 (2007-06-01), Nguyen et al.
patent: 7315958 (2008-01-01), Bridge, Jr.
patent: 7415486 (2008-08-01), Mutler
patent: 7457980 (2008-11-01), Yang et al.
patent: 2002/0029227 (2002-03-01), Multer et al.
patent: 2002/0040369 (2002-04-01), Multer et al.
patent: 2002/0059540 (2002-05-01), Mann et al.
patent: 2003/0088803 (2003-05-01), Arnott et al.
patent: 2003/0105923 (2003-06-01), Bak et al.
patent: 2003/0221063 (2003-11-01), Eguchi et al.
patent: 2004/0073831 (2004-04-01), Yanai et al.
patent: 2004/0088483 (2004-05-01), Chatterjee et al.
patent: 2004/0250031 (2004-12-01), Ji et al.
patent: 2005/0091391 (2005-04-01), Burton et al.
patent: 2005/0102551 (2005-05-01), Watanabe
patent: 2005/0114350 (2005-05-01), Rose et al.
patent: 2005/0228957 (2005-10-01), Satoyama et al.
patent: 2005/0273565 (2005-12-01), Hirakawa et al.
patent: 2006/0206542 (2006-09-01), Wolfgang et al.
patent: 2006/0236047 (2006-10-01), Shitomi
patent: 2007/0150677 (2007-06-01), Homma et al.
patent: 2008/0052480 (2008-02-01), Satoyama et al.
patent: 2008/0104443 (2008-05-01), Akutsu et al.
patent: 2008/0244205 (2008-10-01), Amano et al.
patent: 2009/0044046 (2009-02-01), Yamasaki
patent: 2009/0055608 (2009-02-01), Yamasaki
Intel (Publisher). “PRO/10 Adapter: Reducing Bottlenecks for Maximum Performance”. 2004. URL: http://www.intel.com/support
etwork/adapter/pro100/sb/cs-010531.htm.
U.S. Official Action dated Mar. 16, 2009 in U.S. Appl. No. 11/551,303.
U.S. Official Action dated Dec. 23, 2008 in U.S. Appl. No. 11/551,311.
U.S. Appl. No. 11/551,291, filed Oct. 20, 2006, entitled “Providing Redundancy in a Storage System,” Inventors: Chatterjee et al.
U.S. Appl. No. 11/551,303, filed Oct. 20, 2006, entitled “Background Movement of Data Between Nodes in a Storage Cluster,” Inventors: Chatterjee et al.
U.S. Appl. No. 11/551,311, filed Oct. 20, 2006, entitled “Distributed Hot-Spare Storage in a Storage Cluster,” Inventors: Chatterjee et al.
U.S. Appl. No. 11/695,673, filed Apr. 3, 2007, entitled “Snapshot-Assisted Data Replication,” Inventors: Chatterjee et al.
U.S. Appl. No. 12/013,110, filed Jan. 11, 2008, entitled “Maintaining Data Consistency in Mirrored Cluster Storage Systems Using Bitmap Write-Intent Logging,” Inventors: Chatterjee et al.
U.S. Appl. No. 12/013,116, filed Jan. 11, 2008, entitled “Maintaining Data Consistency in Mirrored Cluster Storage Systems With Write-Back Cache,” Inventors: Chatterjee et al.
U.S. Official Action dated Jul. 28, 2008 in U.S. Appl. No. 11/551,303.
U.S. Official Action dated Mar. 20, 2009 in U.S. Appl. No. 11/551,291.
U.S. Official Action dated Mar. 27, 2009 in U.S. Appl. No. 11/695,673.
U.S. Official Action dated Aug. 17, 2009 in U.S. Appl. No. 11/551,303.
U.S. Official Action dated Oct. 5, 2009 in U.S. Appl. No. 11/551,291.
U.S. Official Action dated Jul. 8, 2009 in U.S. Appl. No. 11/551,311.
U.S. Official Action dated Dec. 28, 2009 in U.S. Appl. No. 11/551,311.
U.S. Notice of Allowance/Allowability dated Mar. 23, 2010 in U.S. Appl. No. 11/551,303.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Asynchronous data replication does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Asynchronous data replication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous data replication will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4215706

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.