File replication in a distributed segmented file system

Data processing: database and file management or data structures – File or database maintenance – Synchronization

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S636000, C707S638000, C707S999200

Reexamination Certificate

active

07836017

ABSTRACT:
A system includes storage configured to store file system entities, including directories and files, residing in segments of a distributed, segmented single file system, file servers configured to implement the single file system with separate ones of the file servers controlling metadata of separate ones of the segments, and a controller configured to control storage of files in the file system such that for a master file stored in a first segment, a first replica of the master file will be stored in a second segment that is physically separate from the first segment, the controller being further configured to control storage of directories in the file system such that a single directory will include identifiers for the master file and the first replica.

REFERENCES:
patent: 4901231 (1990-02-01), Bishop et al.
patent: 5455953 (1995-10-01), Russell
patent: 5513314 (1996-04-01), Kandasamy et al.
patent: 5828876 (1998-10-01), Fish et al.
patent: 5873103 (1999-02-01), Trede et al.
patent: 5909540 (1999-06-01), Carter et al.
patent: 5948062 (1999-09-01), Tzelnic et al.
patent: 5960446 (1999-09-01), Schmuck et al.
patent: 5987506 (1999-11-01), Carter et al.
patent: 6014669 (2000-01-01), Slaughter et al.
patent: 6023706 (2000-02-01), Schmuck et al.
patent: 6026474 (2000-02-01), Carter et al.
patent: 6029168 (2000-02-01), Frey
patent: 6061504 (2000-05-01), Tzelnic et al.
patent: 6163801 (2000-12-01), O'Donnell et al.
patent: 6173293 (2001-01-01), Thekkath et al.
patent: 6185601 (2001-02-01), Wolff
patent: 6192408 (2001-02-01), Vahalia et al.
patent: 6301605 (2001-10-01), Napolitano et al.
patent: 6324581 (2001-11-01), Xu et al.
patent: 6345244 (2002-02-01), Clark
patent: 6345288 (2002-02-01), Reed et al.
patent: 6356863 (2002-03-01), Sayle
patent: 6385625 (2002-05-01), Slaughter
patent: 6389420 (2002-05-01), Vahalia et al.
patent: 6401126 (2002-06-01), Douceur et al.
patent: 6442608 (2002-08-01), Knight et al.
patent: 6453354 (2002-09-01), Jiang et al.
patent: 6493804 (2002-12-01), Soltis et al.
patent: 6516320 (2003-02-01), Odom et al.
patent: 6556998 (2003-04-01), Mukherjee et al.
patent: 6564228 (2003-05-01), O'Connor
patent: 6571259 (2003-05-01), Zheng et al.
patent: 6615223 (2003-09-01), Shih et al.
patent: 6654912 (2003-11-01), Viswanathan et al.
patent: RE38410 (2004-01-01), Hersch et al.
patent: 6697835 (2004-02-01), Hanson et al.
patent: 6697846 (2004-02-01), Soltis
patent: 6742035 (2004-05-01), Zayas et al.
patent: 6748447 (2004-06-01), Basani et al.
patent: 6772161 (2004-08-01), Mahalingam et al.
patent: 6775703 (2004-08-01), Burns et al.
patent: 6782389 (2004-08-01), Chrin et al.
patent: 6823336 (2004-11-01), Srinivasan et al.
patent: 6938039 (2005-08-01), Bober et al.
patent: 6973455 (2005-12-01), Vahalia et al.
patent: 6976060 (2005-12-01), Manczak et al.
patent: 7054910 (2006-05-01), Nordin et al.
patent: 7058727 (2006-06-01), Dingsor et al.
patent: 7146377 (2006-12-01), Nowicki et al.
patent: 7162486 (2007-01-01), Patel et al.
patent: 7203731 (2007-04-01), Coates et al.
patent: 7406484 (2008-07-01), Srinivasan et al.
patent: 7711702 (2010-05-01), Smolen et al.
patent: 2002/0059309 (2002-05-01), Loy et al.
patent: 2002/0095479 (2002-07-01), Schmidt
patent: 2002/0120763 (2002-08-01), Miloushev et al.
patent: 2002/0138501 (2002-09-01), Dake
patent: 2002/0138502 (2002-09-01), Gupta
patent: 2002/0143734 (2002-10-01), Loy et al.
patent: 2002/0161855 (2002-10-01), Manczak et al.
patent: 2003/0004947 (2003-01-01), Coverston
patent: 2003/0028587 (2003-02-01), Driscoll et al.
patent: 2003/0033308 (2003-02-01), Patel et al.
patent: 2003/0079222 (2003-04-01), Boykin et al.
patent: 2003/0110237 (2003-06-01), Kitamura et al.
patent: 2003/0115434 (2003-06-01), Mahalingam et al.
patent: 2003/0115438 (2003-06-01), Mahalingam et al.
patent: 2003/0135514 (2003-07-01), Patel et al.
patent: 2004/0133570 (2004-07-01), Soltis
patent: 2007/0022117 (2007-01-01), Keohane et al.
Anderson, Thomas E. “Severless Network File Systems”ACM Transactions on Computer Systems, Feb. 1996, vol. 14(1), pp. 41-79.
Aversa, Luis, et al. Load Balancing a Cluster of Web Servers Unsing Distributed Packet Rewriting, Boston University, pp. 1-14, Publ. 1999.
Cardellini, Valeria, et al. “Geographic Load Balancing for Scalable Distributed Web Systems”IEEE, pp. 20-27 2000.
Corbett, Peter F., et al. “The Vesta Parallel File System”,ACM Transactions on Computer Systemsvol. 14(3), pp. 225-264 (1996).
Grant, David, Microsoft TechNet—Web Server Clustering, Jun. 8, 2000, pp. 1-7, downloaded from the Internet at [http://www.technet.microsoft.com/en-us/library/Bb742600d(=printer).aspx]on Oct. 18, 2007.
Guan, Ping, et al. A Survey of Distributed File Systems, pp. 1-11, Pub. 1999.
Karniadakis, et al. “Nodes, Modes, and Flow Codes”,Physics Today(Mar. 1993) pp. 34-42.
Ligon, III, Walter, et al. “An Overview of the Parallel Virtual File System”,Proceedings of the 1999 Extreme Linux Workshop(1999) pp. 1-8.
Levy and Silberschatz (1990) ACM Computing Surveys 22:321-373.
Morris, et al. (1986) Communications of the ACM29:184-201.

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

File replication in a distributed segmented file 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 File replication in a distributed segmented file system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and File replication in a distributed segmented file system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4226723

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