Error detection/correction and fault detection/recovery – Data processing system error or fault handling – Reliability and availability
Reexamination Certificate
2007-09-04
2007-09-04
Baderman, Scott (Department: 2114)
Error detection/correction and fault detection/recovery
Data processing system error or fault handling
Reliability and availability
C714S005110, C714S006130, C714S770000
Reexamination Certificate
active
10693743
ABSTRACT:
A method of recovering a stripe of erasure coded data begins with sending query messages to storage devices. The method continues with receiving query reply messages from at least a first quorum of the storage devices. The query reply messages include a minimum number of the stripe blocks needed to decode the stripe. Following this, the stripe of erasure coded data is encoded. Next, a write message is sent to each of the storage devices, which include a timestamp and the stripe block destined for the storage device. The method concludes with receiving a write reply message from at least a second quorum of the storage devices indicating that the stripe block was successfully stored. The first and second quorums each meet a quorum condition of a number such that any two selections of the number of the stripe blocks intersect in the minimum number of the stripe blocks.
REFERENCES:
patent: 6178536 (2001-01-01), Sorkin
patent: 6614366 (2003-09-01), Luby
patent: 6823425 (2004-11-01), Ghosh et al.
patent: 6970987 (2005-11-01), Ji et al.
patent: 7057534 (2006-06-01), Luby
patent: 7159150 (2007-01-01), Kenchammana-Hosekote et al.
patent: 2004/0049643 (2004-03-01), Alvarez et al.
patent: 2005/0091450 (2005-04-01), Frolund et al.
patent: 2005/0091451 (2005-04-01), Frolund et al.
patent: 2005/0091556 (2005-04-01), Frolund et al.
patent: 2006/0174063 (2006-08-01), Soules et al.
www.ilib.com, A Fault Detection Mechanism in Erasure-Code Byzantine Fault-Tolerance Quorum, Jun. 12, 2006, http://scholar.ilib.cn/A-whdxxb-e20060612.html.
Anderson, James W., et al, Robust Disctributed Storage Using Erasure Codes, Dec. 5, 2002, pdos.csail.mit.edu/6.82-2002/projects/erasure.ps.
U.S. Appl. No. 10/440,531, Veitch et al.
U.S. Appl. No. 10/440,548, Frolund et al.
U.S. Appl. No. 10/440,570, Merchant et al.
K. Amiri and G. A. Gibson and R. A. Golding, Highly concurrent shared storage, The 20th International Conference on Distributed Computing Systems (ICDCS 2000), Apr. 10-13, 2000, Taipei, Taiwan, pp. 298-307, IEEE Computer Society, Los Alamitos, CA, 2000.
H. Attiya, A. Bar-Noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol. 42, Issue 1, Jan. 1995, pp. 124-142, ACM Press, New York, NY, 1995.
P. Dutta, S. Frolund, R. Guerraoui, and B. Pochon, An efficient universal construction for message-passing systems, EPFL Technical Report IC-TR-2000228, May 2002.
S. Frolund, A. Merchant, Y. Saito, S. Spence, and A. Veitch, FAB: Enterprise storage systems on a shoestring, Proceedings of HOTOS IX: The Ninth Workshop on Hot topics in Operating Systems, Lihue, Hawaii, May 18-21, 2003, pp. 169-174, The USENIX Association, Berkeley, CA, 2003.
G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter, Decentralized storage consistency via versioning servers, Technical Report CMU-CS-02-180, School of Computer Science, Carnegie Mellon University, Pittsburg, PA, Sep. 2002.
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, Oceanstore: An architecture for global-scale persistent storage, Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IX), Cambridge, MA, pp. 190-201, ACM Press, New York, NY, Nov. 2000.
L. Lamport, On interprocess communication, Dec. 25, 1985.
E. K. Lee and C. A. Thekkath, Petal: Distributed virtual disks, Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), Cambridge, MA, pp. 84-92, ACM Press, New York, NY, 1996.
N. A. Lynch and A. A. Shvartsman, Robust emulation of shared memory using dynamic quorum acknowledged broadcasts, Dec. 2, 1996.
N. A. Lynch and A. A. Shvartsman, Rambo: A reconfigurable atomic memory service for dynamic networks, Distributed Computing: 16th International Conference, DISC 2002, Toulouse, France, Oct. 28-30, 2002, Proceedings, pp. 173-190, Springer-Verlag Heidelberg, Heidelberg, Germany, 2002.
D. Malkhi and M. Reiter. Byzantine quorum systems, Oct. 16, 1998.
J. S. Plank, A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems, Software: Practice and Experience, Sep. 1997, vol. 27, Issue 9, pp. 995-1012, John Wiley & Sons, Limited, Hoboken, NJ, 1997.
H. Weatherspoon and J. Kubiatowicz, Erasure coding vs. replication: A quantitative comparison, Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
Zhang Z, Lian Q:“Reperasure: Replication Protocol using Erasure-cored in Peer-to-Peer Storage Network” Proceedings 21st IEEE Symposium on Reliable Distibuted Systems, Oct. 13, 2002.
Frolund Svend
Merchant Arif
Saito Yasusuhi
Spence Susan
Veitch Alistar
Baderman Scott
Bonura Tim
Hewlett--Packard Development Company, L.P.
LandOfFree
Method and recovery of data using erasure coded data from... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and recovery of data using erasure coded data from..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and recovery of data using erasure coded data from... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3748944