In a networked computing cluster storage system and...

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

C707S793000

Reexamination Certificate

active

07124171

ABSTRACT:
A highly available shared file system is described for use in computing environments. A floating network address can be associated with any one of a plurality of servers. The floating network address is associated with a first server. An area of data on a storage device is made available by the first server to be accessed by the other servers. The other servers then refer to the floating network address to access the area of data through the first server. If the first server becomes unavailable, the floating network address is transferred from the first server to a second server. The area of data is then made available by the second server to be accessed by the other servers. The other servers continue to access the area of data through the second server by referring to the floating network address.

REFERENCES:
patent: 5941956 (1999-08-01), Shirakihara et al.
patent: 6052725 (2000-04-01), McCann et al.
patent: 6330605 (2001-12-01), Christensen et al.
patent: 6356863 (2002-03-01), Sayle
patent: 6360331 (2002-03-01), Vert et al.
patent: 6393485 (2002-05-01), Chao et al.
patent: 6681327 (2004-01-01), Jardin
patent: 6711559 (2004-03-01), Kogota et al.
patent: 6725047 (2004-04-01), Farley et al.
patent: 6816891 (2004-11-01), Vahalia et al.
patent: 7020669 (2006-03-01), McCann et al.
patent: 2002/0078174 (2002-06-01), Sim et al.
patent: 2002/0120763 (2002-08-01), Miloushev et al.
patent: 2002/0161848 (2002-10-01), Willman et al.
patent: 2003/0078965 (2003-04-01), Cocotis et al.
patent: 2003/0079030 (2003-04-01), Cocotis et al.
patent: 2003/0088650 (2003-05-01), Fassold et al.
patent: 2003/0097454 (2003-05-01), Yamakawa et al.
patent: 2003/0158836 (2003-08-01), Venkatesh et al.
patent: 2003/0177107 (2003-09-01), Brown et al.
patent: 2004/0107288 (2004-06-01), Menninger et al.
patent: 2004/0236745 (2004-11-01), Keohane et al.
patent: 2005/0210074 (2005-09-01), Nakatani et al.
patent: 2005/0267920 (2005-12-01), Helliker et al.
patent: 1363441 (2003-11-01), None
patent: 1450538 (2004-08-01), None
patent: 2418326 (2006-03-01), None
patent: WO 00/22544 (2000-04-01), None
patent: WO2004/0038666 (2004-05-01), None
patent: WO2004/066588 (2004-08-01), None
patent: WO 2005/109223 (2005-11-01), None
Hector M Briceno, “design techniques for building fast servers”, 1996, p. 2.
A.W.Apon et al. “sensitivity of cluster file system access to I/O server selection”, proceedings of the 2ndIEEE/ACM international symposium on cluster computing and the grid, 2002, pp. 170-179.
Pierre Lombard et al. “nfsp: a distributed NFS server for clusters of workstations”, Apr. 2002, pp. 35-40.
Koling Chang, et al. “NFS Dynamics over flow-controlled wide area networks”, vol. 2, sixteenth anuual joint conference INFOCOM, '97, vol. 2, pp. 619-625.
Amina Saify et al. enhancing high-performance computing clusters with parallel file systems, dell power solutiions, May 2005, 3 pages.
Sanjay Ghemawat et al. “the google file system”, SOSP '03, Oct. 2003, 15 pages.
Harjinder S Sandhu et al. “cluster-based file replication in large-scale distributed systems”, performance evaluation review, vol. 20, No. 1 Jun. 1992, pp. 91-102.
B.Cliford Neuman, “the virtual system model for large distrubuted operating systems”, technical report 89-01-07, Apr. 1989, pp. 1-17.
Michael K Gschwind, “ftp2nfs-integrating FTP into the file name pace”, 1994, pp. 1-7Olexity et al. “take command starting share files with NFS”, Linux Journal, vol. 2002, issue 93, 2002 p. 1-9.
Rafael B Avila et al. “performance evaluation of a prototype distributed NFS server”, proceedings of the 16th symposium on computer architecture and high performance computing, Oct. 2004, pp. 100-105.
Athicha Muthitacharoen et al. “a low bandwidth network file system”, no date, 14 pages.
Peter J Braam, “file systems for clusters from a protocol perspective”, no date, 5 pages.
Alex Noordergraaf et al. securing the Sun Fire™ 12K and 15K Domains updated for SMS 1.2, Sun BluePrints™ OnLine-Jul. 2002 33 pages.
Putchong Uthayopas, Parallel Research Group, “Cluster software Tools: Beauty is in Simplicity”, Department of Computer Engineering, Kasetsart University, Bankok Thailand, IEEE Cluster computing 2001, Newport Beach, CA, pp. 1-39.
Jiang Lan et al. “consistency maintenance in peer-to-peer file sharing networks”, proceedings of the third IEEE workshop on internet applications, 2003, pp. 1-5.
Anderson,D et al. “failure-atomic file access in an interposed networkstorage system”, IEEE 2000, pp. 157-164.
Darrell C,A et al. “interposed request routing for scalable network storage”, ACM transactions on computer systems, TOCS, vol. 20, issue 1, pp. 25-48.
Author unknown, “Convolo Cluster Software Version 1.2”, mission critical linux, Dec. 2000, Lowell MA USA 7 pages only.
Soltis et. al., “The Global File System”, Proceedings of the Fifth NASA Goddard Space Flight Center Conference on Mass Storage Systems and Technologies, Sep. 17-19, 1996, College Park MD, USA 23 pages only.
Author unknown, “Celerra File Server Architecture for High Availability”, EMC Corporation, 1999, Hopkinton MA USA 11 pages only.

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

In a networked computing cluster storage system and... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with In a networked computing cluster storage system and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and In a networked computing cluster storage system and... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3682254

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