System and method for content addressable storage

Details System and method for content addressable storage System and method for content addressable storage

2008-03-05

2010-06-29

Lewis, Cheryl (Department: 2167)

Data processing: database and file management or data structures

File management

File systems

C707S648000

Reexamination Certificate

active

07747663

ABSTRACT:
Information, such as files received from a client, etc., is stored in a storage system, such as a content addressable storage system. A file server receives data from a client and chunks the data into blocks of data. The file server also generates metadata for use in forming a data structure. The blocks of data are stored in a block store and a copy of the data blocks and the metadata are locally cached at the file server. A commit server retrieves the metadata. In at least one embodiment, the metadata is retrieved from an update log shared between the file server and the commit server. Based on the retrieved metadata, the commit server generates a version of a data structure. The data structure is then stored at the block store.

REFERENCES:
patent: 7010721 (2006-03-01), Vincent
patent: 7133963 (2006-11-01), Gilfix et al.
patent: 7415731 (2008-08-01), Carpentier et al.
patent: 7653832 (2010-01-01), Faibish et al.
patent: 7676514 (2010-03-01), Faibish et al.
patent: 2005/0071593 (2005-03-01), Vincent
Abd-El-Malek, M., et al., “Ursa-Minor: Versatile Cluster-Based Storage”, Proceedings 4th USENIX Conf. on FAST 2005, Dec. 2005.
Cluster File Systems, Inc., “Lustre: A Scalable, High-Performance File System”, Nov. 2002.
Cox, L. P., et al., “Pastiche: Making Backup Cheap and Easy”, Proceedings 5th USENIX Symp. OSDI, Dec. 2002.
Dubnicki, C., et al., “FPN: A Distributed Hash Table for Commercial Applications”, Procceedings 13th Int'l. Symp. HPDC, p. 120-128, Jun. 2004.
Ganger, G. R., et al., “Soft Updates: A Solution to the Metadata Update Problem in File Systems”, ACM Transactions Computer Systems, 18(2), p. 127-153, May 2000.
Ghemawat, S., et al., “The Google File System”, Proceedings 19th ACM Symp. Operating Systems Principles, p. 29-43, New York 2003.
Hagmann, R., “Reimplementing the Cedar File System Using Logging and Group Commit”, Proceedings 11th ACM Symp. Operating Systems Principles, p. 155-162, Nov. 1987.
Kubiatowicz, J., et al., “OceanStore: An Architecture for Global-Scale Persistant Storage”, Proceedings 9th Int'l. Conf. ASPLOS, p. 190-202, Nov. 2000.
McKusick, M. K., et al., “A Fast File System for UNIX”, Computer Systems, 2 (3), p. 181-197, 1984.
Muthitacharoen, A., et al., “A Low-Bandwidth Network File System”, Proceedings 18th ACM Symp. Operating Systems Principles, p. 174-187, Oct. 2001.
Muthitacharoen, A., et al., “Ivy: A Read/Write Peer-to-Peer File System”, Proceedings 5th USENIX Symp. OSDI, p. 31-44, Dec. 2002.
Quinlan, S., et al., “Venti: A New Approach to Archival Storage”, Proceedings 1st USENIX Conf. FAST, Jan. 2002.
Rosenblum, M., et al., “The Design and Implementation of a Log-Structured File System”, ACM Transactions on Computer Systems, 10(1), p. 26-52, Feb. 1992.
Schmuck, F., et al., “GPFS: A Shared-Disk File System for Large Computing Clusters”, Proceedings 1st USENIX Conf. FAST, p. 231-244, Jan. 2002.
Sweeney, A., et al., “Scalability in the XFS File System”, Proceedings USENIX Tech. Conf., p. 1-14, Jan. 1996.
Thekkath, C. A., et al., “Frangipani: A Scalable Distributed File System”, Proceedings 16th ACM Symp. Operating Systems Principles, p. 224-237, 1997.
You, L. L., et al., “Deep Store: An Archival Storage System Architecture”, Proceedings 21st ICDE, Apr. 2005.

Affiliated with

Also associated with

Rating

System and method for content addressable storage does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for content addressable storage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for content addressable storage will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4201464