Method of cooperative caching for distributed storage system

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S148000, C709S223000, C709S224000, C709S226000, C718S105000

Reexamination Certificate

active

08055845

ABSTRACT:
An embodiment of a method of cooperative caching for a distributed storage system begins with a step of requesting data from storage devices which hold the data. The method continues with a step of receiving any cached blocks and expected response times for providing non-cached blocks from the storage devices. The method concludes with a step of requesting a sufficient number of the non-cached blocks from one or more particular storage devices which provides an expectation of optimal performance.

REFERENCES:
patent: 5544318 (1996-08-01), Schmitz et al.
patent: 5740465 (1998-04-01), Matsunami et al.
patent: 6415372 (2002-07-01), Zakai et al.
patent: 6418510 (2002-07-01), Lamberts
patent: 2002/0087783 (2002-07-01), Leonhardt et al.
patent: 2002/0133537 (2002-09-01), Lau et al.
patent: 2002/0184403 (2002-12-01), Dahlin et al.
patent: 2005/0044229 (2005-02-01), Brown et al.
Pei Cao, Sandy Irani; Cost-Aware WWW Proxy Caching Algorithms, USENIX Symposium on Internet Technologies and Systems; Dec. 1997.
Michael Rabinovich, Jeff Chase, Syam Gadde; Not All Hits Are Created Equal: Cooperative Proxy Caching Over a Wide-Area Network, 1998.
Hyde, Randall “Write Great Code” Pub. data: Nov. 2004 Publisher: No Starch, Chapter 11 section 11.1: The memory . Hierarchy and section 11.2: How the Memory Hierarchy Operates.
Thomas E. Anderson et al., Serverless Network File Systems, ACM, Inc., New York, NY, 1995.
Toni Cortes et al., Design Issues of a Cooperative Cache with no Coherence Problems, 1997.
Michael D. Dahlin et al., Cooperative Caching: Using Remote Client Memory to Improve File System Performance, 1994.
Svend Frølund et al., FAB: enterprise storage systems on a shoestring, 2003.
Gregory R. Ganger et al., Self-* Storage: Brick-based storage with automated administration, Aug. 2003.
David Karger et al., Consistent Hashing and Random Trees: Distributed Cashing Protocols for Relieving Hot Spots on the World Wide Web, 1997.
Nimrod Megiddo et al., ARC: A Self-Tuning, Low Overhead Replacement Cache, Proceedings of FAST '03: 2nd USENIX Conference on File and Storage Technologies, pp. 115-130, The USENIX Association, Berkeley, CA, Mar. 31, 2003.
Anoop Ninan et al., Scalable Consistency Maintenance in Content Distribution Networks Using Cooperative Leases, 2003.
Pablo Rodriguez et al., Parallel-Access for Mirror Sites in the Internet, 2000.
Pablo Rodriguez et al., Web Caching Architectures: Hierarchial and Distributed Cashing, Jan. 18, 1999.
Antony Rowstron et al., Storage management and caching in PAST, a large-scale persistent peer-to-peer storage utility, SOSP-18, ACM Press, New York, NY, 2001.
Prasenjit Sarkar et al., Efficient Cooperative Caching using Hints, 1996.
Markus Sinnwell et al., A Cost-Model-Based Online Method for Distributed Caching, 1997.
Ion Stoica et al Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications, 2001.
Mohammed Javeed Zaki, et al., Customized Dynamic Load Balancing for a Network of Workstations, Dec. 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

Method of cooperative caching for distributed storage system 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 of cooperative caching for distributed storage system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of cooperative caching for distributed storage system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4256028

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