System pre-allocating data object replicas for a distributed...

Electrical computers and digital processing systems: multicomput – Multicomputer data transferring via shared memory – Accessing another computer's memory

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S213000, C710S056000

Reexamination Certificate

active

07433928

ABSTRACT:
A system and method for pre-allocating replicas for a distributed file sharing system. Creating a new file may involve creating a plurality of replicas for the file on a plurality of nodes. In one embodiment nodes in the system may pre-allocate sets of file replicas, where the pre-allocated replicas can be used to satisfy requests to create new files. Pre-allocating the file replicas may decrease the latency of file creation requests by enabling the requests to be satisfied without performing replica allocation in response to the requests.

REFERENCES:
patent: 5689706 (1997-11-01), Rao et al.
patent: 5832512 (1998-11-01), Mastors et al.
patent: 6173293 (2001-01-01), Thekkath et al.
patent: 6460082 (2002-10-01), Lumelsky et al.
patent: 6625604 (2003-09-01), Muntz et al.
patent: 6697878 (2004-02-01), Imai
patent: 6748381 (2004-06-01), Chao et al.
patent: 6763440 (2004-07-01), Traversat et al.
patent: 6782389 (2004-08-01), Chrin et al.
patent: 6839769 (2005-01-01), Needham et al.
patent: 7139811 (2006-11-01), Lev Ran et al.
patent: 2002/0065919 (2002-05-01), Taylor
patent: 2002/0091751 (2002-07-01), Sonoda et al.
patent: 2002/0114341 (2002-08-01), Sutherland
patent: 2002/0147815 (2002-10-01), Tormasov
patent: 2002/0161848 (2002-10-01), Willman et al.
patent: 2003/0093441 (2003-05-01), Cooke et al.
patent: 2003/0108119 (2003-06-01), Mohebbi et al.
patent: 2003/0187947 (2003-10-01), Lubbers et al.
patent: 2005/0091215 (2005-04-01), Chandra et al.
“Lustre: A Scalable, High-Performance File System,” Cluster File Systems, Inc., pp. 1-13, Nov. 2002.
A. Rowstron and P. Druschel. “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems.” In Proc.IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov. 2001.
Zhao, et al “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing”UCB Tech. Report UCB/CSD-01-1141. Apr. 2001.
Stoica, et al “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,”ACMSIGCOMM 2001, San Diego, CA, Aug. 2001, pp. 149-160.
Manku, et al, “Symphony: Distributed Hashing in a Small World” Published in USITS, 2003.
Kubiatowicz, et al “OceanStore: An Architecture for Global-scale Persistent Storage”Proceedings of ACM ASPLOS, Nov. 2000.
Adya, et al; “FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment”;Proceedings of the 5THOSDI, Dec. 2002.
Garces-Erice, et al; “Hierarchical Peer-to-Peer Systems,” In the Special issue of theParallel Processing Letters(PPL), Dec. 2003, vol. 13, No. 4.
“Lustre Whitepaper Version 1.0” Cluster File Systems, Inc., Nov. 11, 2002.
“Sun StorEdge™ QFS and SAM-FS Software Technical Overview,” Sun Microsystems, Mar. 2004.
“Large Scale Peer-to-Peer Experiments with Virtual Private Community (VPC) Framework,” Iwao, et al., CIA 2002, LNAI 2446, pp. 66-81, 2002.
“BestPeer: A Self-Configurable Peer-to-Peer System,” Ng, et al, Department of Computer Science, National University of Singapore, pp. 1-21, no date.

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

System pre-allocating data object replicas for a distributed... 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 pre-allocating data object replicas for a distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System pre-allocating data object replicas for a distributed... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3989500

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