Storage allocation in a distributed segmented file system

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C711S100000

Reexamination Certificate

active

07406484

ABSTRACT:
A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.

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: 6023706 (2000-02-01), Schmuck 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: 6324581 (2001-11-01), Xu et al.
patent: 6345244 (2002-02-01), Clark
patent: 6356863 (2002-03-01), Sayle
patent: 6389420 (2002-05-01), Vahalia et al.
patent: 6442608 (2002-08-01), Knight et al.
patent: 6453354 (2002-09-01), Jiang et al.
patent: 6516320 (2003-02-01), Odom et al.
patent: 6571259 (2003-05-01), Zheng et al.
patent: 6654912 (2003-11-01), Viswanathan et al.
patent: 6772161 (2004-08-01), Mahalingam 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: 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: 2004/0133570 (2004-07-01), Soltis
Levy and Silberschatz (1990) ACM Computing Curveys 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

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

Rate now

     

Profile ID: LFUS-PAI-O-2791087

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