Electrical computers and digital processing systems: multicomput – Computer-to-computer protocol implementing – Computer-to-computer data streaming
Reexamination Certificate
2001-05-14
2004-04-13
Najjar, Saleh (Department: 2154)
Electrical computers and digital processing systems: multicomput
Computer-to-computer protocol implementing
Computer-to-computer data streaming
C709S215000, C709S217000, C709S219000
Reexamination Certificate
active
06721794
ABSTRACT:
The present invention generally relates to a modular storage server architecture for retrieving data in response to user access requests. In particular, the invention relates to a server architecture in which data is dynamically distributed over a plurality of disks, a plurality of processors are assigned to particular disks, and data access requests are assigned to particular processors in order to provide good data access performance and server fault tolerance.
BACKGROUND OF THE DISCLOSURE
A storage server allows users to efficiently retrieve information from large volumes of data stored on a plurality of disks and secondary storage (e.g., magnetic tape or an optical-disk jukebox). For example, a video server is a storage server that accepts user requests to view a particular movie from a video library, retrieves the requested program from disk, and delivers the program to the appropriate user(s). Such a video server is disclosed in U.S. Pat. No. 5,671,377, entitled “System For Supplying Streams Of Data To Multiple Users By Distributing A Data Stream To Multiple Processors And Enabling Each User To Manipulate Supplied Data Stream” issued to Bleidt et al. on Sep. 23, 1997.
The foregoing storage server employs one or more processors that access data that is stored across an array of disk drives using fault tolerant storage technique such as RAID (Redundant Array of Inexpensive Disks). While such architectures provide uniform non-blocking access to all of the data stored on the disk drives, they do not facilitate a modular architecture. Since data is striped across all of the disk drives in the array, adding or removing disk drives to/from the server requires that all of the data be re-striped across the new set of disk drives. Because the servers are not modular, it is therefore inconvenient to increase or decrease storage capacity by adding or removing disk drives.
There is therefore a need in the art for a storage server architecture that is modular and can acceptably resolve content blocking issues.
SUMMARY OF THE INVENTION
The disadvantages associated with the prior art are overcome by the present invention of a server comprising a plurality of modules, each of which contains a single processor and a cluster of, for example, 16 disk drives, and a host controller that communicates with and assigns data requests to each of the modules. Data is written to the disk drives by striping the data across the 16-disk drive cluster of a single module according to a RAID-5 protocol, with parity and spares distributed amongst the disk drives in the cluster.
The architecture of the present invention employs dynamic data management methods, which determine whether data should reside on disk or secondary storage, on which disk drives data should be stored, and how data should be replicated and/or migrated to new disk drives based on observed user access patterns. These methods also migrate popular data to faster disk tracks to reduce average access time and thus improve performance.
User access requests are assigned to modules based on the data stored at each module, and each module's current load (the number of requests waiting to be serviced). If the requested data is not on a disk drive, the data is retrieved from secondary storage, and may be stored on the disk drives for rapid subsequent access. When a requested data item on the disk drive is replicated, load balancing is performed by assigning the request to the module holding the data with the lowest load. In addition, user access requests waiting to retrieve replicated data may be dynamically and seamlessly migrated to another module based on changes in module loads.
REFERENCES:
patent: 5148432 (1992-09-01), Gordon et al.
patent: 5473362 (1995-12-01), Fitzgerald et al.
patent: 5671377 (1997-09-01), Bleidt et al.
patent: 5864682 (1999-01-01), Porter et al.
patent: 5913039 (1999-06-01), Nakamura et al.
patent: 5915094 (1999-06-01), Kouloheris et al.
patent: 5918213 (1999-06-01), Bernard et al.
patent: 5920700 (1999-07-01), Gordon et al.
patent: 5933603 (1999-08-01), Vahalia et al.
patent: 5935206 (1999-08-01), Dixson et al.
patent: 5996015 (1999-11-01), Day et al.
patent: 6014706 (2000-01-01), Cannon et al.
patent: 6028725 (2000-02-01), Blumenau
patent: 6151634 (2000-11-01), Glaser et al.
patent: 6178460 (2001-01-01), Maddalozzo, Jr. et al.
patent: 6223206 (2001-04-01), Dan et al.
patent: 6314456 (2001-11-01), Van Andel et al.
patent: 6314466 (2001-11-01), Agarwal et al.
patent: 6535920 (2003-03-01), Parry et al.
Chin Danny
Goode Christopher W. B.
Lerman Jesse S.
Taylor Clement G.
DIVA Systems Corp.
Najjar Saleh
LandOfFree
Method of data management for efficiently storing 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 Method of data management for efficiently storing and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of data management for efficiently storing and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3272672