Transaction-based storage system and method that uses...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S006000

Reexamination Certificate

active

07600075

ABSTRACT:
The present invention provides a storage system for storing variable sized objects. The storage system is preferably a transaction-based system that uses variable sized objects to store data. The storage system is preferably implemented using arrays disks that are arranged in ranks. Each rank includes multiple stripes. Each stripe may be read and written as a convenient unit for maximum performance. A rank manager is able to dynamically configure the ranks to adjust for failed and added disks by selectively shortening and lengthening the stripes. The storage system may include a stripe space table that contains entries describing the amount of space used in each stripe. An object map provides entries for each object in the storage system describing the location (e.g., rank, stripe and offset values), the length and version of the object. A volume index translates regions of logical storage into object identifiers. The storage system may implement various types of formats such as I-node, binary tree and extendible hashing formats.

REFERENCES:
patent: 5233616 (1993-08-01), Callander
patent: 5357475 (1994-10-01), Hasburn et al.
patent: 5630104 (1997-05-01), Ottesen et al.
patent: 5933834 (1999-08-01), Aichelen
patent: 5974424 (1999-10-01), Schmuck et al.
patent: 6119118 (2000-09-01), Kain et al.
patent: 6230312 (2001-05-01), Hunt
patent: 6571351 (2003-05-01), Mitaru et al.
patent: 6671772 (2003-12-01), Cousins
patent: 6871272 (2005-03-01), Butterworth
patent: 2002/0087823 (2002-07-01), Chow et al.
patent: 2002/0103815 (2002-08-01), Duvillier et al.
patent: 2003/0131173 (2003-07-01), Cassidy et al.
patent: 2004/0054858 (2004-03-01), Chandrasekaran et al.
patent: 2004/0193719 (2004-09-01), Yang et al.
patent: 2004/0205387 (2004-10-01), Kleiman et al.
patent: 2005/0021713 (2005-01-01), Dugan et al.
patent: 2005/0114596 (2005-05-01), Golding
“File System Implementation,” http://www.isi.edu/˜faber/cs402
otes/lecture20.pdf, Apr. 21, 2003.
J. Nievergelt, “Binary Search Trees and File Organization,” 1974, Computing Surveys, vol. 6, No. 3, Sep. 1974.
Harold Fagin et al., “Extendible Hashing—A Fast Access Method for Dynamic Files,” 1979, ACM Transactions on Database Systems, vol. 4, pp. 315-344, Sep. 1979.
Helen Custer, “Inside the Windows NT File System,” 1994, Microsoft Press, pp. 24-27, Jun. 1994.
Jai Memon, A Performance Comparison of RAID-5 and Log-Structured Arrays, 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing, pp. 167-178, Aug. 1995.

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

Transaction-based storage system and method that uses... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Transaction-based storage system and method that uses..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transaction-based storage system and method that uses... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4128385

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