Asynchronous data redundancy technique

Details Asynchronous data redundancy technique Asynchronous data redundancy technique

2003-06-06

2008-05-27

Sparks, Donald (Department: 2187)

Electrical computers and digital processing systems: memory

Storage accessing and control

Control technique

C710S052000

Reexamination Certificate

active

07380081

ABSTRACT:
A primary copy of data is held at a primary storage facility, while data that is redundant of the primary copy is held at a secondary storage facility. To inhibit propagation of errors from the primary copy to the redundant data, write transactions to the redundant data are queued at the second storage facility, until a specified time elapses or until a specified event occurs (or until combination hereof occurs). Write transactions may be collected in groups at the primary facility prior to forwarding to the secondary facility and may also be batched at the secondary facility prior to being applied to the redundant data. Overwrites may be allowed within a group at the primary facility to conserve communication bandwidth between the primary and secondary storage facilities. Overwrites may be allowed within a batch at the secondary facility to conserve space occupied by the transactions at the secondary facility.

REFERENCES:
patent: 5544347 (1996-08-01), Yanai et al.
patent: 5592618 (1997-01-01), Micka et al.
patent: 5742792 (1998-04-01), Yanai et al.
patent: 5909692 (1999-06-01), Yanai et al.
patent: 6092066 (2000-07-01), Ofek
patent: 6101497 (2000-08-01), Ofek
patent: 6108748 (2000-08-01), Ofek et al.
patent: 6260125 (2001-07-01), McDowell
patent: 6397307 (2002-05-01), Ohran
patent: 6405294 (2002-06-01), Hayter
patent: 6496908 (2002-12-01), Kamvysselis et al.
patent: 6502205 (2002-12-01), Yanai et al.
patent: 6842825 (2005-01-01), Geiner et al.
patent: 6931576 (2005-08-01), Morrison et al.
patent: 2003/0101321 (2003-05-01), Ohran
patent: 2003/0135478 (2003-07-01), Marshall et al.
patent: 2003/0225760 (2003-12-01), Ruuth et al.
Charles P. Pfleeger, Security in Computing, 1997, Prentice Hall, Second Edition, pp. 8-10.
Fay Chang, Minwen Ji, Shun-Tak A. Leung, John MacCormick, Sharon E. Perl and Li Zhang, Myriad: Cost-effective Disaster Tolerance, Proceedings of the FAST 2002 Conference on File and Storagae Technologies, Monterey, CA, pp. 103-116, The USENIX Association, Berkeley, CA, Jan. 2002.
Chia Chao, Robert English, David Jacobson, Alexander Stepanov, and John Wilkes, Mime: a high performance parallel storage device with strong recovery guarantees, HP Laboratories Technical Report HPL-CSP-92-9 rev 1, Mar. 18, 1992, revised Nov. 6, 1992, Hewlett-Packard Company, Palo Alto, CA, 1992.
Remote Copy Administrator's Guide and Reference, IBM DFSMS/MVS Version 1, Fourth Edition, pp. i to xv and pp. 1 thru 170, International Business Machines Corporation, Raleigh, NC, Dec. 1997.
Hugo Patterson, Stephen Manley, Mike Federwisch, Dave Hitz, Steve Kleiman and Shane Owara, SnapMirror: File System Based Asynchronous Mirroring for Disaster Recovery, Proceedings of the FAST 2002 Conference on File and Storagae Technologies, Monterey, CA, pp. 117-129, The USENIX Association, Berkeley, CA, Jan. 2002.
Symmetrix Remote Data Facility (SRDF) Product Description Guide, EMC Corporation, Hopkinton, MA, USA, 2000.
Michael Stonebraker and Gerhard A. Schloss, Distributed Raid—A New Multiple Copy Algorithm, UCB Electronics Research Laboratory Technical Report ERL-M89-56, Electronics Research Laboratory, University of California, Berkeley, CA, 1989.
EMC TimeFinder Product Description Guide, EMC Corporation, Hopkinton, Massachusetts, USA, 1998.

Affiliated with

Also associated with

Rating

Asynchronous data redundancy technique 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 redundancy technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous data redundancy technique will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3984731