Efficiently linking storage object replicas in a computer...

Details Efficiently linking storage object replicas in a computer... Efficiently linking storage object replicas in a computer...

2003-11-07

2009-06-30

Nguyen, Thu Ha T (Department: 2453)

Electrical computers and digital processing systems: multicomput

Multicomputer data transferring via shared memory

C709S214000, C709S215000, C709S216000, C709S217000, C711S147000, C345S536000, C345S537000, C345S538000, C345S541000

Reexamination Certificate

active

07555527

ABSTRACT:
A system and method for efficiently linking together replicas of a storage object. The location of a first replica of the storage object may be stored on a node in a network. When new replicas of the storage object are created, the node that stores the new replica may efficiently lookup the location of the first replica and utilize the location information to perform an efficient process to link the new replica to the first replica and any other existing replicas by causing routing information to be created on various nodes.

REFERENCES:
patent: 4354229 (1982-10-01), Davis et al.
patent: 5606669 (1997-02-01), Bertin et al.
patent: 5689706 (1997-11-01), Rao et al.
patent: 5761421 (1998-06-01), van Hoff et al.
patent: 5764982 (1998-06-01), Madduri
patent: 5790553 (1998-08-01), Deaton, Jr. et al.
patent: 5802278 (1998-09-01), Isfeld et al.
patent: 5832195 (1998-11-01), Braun et al.
patent: 5918017 (1999-06-01), Attanasio et al.
patent: 5920566 (1999-07-01), Hendel et al.
patent: 5928326 (1999-07-01), Boudou et al.
patent: 6012096 (2000-01-01), Link et al.
patent: 6016478 (2000-01-01), Zhang et al.
patent: 6049823 (2000-04-01), Hwang
patent: 6088336 (2000-07-01), Tosey
patent: 6091724 (2000-07-01), Chandra et al.
patent: 6144992 (2000-11-01), Turpin et al.
patent: 6148383 (2000-11-01), Micka et al.
patent: 6167432 (2000-12-01), Jiang
patent: 6173293 (2001-01-01), Thekkath et al.
patent: 6173374 (2001-01-01), Heil et al.
patent: 6185618 (2001-02-01), Brabson
patent: 6189079 (2001-02-01), Micka et al.
patent: 6219710 (2001-04-01), Gray et al.
patent: 6272386 (2001-08-01), McLaughlin et al.
patent: 6275888 (2001-08-01), Porterfield
patent: 6304980 (2001-10-01), Beardsley et al.
patent: 6314491 (2001-11-01), Freerksen et al.
patent: 6317438 (2001-11-01), Trebes, Jr.
patent: 6415280 (2002-07-01), Farber et al.
patent: 6434638 (2002-08-01), Deshpande
patent: 6553031 (2003-04-01), Nakamura et al.
patent: 6584075 (2003-06-01), Gupta et al.
patent: 6611872 (2003-08-01), McCanne
patent: 6625604 (2003-09-01), Muntz et al.
patent: 6631421 (2003-10-01), Steele, Jr. et al.
patent: 6631449 (2003-10-01), Borrill
patent: 6636886 (2003-10-01), Katiyar et al.
patent: 6643650 (2003-11-01), Slaughter et al.
patent: 6667957 (2003-12-01), Corson et al.
patent: 6748381 (2004-06-01), Chao et al.
patent: 6782389 (2004-08-01), Chrin et al.
patent: 6839769 (2005-01-01), Needham et al.
patent: 6850987 (2005-02-01), McCanne et al.
patent: 6871235 (2005-03-01), Cain
patent: 2002/0065919 (2002-05-01), Taylor et al.
patent: 2002/0103998 (2002-08-01), DeBruine
patent: 2002/0114341 (2002-08-01), Sutherland et al.
patent: 2002/0143855 (2002-10-01), Traversat et al.
patent: 2002/0147771 (2002-10-01), Traversat et al.
patent: 2002/0147815 (2002-10-01), Tormasov et al.
patent: 2002/0184311 (2002-12-01), Traversat et al.
patent: 2003/0041141 (2003-02-01), Abdelaziz et al.
patent: 2003/0225796 (2003-12-01), Matsubara
patent: 2004/0044727 (2004-03-01), Abdelaziz et al.
patent: 2004/0064512 (2004-04-01), Arora et al.
patent: 2004/0064568 (2004-04-01), Arora et al.
patent: 2004/0088347 (2004-05-01), Yeager et al.
patent: 2004/0088348 (2004-05-01), Yeager et al.
patent: 2004/0088646 (2004-05-01), Yeager et al.
patent: 2004/0098447 (2004-05-01), Verbeke et al.
patent: 2004/0148326 (2004-07-01), Nadgir et al.
patent: 2004/0162871 (2004-08-01), Pabla et al.
patent: 2005/0050028 (2005-03-01), Rose et al.
patent: 2006/0173940 (2006-08-01), Guntupalli et al.
patent: 2006/0248062 (2006-11-01), Libes et al.
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.
“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.
Traversat, et al, “Project JXTA Virtual Network”, Feb. 5, 2002, http://www.jxta.org/docs/JXTAprotocols.pdf.

Affiliated with

Also associated with

Rating

Efficiently linking storage object replicas in a computer... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficiently linking storage object replicas in a computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently linking storage object replicas in a computer... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4090108