Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2005-02-03
2010-10-26
Bullock, Jr., Lewis A (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S104000, C709S219000, C709S226000, C711S216000
Reexamination Certificate
active
07823156
ABSTRACT:
An embodiment of a method of hashing an address space to a plurality of storage servers begins with a first step of dividing the address space by a number of the storage servers to form data segments. Each data segment comprises a base address. A second step assigns the data segments to the storage servers according to a sequence. The method continues with a third step of measuring a load on each of the storage servers. According to an embodiment, the method concludes with a fourth step of adjusting data shares assigned to the storage servers according to the sequence to approximately balances the loads on the storage servers while maintaining the base address for each data segment on an originally assigned storage server. According to another embodiment, the method periodically performs the third and fourth steps to maintain an approximately balanced load on the storage servers.
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: 6601084 (2003-07-01), Bhaskaran et al.
patent: 6912585 (2005-06-01), Taylor et al.
patent: 6922724 (2005-07-01), Freeman et al.
patent: 7085271 (2006-08-01), Gooch
patent: 7231445 (2007-06-01), Aweya et al.
patent: 7266668 (2007-09-01), Hartung et al.
patent: 7290168 (2007-10-01), DeKoning
patent: 7546354 (2009-06-01), Fan et al.
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.
patent: 2006/0174063 (2006-08-01), Soules et al.
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.
Hyde, Randall “Write Great Code” Nov. 2004, No Starch, Chapter 11, Section 11:1, The Memory Hierarchy and Section 11:2 How the Memory Hierarchy Operates (7 pages).
Pei, Cai et al; Cost-Aware WWW Proxy Caching Algorithms, USENIX Symposium on Internet Technologies and Systems, Dec. 1997 (15 pages).
Michael Rabinovich et al, “Not All Hits Are Created Equal: Cooperative Proxy Caching Over a Wide-Area Network,” 1998, (pp. 1-10).
Markus Sinnwell, et al, A Cost Model Based Online Method for Distributed Caching, 1997 (10 pages).
U.S. Appl. No. 11/051,435, Examiner's Answers dated Apr. 18, 2008, pp. 1-27 with attachments.
U.S. Appl. No. 11/051,435, Office Action dated Mar. 13, 2007, pp. 1-19 with attachments.
U.S. Appl. No. 11/051,435, Office Action dated Jun. 28, 2007, pp. 1-22.
Merchant Arif
Saito Yasushi
Soules Craig
Veitch Alistair C.
Bullock, Jr. Lewis A
Hewlett--Packard Development Company, L.P.
Lee Tammy
LandOfFree
Method of hashing address space to storage servers 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 hashing address space to storage servers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of hashing address space to storage servers will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4210610