Rolling cache configuration for a data replication system

Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C714S006130, C714S012000, C714S016000, C707S793000

Reexamination Certificate

active

07661028

ABSTRACT:
Performing data management operations on replicated data in a computer network. Log entries are generated for data management operations of an application executing on a source system. Consistency point entries are used to indicate a time of a known good, or recoverable, state of the application. A destination system is configured to process a copy of the log and consistency point entries to replicate data in a replication volume, the replicated data being a copy of the application data on the source system. When the replicated data represents a known good state of the application, as determined by the consistency point entries, the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replicated data and to logically associate the copied data with a time information (e.g., time stamp) indicative of the source system time when the application was in the known good state.

REFERENCES:
patent: 4686620 (1987-08-01), Ng
patent: 5193154 (1993-03-01), Kitajima et al.
patent: 5241668 (1993-08-01), Eastridge et al.
patent: 5241670 (1993-08-01), Eastridge et al.
patent: 5276867 (1994-01-01), Kenley et al.
patent: 5333315 (1994-07-01), Saether et al.
patent: 5347653 (1994-09-01), Flynn et al.
patent: 5410700 (1995-04-01), Fecteau et al.
patent: 5544347 (1996-08-01), Yanai et al.
patent: 5559957 (1996-09-01), Balk
patent: 5559991 (1996-09-01), Kanfi
patent: 5615392 (1997-03-01), Harrison et al.
patent: 5638509 (1997-06-01), Dunphy et al.
patent: 5642496 (1997-06-01), Kanfi
patent: 5682513 (1997-10-01), Candelaria et al.
patent: 5687343 (1997-11-01), Fecteau et al.
patent: 5729743 (1998-03-01), Squibb
patent: 5737747 (1998-04-01), Vishlitsky et al.
patent: 5742792 (1998-04-01), Yanai et al.
patent: 5751997 (1998-05-01), Kullick et al.
patent: 5758359 (1998-05-01), Saxon
patent: 5761677 (1998-06-01), Senator et al.
patent: 5813009 (1998-09-01), Johnson et al.
patent: 5813017 (1998-09-01), Morris
patent: 5901327 (1999-05-01), Ofek
patent: 5924102 (1999-07-01), Perks
patent: 5987478 (1999-11-01), See et al.
patent: 6021415 (2000-02-01), Cannon et al.
patent: 6076148 (2000-06-01), Kedem et al.
patent: 6148412 (2000-11-01), Cannon et al.
patent: 6154787 (2000-11-01), Urevig et al.
patent: 6161111 (2000-12-01), Mutalik et al.
patent: 6163856 (2000-12-01), Dion et al.
patent: 6167402 (2000-12-01), Yeager
patent: 6230282 (2001-05-01), Zhang
patent: 6269431 (2001-07-01), Dunham
patent: 6275953 (2001-08-01), Vahalia et al.
patent: 6301592 (2001-10-01), Aoyama et al.
patent: 6324581 (2001-11-01), Xu et al.
patent: 6330570 (2001-12-01), Crighton et al.
patent: 6343324 (2002-01-01), Hubis et al.
patent: 6460055 (2002-10-01), Midgley et al.
patent: 6487561 (2002-11-01), Ofek et al.
patent: 6487644 (2002-11-01), Huebsch et al.
patent: 6542972 (2003-04-01), Ignatius et al.
patent: 6564228 (2003-05-01), O'Connor
patent: 6581143 (2003-06-01), Gagne et al.
patent: 6658436 (2003-12-01), Oshinsy et al.
patent: 6658526 (2003-12-01), Nguyen et al.
patent: 6681230 (2004-01-01), Blott et al.
patent: 6732124 (2004-05-01), Koseki et al.
patent: 6748504 (2004-06-01), Sawdon et al.
patent: 6751635 (2004-06-01), Chen et al.
patent: 6892211 (2005-05-01), Hitz et al.
patent: 7051050 (2006-05-01), Chen et al.
patent: 7058850 (2006-06-01), Cochran
patent: 7065538 (2006-06-01), Aronoff et al.
patent: 7139932 (2006-11-01), Watanabe
patent: 7228456 (2007-06-01), Lecrone et al.
patent: 7246207 (2007-07-01), Kottomtharayil et al.
patent: 2002/0004883 (2002-01-01), Nguyen et al.
patent: 2003/0074600 (2003-04-01), Tamatsu
patent: 2003/0177321 (2003-09-01), Watanabe
patent: 2003/0187847 (2003-10-01), Lubbers et al.
patent: 2004/0010487 (2004-01-01), Prahlad et al.
patent: 2005/0080928 (2005-04-01), Beverly et al.
patent: 2005/0114406 (2005-05-01), Borthakur et al.
patent: 2005/0144202 (2005-06-01), Chen
patent: 2005/0188254 (2005-08-01), Urabe et al.
patent: 2005/0246376 (2005-11-01), Lu et al.
patent: 2006/0010154 (2006-01-01), Prahlad et al.
patent: 2006/0020616 (2006-01-01), Hardy et al.
patent: 2006/0136685 (2006-06-01), Griv et al.
patent: 2006/0230244 (2006-10-01), Amarendran et al.
patent: 2007/0143371 (2007-06-01), Kottomtharayil
patent: 2007/0143756 (2007-06-01), Gokhale
patent: 2007/0183224 (2007-08-01), Erofeev
patent: 2007/0185852 (2007-08-01), Erofeev
patent: 2007/0185937 (2007-08-01), Prahlad et al.
patent: 2007/0185938 (2007-08-01), Prahlad et al.
patent: 2007/0185939 (2007-08-01), Prahlad et al.
patent: 2007/0186068 (2007-08-01), Agrawal
patent: 0405926 (1991-01-01), None
patent: 0467546 (1992-01-01), None
patent: 0774715 (1997-05-01), None
patent: 0862304 (1998-09-01), None
patent: 0899662 (1999-03-01), None
patent: 0981090 (2000-02-01), None
patent: WO 99/14692 (1999-03-01), None
patent: WO 02/095632 (2002-11-01), None
patent: WO 2005/055093 (2005-06-01), None
Large Memory Support version from May 9, 2004 found via the WayBack Machine http://lists.danga.com/pipermail/memcached/2004-February/000508.html.
Wikipedia's Threading version from Dec. 15, 2005 http://en.wikipedia.org/w/index.php?title=Thread—(computer—science)&oldid=31432496.
Wiesmann M: “Database replication techniques: a three parameter classification”; Oct. 16, 2000; pp. 206-215.
The Oracle8 Replication Manual, Part No. A58245-01; Chapters 1-2; Dec. 1, 1997; obtained from website: http://download-west.oracle.com/docs/cd/A64702—01/doc/server.805/a58245/toc.htm on May 20, 2009.
Lyon J: “Design considerations in replicated database systems for disaster protection”; COMPCON 1988; Feb. 29, 1988; pp. 428-430.
Gray, Jim, Reuter, Andreas: “Transaction Processing: Concepts and Techniques” 1994, Morgan Kaufmann Publisher, USA; pp. 646-655.
European Examination Report ; Application No. 06848901.2; Apr. 1, 2009; 7 pages.
Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,”IEEE, 1995, pp. 190-199.
Arneson, David A., Control Data Corporation,Development of Omniserver; Mass Storage Systems, 1990, pp. 88-93.
Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31, 1988-Nov. 3, 1988, pp. 45-50, Monterey, CA.
Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.
Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,”IEEE, 1994, pp. 124-126.
Jander, M., “Launching Storage-Area Net,”Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.
Jason Gait, “The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks,”IEEE COMPUTER, vol. 21, No. 6, pp. 11-22 (1988) (see in particular figure 5 in p. 15 and recitation in claim 5).
Rosenblum et al., “The Design and Implementation of a Log-Structured File System,”Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991).

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

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

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

Rate now

     

Profile ID: LFUS-PAI-O-4152357

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