Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition
Reexamination Certificate
2007-12-18
2007-12-18
Shah, Sanjiv (Department: 2185)
Electrical computers and digital processing systems: memory
Storage accessing and control
Specific memory composition
C714S002000, C714S003000, C714S005110, C714S006130, C714S006130, C714S006130, C714S769000, C714S770000
Reexamination Certificate
active
10693758
ABSTRACT:
A method of reading data comprises receiving a request for a stripe of erasure coded data, sending read messages to at least a quorum of storage devices, and receiving at least the quorum of reply messages from the devices. The quorum of the reply messages includes at least a minimum number of stripe blocks needed to decode the data. The quorum meets 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. A method of writing data comprises generating a timestamp, encoding the data, sending query messages including the timestamp to the storage devices, receiving query reply messages from each of at least the quorum of the devices, sending write messages to the devices, and receiving a write reply message from each of at least the quorum of the devices.
REFERENCES:
patent: 6973556 (2005-12-01), Milligan et al.
patent: 2002/0083379 (2002-06-01), Nishikawa et al.
patent: 2004/0064633 (2004-04-01), Oota
patent: 2004/0158677 (2004-08-01), Dodd
patent: 2005/0091450 (2005-04-01), Frolund et al.
patent: 2005/0091556 (2005-04-01), Frolund et al.
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. Dotev, 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.
Attiya, H:“Efficient and Robust Sharing of Memory in Message-Passing Systems” workshop on distributed algorithms, Oct. 1996, pp. 1-18.
Frolund Svend
Merchant Arif
Saito Yasusuhi
Spence Susan
Veitch Alistar
Rojas Midys
Shah Sanjiv
LandOfFree
Methods of reading and writing data does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods of reading and writing data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods of reading and writing data will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3893833