Methods of reading and writing data

Details Methods of reading and writing data Methods of reading and writing data

2005-11-17

2010-11-02

Rones, Charles (Department: 2164)

Data processing: database and file management or data structures

File or database maintenance

Synchronization

Reexamination Certificate

active

07827144

ABSTRACT:
An embodiment of a method of writing data includes issuing write messages to a replica set of storage devices. Write confirmations are received from at least a majority of the storage devices. An embodiment of a method reading data includes issuing read messages to a replica set of storage devices. Read confirmations are received from at least a first majority of the storage devices. Read commit messages are issued to the storage devices. Commit confirmations are received from at least a second majority of the storage devices.

REFERENCES:
patent: 5212788 (1993-05-01), Lomet et al.
patent: 5430869 (1995-07-01), Ishak et al.
patent: 5452445 (1995-09-01), Hallmark et al.
patent: 5504900 (1996-04-01), Raz
patent: 5546582 (1996-08-01), Brockmeyer et al.
patent: 5644763 (1997-07-01), Roy
patent: 5701480 (1997-12-01), Raz
patent: 5768538 (1998-06-01), Badovinatz et al.
patent: 5787459 (1998-07-01), Stallmo et al.
patent: 5799305 (1998-08-01), Bortvedt et al.
patent: 5920857 (1999-07-01), Rishe et al.
patent: 5953714 (1999-09-01), Abdullah
patent: 6052712 (2000-04-01), Badovinatz et al.
patent: 6148295 (2000-11-01), Megiddo et al.
patent: 6170063 (2001-01-01), Golding
patent: 6219667 (2001-04-01), Lu et al.
patent: 6421688 (2002-07-01), Song
patent: 2003/0131068 (2003-07-01), Hoshino et al.
patent: 2004/0210673 (2004-10-01), Cruciani et al.
patent: 2004/0230596 (2004-11-01), Veitch et al.
patent: 2004/0230624 (2004-11-01), Frolund et al.
patent: 2004/0230862 (2004-11-01), Merchant 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/0123212 (2006-06-01), Yagawa
patent: 2007/0192542 (2007-08-01), Frolund et al.
patent: 2007/0192544 (2007-08-01), Frolund et al.
patent: 1160682 (2001-12-01), None
Khalil Amiri et al., Highly concurrent shared storage, 2000, Pittsburgh, PA.
Khalil Amiri et al., Highly concurrent shared storage, The 20th International Conference on Distributed Computing Systems, 2000, pp. 298-307, IEEE Computer Society, Washington DC.
Hagit Attiya et al., Sharing Memory Robustly in Message-Passing Systems (Extended Abstract), Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 363-375, ACM Press, New York, NY.
Hagit Attiya et al., Sharing Memory Robustly in Message-Passing Systems, Journal of the Association for Computing Machinery, 1995, 42(1):124-142, ACM Press, New York, NY.
Steven Berson et al., Randomized Data Allocation for Real-time Disk I/0, 1996, Marina Del Rey, CA.
Partha Dutta et al., An Efficient Universal Construction for Message-Passing Systems (Preliminary Version), Technical Report EPFL/IC/20002/28, 2002, Swiss Federal Institute of Technology, Lausanne, Switzerland.
Svend Frølund et al., Building Storage Registers from Crash-Recovery Processes, HP Labs Technical Report HPL-SSP-2003-14, 2003, Hewlett-Packard Development Company, L.P., Palo Alto, CA. <http://www.hpl.hp.com/research/ssp/papers/ssp-2003-14.pdf>.
Svend Frølund et al., Fab: enterprise storage systems on a shoestring, Proceedings of HOTOS IX: The Ninth Workshop on Hot topics in Operating Systems, 2003, pp. 169-174, The USENIX Association, Berkeley, CA.
Svend Frølund et al., A Decentralized Algorithm for Erasure-Coded Virtual Disks, Jun. 28, 2004, Palo Alto, CA.
Garth R. Goodson et al., Decentralized Storage Consistency via Versioning Servers, Technical Report CMU-CS-02-180, 2002, Carnegie Mellon University, Pittsburg, PA, Sep. 2002.
Steven Hand et al., Mnemosyne: Peer-to-Peer Steganographic Storage, Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems, 2002, Rice University, Houston TX. <http://www.cs.rice.edu/Conferences/IPTPS02/107.pdf>.
Maurice P. Herlihy et al., Linearizability: A Correctness Condition for Concurrent Objects, ACM Transactions on Programming Languages and Systems, 1990, 12(3):463-492, ACM Press, New York, NY.
Hui-I Hsiao et al., Chained Declustering: A New Availability Strategy for Multiprocssor Database machines, 1990, University of Wisconsin, Madison, WI.
Hans-Peter Kriegel et al., Managing Intervals Efficiently in Object-Relational Databases, Proceedings 2000 VLDB Conference, 2000, pp. 407-418, Morgan Kaufmann Publishers, San Francisco, CA.
John Kubiatowicz et al., Oceanstore: An Architecture for Global-Scale Persistent Storage, Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, 2000, pp. 190-201, ACM Press, New York, NY.
Leslie Lamport, On Interprocess Communication, 1985, Mountain View, CA. <http://research.microsoft.com/users/lamport/pubs/interprocess.pdf>.
Leslie Lamport, The Part-Time Parliament, 2000, Mountain View, CA.
Edward K. Lee et al., Petal: Distributed Virtual Disks, Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, 1996, pp. 84-92, ACM Press, New York, NY.
Barbara Liskov et al., Replication in the Harp File System, 1991, Cambridge, MA.
Nancy Lynch et al., Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts, 1996, Cambridge, MA.
Nancy Lynch et al., Rambo: A Reconfigurable Atomic Memory Service for Dynamic Networks, Distributed Computing: 16th International Conference, 2002, pp. 173-190, Springer-Verlag, Heidelberg, Germany.
Dahlia Malkhi et al., Byzantine Quorum Systems, 1998, Florham Park, NJ.
Arif Merchant et al., Analytic Modeling of Clustered RAID with Mapping Based on Nearly Random Permutation, IEEE transactions on Computers, 1996, 45(3):367-373, IEEE Computer Society Press, Washington DC.
Gabriel Mizrahi, The Hashing Approach to the Internet File System Problem, M.A. Thesis, Department of Mathematics, 2001, University of Haifa, Israel, Nov. 2001.
James S. Plank, A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems, Software—Practice and Experience, 1997, 27(9):995-1012, John Wiley & Sons, Ltd., Hoboken, NJ.
Yasushi Saito et al., FAB: Building Distributed Enterprise Disk Arrays from Commodity Components, Oct. 7, 2004, Palo Alto, CA.
Jose Renato Santos et al., Comparing Random Data Allocation and Data Striping in Multimedia Servers, Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 2000, pp. 44-55, ACM Press, New York, NY.
Robert H. Thomas, A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases, ACM transactions on Database Systems, 1979, 4(2):180-209, ACM Press, New York, NY.
Hakim Weatherspoon et al., Erasure Coding vs. Replication: A Quantitative Comparison, 2002, Berkeley CA.
Avishai Wool, Quorum Systems in Replicated Databases: Science or Fiction?, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 21 (4):3-11, 1998, IEEE Computer Society Press, Washington DC.
Aguilera, M.K. et al, Strict linearizability and the power of aborting, HP Labs Tech. Report HPL 2003-241, Dec. 8, 2003, Palo Alto, CA (25 pages).
U.S. Appl. No. 11/357,815, Office Action dated May 14, 2009, pp. 1-7.
U.S. Appl. No. 11/357,815, Office Action dated Apr. 7, 2008, pp. 1-7 with attachments.
U.S. Appl. No. 11/357,776, Office Action dated Apr. 6, 2009, pp. 1-7 with attachments.

Affiliated with

Also associated with

Rating

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.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4211077