U.S. patent application number 11/459906 was filed with the patent office on 2007-01-25 for rule driven automation of file placement, replication, and migration.
This patent application is currently assigned to Parascale, Inc.. Invention is credited to Cameron Bahar, Joseph Hopfield, Naveen Nalam, Rasoul M. Oskouy, David B. Zafman.
Application Number | 20070022129 11/459906 |
Document ID | / |
Family ID | 37683970 |
Filed Date | 2007-01-25 |
United States Patent
Application |
20070022129 |
Kind Code |
A1 |
Bahar; Cameron ; et
al. |
January 25, 2007 |
RULE DRIVEN AUTOMATION OF FILE PLACEMENT, REPLICATION, AND
MIGRATION
Abstract
Techniques and mechanism are provided for deciding which storage
device (or devices) a file should be stored on. These
determinations can be used to guide either the placement of new
files or the replication or migration of existing files to new
storage volumes. These determinations may be made on the basis of
simple rules, involving a small number of readily ascertainable
file attributes.
Inventors: |
Bahar; Cameron; (Los Altos,
CA) ; Hopfield; Joseph; (Culver City, CA) ;
Nalam; Naveen; (San Francisco, CA) ; Zafman; David
B.; (Calabasas, CA) ; Oskouy; Rasoul M.; (Los
Altos, CA) |
Correspondence
Address: |
TOWNSEND AND TOWNSEND AND CREW, LLP
TWO EMBARCADERO CENTER
EIGHTH FLOOR
SAN FRANCISCO
CA
94111-3834
US
|
Assignee: |
Parascale, Inc.
Los Altos
CA
|
Family ID: |
37683970 |
Appl. No.: |
11/459906 |
Filed: |
July 25, 2006 |
Related U.S. Patent Documents
|
|
|
|
|
|
Application
Number |
Filing Date |
Patent Number |
|
|
60702428 |
Jul 25, 2005 |
|
|
|
60702429 |
Jul 25, 2005 |
|
|
|
Current U.S.
Class: |
1/1 ; 707/999.1;
707/E17.01 |
Current CPC
Class: |
H04L 67/1095 20130101;
Y10S 707/99931 20130101; G06F 2209/508 20130101; Y10S 707/99953
20130101; G06F 9/5011 20130101; G06F 9/5016 20130101; Y10S
707/99952 20130101; H04L 29/12207 20130101; H04L 67/2814 20130101;
H04L 67/1008 20130101; H04L 67/1029 20130101; H04L 61/20 20130101;
H04L 67/1002 20130101; G06F 16/184 20190101; H04L 67/1017 20130101;
H04L 67/1097 20130101 |
Class at
Publication: |
707/100 |
International
Class: |
G06F 7/00 20060101
G06F007/00 |
Claims
1. A computer-implemented method of selecting a storage volume for
a file, the method comprising: associating, by a system manager,
storage classes with one or more storage volumes; composing, by a
system manager, a set of rules that map file characteristics into a
storage class; applying, using a computer system, the set of rules
to a plurality of files to obtain one or more storage classes
associated with each file in the plurality of files; and matching,
using the computer system, the obtained one or more storage classes
to the one or more storage volumes to determine an appropriate
storage volume for each file in the plurality of files.
2. The method of claim 1 further comprising storing the file in the
appropriate storage volume based on the storage class.
3. The method of claim 1 wherein at least one rule in the set of
rules comprises a Boolean expression.
4. The method of claim 3 wherein the Boolean expression comprises a
regular expression for pattern matching against character
strings.
5. The method of claim 3 wherein the Boolean expression comprises
an arithmetic expressions involving for matching numeric
quantities.
6. The method of claim 3 wherein the Boolean expression comprises a
Boolean expression for matching against arbitrary properties.
7. The method of claim 1 wherein at least one rule in the set of
rules map the file to the storage class.
8. The method of claim 7 wherein the least one rule in the set of
rules maps to replication factors for the file.
9. The method of claim 8 further comprising: using the at least one
rule by a network file server to determine if the file should be
replicated; determining which volumes replicas of the file should
be stored; and generating a task to perform replication of the file
on the determined volumes.
10. The method of claim 7 further comprising using the at least one
rule by a network file server to determine which of available
volumes to use for the file to create the file.
11. The method of claim 7 further comprising: using the at least
one rule by a network file server to determine if the file should
be migrated from a first storage volume to a second storage volume,
and generating a task using the network file server to perform
migration of the file from the fist storage volume to the second
storage volume.
Description
CROSS-REFERENCES TO RELATED APPLICATIONS
[0001] This application claims the benefit of U.S. Provisional
Application No. 60/702,428, filed Jul. 25, 2005 and entitled
"Scalable Clustered Storage System," and U.S. Provisional
Application No. 60/702,429, filed Jul. 25, 2005 and entitled "Grid
Management System," the disclosures of which are herein
incorporated by reference for all purposes.
BACKGROUND OF THE INVENTION
[0002] Embodiments of the present invention generally relate to
computer systems, and more specifically to techniques for rule
driven automation of placement, migration, and replication in a
storage network.
[0003] File systems are most commonly stored on random access
storage devices (like spinning magnetic disks). Traditionally these
disks were directly attached to a single computer, via a disk
controller. Many years ago it was the case the files on a disk
could only be accessed by programs that were running on the
computer to which the disks were attached.
[0004] The advent of standardized remote file access protocols
(e.g., the Network File System and the Common Internet File System)
have made it possible for clients to access files on other
computers. The advent of Storage Area Networking technologies (such
as fibre channel and iSCSI) has made it possible for a single
storage device (e.g., a disk) to be accessed directly and
efficiently by multiple computers. In this new regime, client
software is no longer aware of what device their files are actually
stored on, and it becomes possible to move files from one storage
device to another.
[0005] Different digital storage volumes have different
characteristics (e.g., cost, size, access time, and throughput).
The performance characteristics are further affected by file system
and operating system options (e.g. block size, allocation strategy,
and caching), or even protocol options (stream vs datagram,
ack-window size, etc).
[0006] Different types of files (e.g. streaming video, text,
programs, HTML, etc) tend to be processed in different ways (read
size and frequency, reuse, read/write mix, etc). As a result,
different types of files will experience better or worse
performance, based on the characteristics of the storage devices,
file system, operating system, and protocol through which they are
being accessed.
[0007] System performance will be optimized when each file is
stored and accessed in the manners that are most appropriate for
that type of file. If all of the files used by a system are of
single type, it is relatively easy for system managers to configure
a storage volume and access services with the appropriate
characteristics and allocate the space for those files on that
volume.
[0008] Unfortunately it is increasingly common for users or
applications to use increasingly many files of increasingly many
types. No one storage volume or set of configuration parameters
could possibly be right for all of these files. System managers
have traditionally been forced to select the storage volume and
management discipline that was right for the most important files,
and accept reduced performance (or price performance) for the rest
of the files.
BRIEF SUMMARY OF THE INVENTION
[0009] Embodiments of the present invention generally relate to
computer systems, and more specifically to techniques for rule
driven automation of placement, migration, and replication in a
storage network.
[0010] In one embodiment, a computer-implemented method of
selecting a storage volume for a file is disclosed. The method
includes associating, by a system manager, storage classes with one
or more storage volumes. The system manager composes a set of rules
that map file characteristics into a storage class. A computer
system applies the set of rules to a plurality of files to obtain
one or more storage classes associated with each file in the
plurality of files. The computer system matches the obtained one or
more storage classes to the one or more storage volumes to
determine an appropriate storage volume for each file in the
plurality of files.
[0011] The file may be stored in the appropriate storage volume
based on the storage class. At least one rule in the set of rules
may include a Boolean expression. The Boolean expression may
include a regular expression for pattern matching against character
strings. The Boolean expression may include an arithmetic
expressions involving for matching numeric quantities. The Boolean
expression may include a Boolean expression for matching against
arbitrary properties.
[0012] At least one rule in the set of rules may map the file to
the storage class. The least one rule in the set of rules may map
to replication factors for the file. In one embodiment, the at
least one rule is used by a network file server to determine if the
file should be replicated. The network file server determines which
volumes replicas of the file should be stored, and generates a task
to perform replication of the file on the determined volumes.
[0013] The at least one rule may be used by a network file server
to determine which of available volumes to use for the file to
create the file. The at least one rule may be used by a network
file server to determine if the file should be migrated from a
first storage volume to a second storage volume, and the network
file server may generate a task using the network file server to
perform migration of the file from the fist storage volume to the
second storage volume.
[0014] A further understanding of the nature and the advantages of
the inventions disclosed herein may be realized by reference of the
remaining portions of the specification and the attached
drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] FIG. 1 is an illustration of a clustered storage system
according to an embodiment according to the present invention.
[0016] FIG. 2 is a block diagram of a control node according to an
embodiment of the present invention.
[0017] FIG. 3 is a block diagram of a storage node according to an
embodiment of the present invention.
[0018] FIG. 4 is a simplified flowchart of a method of servicing
requests for files in a storage system according to an embodiment
of the present invention.
[0019] FIG. 5A is a message sequence chart of servicing a request
to read from a file in a storage system using tokens according to
an embodiment of the present invention.
[0020] FIG. 5B is a message sequence chart of servicing a request
to write to a file in a storage system using tokens according to an
embodiment of the present invention.
[0021] FIG. 6 is a block diagram of a storage system including a
number of storage servers implementing a distributed file system
with clients connecting to a virtual Internet Protocol address
(VIP) according to an embodiment of the present invention.
[0022] FIG. 7 illustrates a message sequence chart for client
session redirection from an elected master in the storage system of
FIG. 6 to an appropriate storage server according to one embodiment
of the present invention.
[0023] FIGS. 8A, 8B, and 8C illustrate storage systems for a
network file system that may incorporate embodiments of the present
invention.
[0024] FIGS. 9A, 9B, and 9C illustrate interconnection of storage
devices to multiple servers that may incorporate embodiments of the
present invention.
[0025] FIG. 10 is a block diagram illustrating a layering of
primary performance-impacting components in remote file access that
may be incorporated in embodiments of the present invention.
[0026] FIGS. 11A, 11B, and 11C are high level flowcharts for a
method of selecting an appropriate storage volume for a file using
rules according to one embodiment of the present invention.
[0027] FIG. 12 is a block diagram illustrating file characteristics
used for determining a storage volume according to one embodiment
of the present invention.
[0028] FIG. 13 is an example of a general grammar for rules
defining storage classes according to one embodiment of the present
invention.
[0029] FIG. 14 is a block diagram illustrating a distributed file
system with multiple client and storage server nodes, each serving
its own storage volumes, where one of the storage nodes has been
elected as a master according to one embodiment of the present
invention.
[0030] FIG. 15 is a block diagram illustrating an elected work
manager and multiple storage nodes according to one embodiment of
the present invention.
[0031] FIGS. 16A, 16B, 16C, and 16D are flowcharts of methods of
managing work tasks using a work manager according to one
embodiment of the present invention.
[0032] FIG. 17 is a flowchart of a method of servicing work queues
using a remote replication agent according to one embodiment of the
present invention.
[0033] FIG. 18 is a block diagram of a computer system suitable for
implementing embodiments of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
[0034] The embodiments discussed herein are illustrative of one or
more examples of the present invention. As these embodiments of the
present invention are described with reference to illustrations,
various modifications or adaptations of the methods and/or specific
structures described may become apparent to those skilled in the
art. All such modifications, adaptations, or variations that rely
upon the teachings of the present invention, and through which
these teachings have advanced the art, are considered to be within
the scope of the present invention. Hence, the present descriptions
and drawings should not be considered in a limiting sense, as it is
understood that the present invention is in no way limited to only
the embodiments illustrated.
Clustered Storage System
[0035] According to various embodiments, a scalable clustered
storage system separates namespace and metadata attributes of files
in a file system from the actual data content of files. In one
embodiment, one or more servers, called control nodes, are
responsible for handling the namespace, metadata, and location
information of files. One or more servers, called storage nodes,
are responsible for the physical storage and access to files in the
file system. Each storage node typically employs a shared-nothing
architecture, meaning that each storage node has its own block
storage device, whether local or attached through a storage area
network (SAN) and the like.
[0036] In the clustered storage system, the file system itself
spans both control nodes and storage nodes, as is not physically
tied to a particular server. Accordingly, the clustered storage
system scales in several dimensions. Storage nodes may be added in
order to scale capacity and bandwidth for serving files stored in
the file system. Each storage node may provide both processing and
storage capabilities. Moreover, control nodes may be added to
distribute the load of metadata operations.
[0037] In some embodiments of the clustered storage system, users
(e.g., client computer systems) may use industry standard protocols
without modification to mount exported file system and to access
files within the storage system from storage nodes. In some
embodiments, the clustered storage system provides a global
namespace allowing users to see the entire file system regardless
of the storage node used for access to the file system.
[0038] Accordingly, a storage system in one embodiment of the
present invention includes a control node that stores metadata,
object identifiers, and location information associated with a
plurality of files in a file system and a plurality of storage
nodes that store the plurality of files. A storage node in the
plurality of storage nodes is capable of receiving a request for a
file in the file system from a client. The storage node
communicates with the control node to determine metadata, an object
identifier, and location information associated with the file. The
storage node then accesses the file in the file system to service
the request from the client using the metadata, the object
identifier, and the location information received from the control
node.
[0039] FIG. 1 is an illustration of a clustered storage system 100
according to an embodiment according to the present invention.
Storage system 100 includes clients 120 and 130, control nodes 130
and 140, and storage nodes 150, 160, and 170. Clients 120 and 130,
control nodes 130 and 140, and storage nodes 150, 160, and 170 are
communicatively coupled using a communications network 180.
[0040] Typically, clients 110 and 120 are computer systems such as
personal computers (PCs), workstations, laptops, personal digital
assistants (PDAs), servers, mainframes, and the like. The clients
110 and 120 are configured to access remote files and file systems
using file access protocols, such as NFS, CIFS, HTTP, FTP, and the
like.
[0041] Control nodes 130 and 140 may be PCs, workstations, servers,
mainframes, and the like. Control nodes 130 and 140 may store
information associated with files in a file system on a local file
system, network attached storage (NAS), a storage area network
(SAN), a database, and the like. Control nodes 130 and 140 may also
store information associated with files in a file system in a
combination of a local file system and a database. One example of a
computer system suitable for implementing control nodes 130 or 140
is shown in FIGS. 2 and 8.
[0042] Storage nodes 150, 160, and 170 are any hardware and/or
software elements configured to store files in a file system.
Storage nodes 150, 160, and 170 may be PCs, workstations, servers,
mainframes, and the like. Storage nodes 150, 160, and 170 may
implement one or more file systems to store files, such as NTFS,
EXT, XFS, GFS, and the like. One example of a computer system
suitable for implementing control nodes 130 or 140 is shown in
FIGS. 3 and 8.
[0043] Information associated with files in a file system includes
namespace, metadata, an object identifier, and location
information. Namespace includes a hierarchical tree-based file path
and naming scheme common in most file systems. Metadata includes
file attributes, such as a file name, permissions, size, type, and
the like. Object identifier is a cluster-wide globally unique
128-bit id that is used for naming and storage of files in an
object store on a storage node. Location information includes
information associated with the logical and/or physical location of
a file in a file system. For example, the location information may
specify a given storage node, an object store attached to a storage
node, path information, and the like.
[0044] In one example of operation, client 110 sends a request for
a file in a file system, such as a request to read from a file, to
storage node 150. Storage node 150 then communicates with control
nodes 130 and 140 to determine metadata, object identifier, and
location information associated with the file and optimally caches
this information locally in its RAM. In this example, control node
130 determines an object identifier associated with the name of the
file, and from the object identifier, determines the location of
the file. Control node 130 sends the object identifier and the
location of the file to storage node 150. Operations of the control
node 130 are described further with respect to FIGS. 2 and 4.
[0045] Storage node 150 uses the object identifier and the location
of the file to access the file in the file system. For example, the
location information may direct storage node 150 to access the file
on storage node 160. In some embodiments, storage node 150 may read
and write files from or to storages nodes 160 and 170 using an
Internet Protocol (IP) based transport mechanism, some examples of
which are HTTP or NFS cross mounts. The location information may
also direct storage node 150 to access the file using a portion of
the file system stored on the storage node 150. Operations of the
storage node 150 are described further with respect to FIGS. 3 and
4.
[0046] According to various embodiments, the storage system 100
separates namespace, metadata and location information associated
with files in a file system from the actual storage of the files by
the storage nodes 150, 160, and 170. Accordingly, various
embodiments provide enhanced access to file system objects using
the storage system 100 regardless of the location of an file within
a storage node. Additionally, in various embodiments, additional
control nodes and additional storage nodes may be added to the
storage system, increasing storage capacity and reducing file
access time in the storage system.
[0047] In some embodiments, a pool of network addresses, such as
Internet Protocol (IP) addresses may be allocated and assigned to
storage nodes 150, 160, and 170 by control nodes 130 and 140. Upon
a storage node failure (e.g., storage node 150), control nodes 130
and 140 dynamically reassign the network address (e.g., the IP
address) associated with the failed storage node 150 to a
functioning storage node (e.g., storage node 160). Thus,
client/user access to files previous using storage node 150 may be
transparently moved and/or redirected to a new storage node (i.e.,
storage node 160).
[0048] FIG. 2 is a block diagram of control node 130 according to
an embodiment of the present invention. In general, access to files
in a file system funnels a single namespace. Control node 130
maintains the mapping between names and files in the namespace, and
provides APIs to allow access to maps from pathnames to unique
object identifiers and the reverse. In this example, control node
130 includes an address manager 205, a membership manager 210, a
monitoring service 215, a load balancer 220, a placement engine
225, a policy engine 230, a location service 235, a data manager
240, a token manager 245, a metadata manager 250, a user interface
manager 255, a file system 260, and a location database 265.
[0049] Address manager 205 includes hardware and/or software
elements configured to provide address management for control node
130. For example, control node 130 may be configured to response to
one or more Internet Protocol (IP) addresses to services requests
for files in a file system. Address manager 205 may also provide
address management to one or more storage nodes in the storage
system 100. Address manager 205 may allocate IP addresses to a
storage node (e.g., storage nodes 150, 160, and 170) based on
performance, capacity, policies, and other criteria collected and
associated with a storage node.
[0050] Membership manager 210 includes hardware and/or software
elements configured to determine membership of control node 130 and
storage nodes that join or leave the storage system 100. Monitoring
service 215 includes hardware and/or software elements configured
to monitor and report the status of control nodes (e.g., control
nodes 130 and 140) and storage nodes (e.g. storage nodes 150, 160,
170), such as uptime, throughput, and the like.
[0051] Load balancer 220 includes hardware and/or software elements
configured to provide balancing of file system requests between one
or more storage nodes. Load balancer 220 may redirect access to
files in a file system from clients 120 and 130 in response to load
on storage nodes 150, 160, and 170, capacity, location of the
client, and the like.
[0052] Placement engine 225 includes hardware and/or software
elements configured to determine the placement of files in a file
system. For example, placement engine 225 may determine to store
MP3 files on storage node 160 and AVI video files on storage node
170. Placement engine 225 may determine placement of files based on
files attributes, such as size, type, extension, and capacity,
performance, and the like, of a storage node, as well as the
particular type of a disk volume attached to a storage node.
[0053] Policy engine 230 includes hardware and/or software elements
configured to provide rules-based policies for automatic placement,
migration, and replication of files in the clustered storage
system. Policy engine 230 allows a user, such as an administrator,
to specify reliability targets and policies for different classes
of data, (e.g., storage classes). These policies can take into
account file attributes like path, file type, mod-time, size,
etc.
[0054] Location service 235 includes hardware and/or software
elements configured to determine the location of a file in a file
system. In various embodiments, the storage system 100 has the
ability to move data between volumes and storage nodes without
interrupting or affecting client use. For example, data associated
with client 110 may be migrated from storage node 160 to a volume
associated with storage node 170, with no downtime noticed by
client 110. In various embodiments, files have unique object
identifiers, and files are stored in volumes associated with volume
identifiers. Location service 235 tracks the location of files in
the storage system 100 and provides an API to query and update this
information. Location service 235 also may track which storage
nodes are storing which volumes, and may also maintain information
related to how much free space exists on a volume, and other
attribute information about volumes, such as performance and the
like.
[0055] The data manager 240 includes hardware and/or software
elements configured to provide data management services. In
general, in order to tolerate failures in storage nodes 150, 160,
and 170, multiple copies of files may be stored throughout the
storage system 100. In some embodiments, data manager 240 provides
"lazy" replication, in which policy and data attributes determine
which files take precedence during replication. Data manager 240
may also provide synchronous replication, for synchronous
writes--mirroring of sensitive data.
[0056] Metadata manager 250 includes hardware and/or software
elements configured to manage file attributes associated with files
in a file system. Some examples of file attributes are size,
ownership and access permission, type, extension, name, and the
like.
[0057] User interface manager 255 includes hardware and/or software
elements configured to provide access to various features of
control node 130, such as policy engine 230, through a graphical
user interface.
[0058] File system 260 includes hardware and/or software elements
configured to storage data. In this example, control node 130
stores the namespace, metadata, and an object identifier associated
with files in a file system in the file system 260.
[0059] Location database 265 includes hardware and/or software
elements configured to store location information associated with
files in a file system. Some examples of location data 265 are a
flat database, a relational database, and the like. The location
database 265 may also be part of the file system 260. Typically,
files are stored with enough identifying information (volume, name,
version history) to allow them to be identified, versions resolved,
and the data used by another control node, if necessary.
[0060] In various embodiments, the control node 130 may include one
or more local or attached block devices, such as hard disks,
removable disks, SANS, and the like.
[0061] In operation of control node 130, each namespace has a
corresponding file system (or isolated file-tree) at control node
130. Control node 130 stores metadata, along with an object
identifier, such as a alpha-numeric sequence or the like,
associated with an object (e.g., a file) in the file on file system
260 (e.g., the contents of /foo/bar on file system 260 of control
node 130 is "object-id=1783 . . . "). The file system 260 may also
includes current attributes of files, including ownership, times,
and size information. In one example, the file system 260 includes
file attributes in a phantom file. For example,
"/SHARE.sub.--17/foo/bar" is a file which contains the object
identifier of /foo/bar, as well as the owner, times, etc. of the
file. The phantom file's length may also be set to the length of
the file plus 4 k of padding, to store the object identifier and
other information associated with the file in the file system.
Control node 130 also stores location information associated with
files in the file system in location database 265.
[0062] According to the previous example, when control node 130
receives a request to access an file in the file system, control
node 130 retrieves the file (i.e., the phantom file for the file)
from file system 260 to determine metadata associated with the
file. Control node 130 retrieves the object identifier form the
phantom file, and uses the object identifier to determine location
information associated with the file from the location database
265. Control node 130 then returns the object identifier of the
file and the location information (e.g., volume identifier, path,
etc.) associated with the file to the requestor.
[0063] According to various embodiments, control node 130 provides
separation between metadata and location information of files in
the file system, and the actual storage of the files. The
separation of metadata and file storage allows flexibility in the
storage and retrieval of files because the files can be stored in
one location and later moved or migrated.
[0064] FIG. 3 is a block diagram of storage node 150 according to
an embodiment of the present invention. In general, storage node
150 provides for the storage of the actual files in a file system,
with metadata and location information stored on a control node
(e.g., control node 130 of FIG. 1). In this example, storage node
150 includes a data manager 310, a file protocol router 320, a
token handler 330, a monitoring service 340, a replication agent
350, and an object storage 360.
[0065] Data manager 310 includes hardware and/or software elements
configured to service requests for files in a file system. File
protocol router 320 includes hardware and/or software configured to
provide communication between storage node 150 and various file
access protocols, such as NFS, CIFS, HTTP, Web-DAV, FTP, and the
like.
[0066] Token handler 330 includes hardware and/or software elements
configured to manage access to files in a file system based on
tokens received from a control node. Monitoring service 340
includes hardware and/or software elements configured to monitor
and report status information associated with storage node 150.
[0067] Replication agent 350 includes hardware and/or software
elements configured to replicate files in a file system.
[0068] Object storage 360 includes hardware and/or software
elements configured to store data. Some examples of object storage
360 are local file systems residing on one or more hard disks,
databases, and the like.
[0069] In various embodiments, the storage node 150 may include one
or more local or attached block devices, such as hard disks,
removable disks, SANS, and the like.
[0070] In general, storage node 150 communicates with control node
130 to determine metadata, an object identifier, and location
information associated with a file as metadata and location
information are separated in the storage system 100. In response to
a request from a client (e.g., client 110), storage node 150 uses
the metadata, object identifier, and location information to
service the request from the client 110. The operations of storage
node 150 are described further with respect to FIG. 4.
[0071] FIG. 4 is a simplified flowchart of a method of servicing
requests for files in a storage system according to an embodiment
of the present invention. The processing depicted in FIG. 4 may be
performed by software modules (e.g., instructions or code) executed
by a processor of a computer system, by hardware modules, or
combinations thereof. FIG. 4 begins in step 400.
[0072] In step 410, a request for a file from a client (e.g.,
client 110) is received at storage node 150. The request may be to
read from a file, write to a file, change to a directory, and the
like. In step 420, storage node 150 determines metadata, and object
identifier, and location information associated with the file from
control node 130. For example, control node 130 accesses the file
(e.g., the phantom or ghost file) in file system 260 to determine
an object identifier associated with the file. Control node 130
then uses the object identifier to determine location information
from the location database 265, such as volume identifier, path,
etc. Control node 130 returns the metadata, including the object
identifier, and location information associated with the file to
the storage node 150.
[0073] In step 430, storage node 150 uses the metadata, object
identifier, and location information associated with the file to
access the file in the file system to service the request for the
file from client 110. In one example, the metadata, object
identifier, and location information received from control node 130
by the storage node 150 directs storage node 150 to retrieve the
file from object storage 360. Storage node 150 then services the
request for the file using the retrieved file from object storage
360. In another example, the metadata, object identifier, and
location information received from control node 130 directs storage
node 150 to request the file from storage node 160. Storage node
150 may then may cross-mount a portion of the file system hosted by
storage node 160 to access the file.
Token Management
[0074] FIG. 5A is a message sequence chart of servicing a request
to read from an file in a file system using tokens according to an
embodiment of the present invention. In this example, storage node
150 receives a request from client 110 (FIG. 1) to read from an
file in the file system. Storage node 160 receives a request from
client 120 to read from the same file in the file system. The file
has been replicated to volume_1 510 and to volume_2 520 so that
multiple copies of the file exist in the file system.
[0075] Storage node 150 communicates with control node 130 to
determine metadata and location information associated with the
file. In particular, token handler 330 (FIG. 3) of storage node 150
request a token from control node 130 to read from the file.
Control node 130 generates a token allowing read access to the
object storage in Volume_1 510 by storage node 150. As discussed
above, control node 130 may determine one or more volumes to
distribute data storage. Accordingly, control node 130 provides
volume information in token to the storage node 150. A token is a
lease for file system operations, such as read or write, and
includes an access time or lease time. Using the token received
from the control node, storage node 150 then reads the file from
Volume_1 510 to service the request from the client 110. Storage
node 150 may attempt to renew the token, to continue read access to
the file in Volume_1 510 as further requested by client 110.
[0076] Typically, storage node 150 stores the token received from
control node 130, and sets a timeout shorter than the lease time of
the token. This allows storage node 150 to renew its lease before
the control node 130 expires the token. When the timeout occurs,
the token storage node 150 determines whether to renew the lease of
the token. For example, in file systems, like CIFS that have
open/close in the protocol, an open sets a flag which will ensure
that the lease of the token is renewed. In various embodiments, and
open mode read or write determines the mode in which the renewal of
the token will occur. In another example, for a file system, such
as NFS, that does not have open/close in the protocol, storage node
150 monitors actual read and write operations. If a read or a write
operation has occurred since the last renewal of the token, another
renewal will be requested. In various embodiments, the particular
operations, whether read or write, determines in what mode the
renewal of the token will occur.
[0077] In some embodiments, the token includes information, such as
a mode (READ/MASTER), a referral volume identifier, the number of
seconds the lease is good for, and a generation number. A storage
node returns the generation number to a control node, so that the
control node may determine when certain races have occurred.
Typically, a control node sets an internal time-out, which when
triggered the control node assumes a storage node has let a token
lease expire or the storage node has crashed, or is otherwise
unavailable.
[0078] Referring again to FIG. 5A, storage node 160 also
communicates with control node 130 to determine metadata and
location information associated with the file. Token handler 330 of
storage node 160 requests a token from control node 130 to read
from the file. Control node 130 generates a token allowing read
access to the object storage in Volume_2 520 by storage node 160.
Using the token received from the control node, storage node 160
reads the file from Volume_2 520 to service the request from the
client 120. Similarly, storage node 160 attempts to renew the
token, to continue read access to the file in Volume_2 520 as
further requested by client 120.
[0079] FIG. 5B is a message sequence chart of servicing a request
to write to an file in a file system using tokens according to an
embodiment of the present invention. In this example, storage node
150 receives a request from client 110 to write to an file in the
file system. Storage node 160 receives a request from client 120 to
write to the same file in the file system.
[0080] Storage node 150 communicates with control node 130 to
determine metadata and location information associated with the
file. Token handler 330 of storage node 150 requests a token from
control node 130 to write to the file. Control node 130 generates a
token allowing a write access operation to the object storage in
Volume 530 by storage node 150. Using the token received from the
control node, storage node 150 then reads the file from Volume 530
to service the request from the client 110. Storage node 150 may
attempt to renew the token, to continue write access to the file in
Volume 530 as further requested by client 110.
Redirection and Load Balancing
[0081] Given a distributed remote file system service implemented
by N servers storing M file systems, the present invention
describes techniques and mechanisms for taking client sessions
initiated to a single virtual IP address, determining which file
server should handle the new session, and transparently redirecting
the client to that server, based on heuristics and collected
statistics. These techniques are applicable to client systems that
use standard remote file access protocols such as NFS, CIFS, HTTP
or FTP.
[0082] FIG. 6 is a block diagram of a storage system 600 including
a number of storage servers implementing a distributed file system
with clients connecting to a virtual Internet Protocol address
(VIP) according to an embodiment of the present invention. Storage
system 600 includes storage servers 615, 620, and 625. Storage
server 615 includes a redirection manger/module 640 and a
statistics database 635. Storage server 620 includes a statistics
database 640. Storage server 625 includes a statistics database
645.
[0083] Client 605 and 610 requests require access to a single
virtual Internet Protocol address (VIP) associated with the storage
system 600 to initiate file system mount and other file system
request operations. To provide for the advertising and coordination
of such a cluster-wide globally unique virtual IP address, storage
nodes 615, 620, and 625 (e.g., using standard clustering
technology) elect one node (e.g., storage node 615) to be the
"master" or "coordinator" to advertise the virtual IP address (VIP)
associated with the storage system 600 to the clients 605 and
610.
[0084] The master node typically provides important functions and
services to operations of the storage system 600, but does not
represent a single point of failure. According to various
embodiments, if the master node (storage server 615) ever fails,
the surviving nodes (storage servers 620 and 625) will elect a new
master. Additionally, in some embodiments, as the network of
storage servers grows larger, there is a danger that the master
node could become a performance bottleneck. Various embodiments
mitigate this by providing that, although the master node receives
initial client request, the master nodded delegates the actual work
to other storage servers in the storage system 600 which will field
requests from the clients 605 and 610 directly.
[0085] Each and every storage node collects statistics for itself,
stores them locally (e.g., statistics database 635), and forwards
collected statistics to the master node. In one example, the
storage server 615 groups the statistics into three general
categories:
[0086] 1) Server Statistics: These are standard server load
statistics collected by standard OS and I/O management tools which
include but are not limited to: Load, Packets received, Packets
sent, Memory Used, Memory Free, Uptime, Protocols supported,
Performance characteristic (#CPU's, other h/w attributes), and the
like.
[0087] 2) Client Statistics: These are collected by each server for
each client which include but are not limited to: Client IP
address, Client Protocol used, Client file systems accessed, Client
workload, Client access pattern (read/write ratio, streaming,
mixed, etc), and the like.
[0088] 3) Storage Statistics: These are standard file system and
I/O configuration statistics gathered by standard OS and file
system management tools which include but are not limited to:
Exported list of file systems, Used capacity per file system, Free
capacity per file system, List of block devices in use, List of
free or available block devices, and the like.
[0089] FIG. 7 illustrates a message sequence chart for client
session redirection from an elected master in the storage system of
FIG. 6 to an appropriate storage server according to one embodiment
of the present invention. In this example, client 605 sends a file
system request (OPEN( )) 710 to the master node's VIP (e.g., to
storage server 615). The master storage server 615 consults the
accumulated statistics information in the statistics database 635
based on network parameters associated with the client 605, the
file system being accessed, and the various statistics of all the
file servers available for fielding requests selects an appropriate
storage node to which the client will be redirected.
[0090] According to some embodiments, the storage server 615
accomplishes the redirection without modifying client network file
protocols used by client 605. Accordingly, using built-in methods
in existing network file system protocols, the storage server 615
effectively redirects the client 605 to establish a connection to a
storage node chosen by the master storage server 615.
[0091] In this example, using the NFS protocol, the master storage
server 615 responds (e.g., redirect 720) to the request from the
client 605 with a manufactured symbolic link which includes the
storage node Internet Protocol (IP) address of storage node 620
followed by a path (i.e. /10.10.0.2/engineering). Upon receiving
the response 720, the client 605 uses the widely available
automounter to follow this symbolic link and mount the exported
file system on the storage node 620 advertised via the symbolic
link. In this fashion, the client 605 has established a session
with the master storage server 615 using the VIP and is
transparently redirected to the storage node 620 exporting a file
system based on a wide range of statistics collected from each
storage server by the master.
[0092] In some embodiments, such as the case of commonly used
Windows based clients using the CIFS protocol, master storage
server 615 accomplishes redirection and load balancing using the
same effect by masquerading to be a CIFS distributed file system
(DFS) root server to CIFS clients. Upon receiving file system
requests, storage server 615 returns a DFS junction point
redirection response forcing the Windows CIFS client to establish a
connection with a storage node chosen by the master. All subsequent
file operations will be performed directly on the chosen storage
node.
[0093] In some embodiments, if client 605 is using the HTTP
protocol, the master storage server 615 may respond with an HTTP
Redirect to the client 605 causing the HTTP client 605 to contact
the new server or storage node indicated in the redirect.
[0094] In various embodiments, the client 605 performs file system
operations with the target storage node 620 for the entire session.
Once the session has expired, the redirection process may be
repeated. The client 605 may be potentially redirected to a
different storage node (e.g., storage server 625) for a subsequent
session.
Rule Driven Automation
[0095] According to various embodiments, techniques and mechanism
are provided for deciding which storage device (or devices) a file
should be stored on. These determinations can be used to guide
either the placement of new files or the replication or migration
of existing files to new storage volumes. These determinations may
be made on the basis of simple rules, involving a small number of
readily ascertainable file attributes.
[0096] FIGS. 8A, 8B, and 8C illustrate storage systems for a
network file system that may incorporate embodiments of the present
invention. Referring to FIG. 8A, a client system 805 uses Network
File System (NFS) file access to communicate with a storage server
810. Storage server 810 includes an NFS server 815 and is coupled
to a file system 820. Referring to FIG. 8B, a client system 825
uses Common Internet File System (CIFS) file access to communicate
with a storage server 830. Storage server 830 includes a CIFS
server 835 and is coupled to a file system 840. Referring to FIG.
8C, a client system 845 uses hypertext transport protocol (HTTP)
file access to communicated with a storage server 850. Storage
server 850 includes an http server 855 and is coupled to a file
system 870.
[0097] FIGS. 9A, 9B, and 9C illustrate interconnection of storage
devices to multiple servers that may incorporate embodiments of the
present invention. Referring to FIG. 9A, a storage server 905
includes a small computer systems interface (SCSI) host bus adapter
(HBA) 910. SCSI HBA 910 is coupled to three SCSI disk drives 915.
Referring to FIG. 9B, a storage server 920 includes a fiber channel
(FC) HBA 925. FC HBA 925 is coupled to a storage area network (SAN)
switch 930. SAN switch 930 is coupled to three FC disks 935.
Referring to FIG. 9C, a storage server 940 includes an Ethernet
interface 945 and is coupled to a server 950 and a server 970.
Server 950 includes an Ethernet interface 955 and a serial advanced
technology attachment (SATA) interface 960 coupled to the SATA
disks 965. Server 970 includes an Ethernet interface 975 and SATA
interface 980 coupled to two SATA disks 985.
[0098] FIG. 10 is a block diagram illustrating a layering of
primary performance-impacting components in remote file access that
may be incorporated in embodiments of the present invention.
Application layer 1010 includes performance-impacting components,
such as data locality, write size frequency, and read size read
rate. Operating system (OS) layer 1020 includes
performance-impacting components block size and allocation,
followed by caching and scheduling. Below OS layer 1020 are
performance-impacting components, such as system bus 1030, disk
controller and associated cache 1040, channel speed 1050, and disk
speed (RPMs) 1060).
[0099] FIGS. 11A, 11B, and 11C are high level flowcharts for a
method of selecting an appropriate storage volume for a file using
rules according to one embodiment of the present invention. FIG.
11A begins in step 1100. In step 1105, a storage system (e.g.,
storage server 810) receives input from a user or system
administrator to define one or more storage classes.
[0100] In general, most storage systems, storage management
systems, operating systems, file systems, and remote file access
protocols have a variety of tunable parameters (e.g., parameters
associated with performance-impacting components such as those
illustrated in FIG. 10). According to one embodiment, the user or
system administrator uses a Graphical User Interface (GUI) to
define new storage class names and to associate one or more storage
class names with each known volume.
[0101] The terms "volume" or "storage volume" are used to generally
to describe, not merely physical disk drives, but subsets of disk
drives, combinations of disk drives, or any other combination of
components that presents a similar randomly addressable block
storage interface.
[0102] In step 1110, storage server 810 receives input from the
user or system administrator to associated the storage classes with
one or more volumes. In step 1115, storage server 810 receives
input from the user or system administrator to create rules
associated with the storage classes. In general, a rule comprises
criteria for identifying a file and the rule defines a storage
class for the files that satisfy the criteria. According to one
embodiment, the user or system administrator may create criteria to
create a rule that select files based on name related
characteristics. The criteria may be specified as string-matching
criteria (such as that defined by the POSIX regular expression
functions, e.g., "name:*.mp3").
[0103] The user or system administrator may also specify criteria
to create a rule that involves numerical characteristics (such as
size and times) written as algebraic equalities (or inequalities)
involving variable names (e.g., "size>128 k"). Criteria may also
be specified to create rules that involve enumerated values (such
as ownership, access, class, auxiliary properties, and the like)
stated as Boolean statements (e.g. "owner=joe|mark"). In these
embodiments, each rule involves a Boolean combination (a
parenthesized expression, involving AND, OR and NOT operators) of
the above described criteria expressions. One example of a Boolean
statement is ((suffix:mp3) & (size>128 K) & (read>3
days)).
[0104] As discussed above, each rule also includes one or more
storage class specifications. A storage class specification
includes an optional replication factor and one or more storage
classes. One example of a storage class is (3, un-cached-stream,
un-cached). Storage class specifications may be modified by one or
more of the following qualifiers: [0105] same prefer the same
volume as parent directory [0106] different prefer different volume
from parent directory [0107] near prefer a volume that is close to
the original [0108] far prefer a volume that is far from the
original [0109] leastfull prefer the least full volume [0110]
leastbusy prefer a volume on the least busy server [0111] next
choose volumes in a round-robin fashion
[0112] In some embodiments, "near" and "far" may me implemented
using a subnet address to define affinity, with same subnet being
near, and different subnet being far.
[0113] While system administrators or system managers could
directly write rule expressions, various embodiments of the present
invention include a Graphical User Interface (GUI), wherein a user
may select file characteristics and characteristic-specific tests.
FIG. 11A ends in step 1120.
[0114] FIG. 11B is a flowchart of a method of rule driven
automation for newly created files. FIG. 11B begins in step 1125.
In some embodiment, the storage server 810 may receive a list of
files. The list of files may include files to be created by the
storage server 810 or another storage server. The list of files may
also include one or more files to be replicated and/or migrated
within a storage system.
[0115] In step 1135, the storage server 810 applies rules to
determine the storage class associated with each file in the list
of files based on file attributes of each file. For example, given
a particular file (to be either created or to be checked for
replication or migration), storage server 810 obtains values for
file characteristics associated with the file and evaluates
expressions in one or more rules defined by a system
administrator.
[0116] In some embodiments, the storage server 810 applies each
rule, in order, to the file, until the conditions specified by a
rule are satisfied (e.g., evaluate to TRUE). The first rule
satisfied yields one or more storage class specifications.
[0117] In step 1140, the storage server 810 determines and selects
one more volumes associated with the storage class of the satisfied
rule. In one embodiment, the storage server 810 starts with the
first storage class specification for the first satisfied rule.
Storage server 810 then identifies the volumes that satisfy that
storage class specification. Storage server 810 may prioritize
those volumes according to specified qualifiers (e.g., where
earlier specified qualifiers have higher precedence). Storage
server 810 then selects the specified number of volumes from the
prioritized list.
[0118] If insufficiently many volumes are available, the storage
server 810 moves on to the next storage class specification. If it
is not possible for the storage server 810 to find volumes that
meet those specifications, the storage server 810 may log an error
message and continue evaluating subsequent rules. If no rules are
satisfied or appropriate volumes do not exist, the storage server
810 may leave existing files on the volume where the files
currently reside. New files are then created on the same volume
that contains their parent directory.
[0119] In step 1145, the storage server 810 creates the files on
the selected volumes in the file system. FIG. 11B ends in step
1150.
[0120] FIG. 11C is a flow chart of a rule driven method for file
replication and migration. FIG. 11C begins in step 1155 when the
storage server performs a periodic (or event driven) audit of the
correctness of file placement and replication. In step 1165, the
storage server enumerates all of the managed files. For each file,
in step 1170, storage server 810 applies the rules to determine the
storage class associated with that file based on its
attributes.
[0121] In step 1175, if migration is needed, storage server 810
selects one or more volumes associated with the determined storage
class associated with the satisfied rules in step 1180. In step
1185, storage server 810 generates one or more tasks to migrate the
file to the selected one or more volumes associated with the
storage classes.
[0122] If migration is not needed, then in step 1190, storage
server 810 determines when a copy operations is needed. If yes,
storage server 810 selects one or more volumes associated with the
determined storage class associated with the satisfied rules in
step 1192. In step 1194, storage server 810 generates one or more
tasks to copy the file to the selected one or more volumes
associated with the storage classes.
[0123] In step 1196, storage server 810 determines whether all
files in the list of files have been processed. If not all files
have been processed, storage server 810 continues to apply the
rules to the remaining files. FIG. 11C ends in step 1198.
[0124] FIG. 12 is a block diagram illustrating file characteristics
used for determining a storage volume according to one embodiment
of the present invention. In a file system 1200, a mounting point
1210 provides access to mounted file system 1220 including one or
more directories. A sub-directory 1230 includes a file 1240 named
"MYFILE.MP3." File 1240 includes a base name 1250 and a suffix
1260. File 1240 is associated with file attributes 1270. In this
example, file attributes 1270 includes a size, an owner identifier,
a group identifier, creation time (ctime), modification time
(mtime), and access time (atime).
[0125] In general, a set of attributes and/or characteristics
associated with a file that can be determined quickly and easily,
without having to observe how the file is used, and are supported
by most operating systems and file systems. One example of a file
attribute is the name of a file. The name of the file may be broken
into components, such as context (e.g., a file system or
mount-point), the name of the directory in which the file resides,
the suffix of the file name, a base name (after the directory and
before the suffix), and the like. Other examples of attributes
and/or characteristics associated with a file are the size of the
file (e.g., in bytes, kilobytes, or megabytes), the time since the
file was created (e.g., expressed as a number of minutes, hours,
days, weeks, months, or years), the time since the file was last
written, the time since the file was last read, the identity of the
user who created the file (typically an alpha-numeric string,
perhaps with simple punctuation), the identity of an affiliated
group that enjoys special access privileges to the file, the access
privileges associated with the file (typically expressed as a list
of privileges or <name, privilege> pairs, the type of the
file (as determined by existing operating system specific classing
engines), and the like. Some operating systems and file systems
allow arbitrary auxiliary properties to be associated with
files.
[0126] In various embodiments, the file attributes, in addition to
being easily ascertainable, may also be represented in a form that
makes the file attribute easily recognized by simple rules. Many
such languages are possible. FIG. 13 is an example of a general
grammar for rules defining storage classes according to one
embodiment of the present invention.
Replication
[0127] According to various embodiments, file system independent
techniques and mechanisms for replicating files on multiple devices
are provided, migrating files from one device to another (for
purposes of reliability, increased bandwidth, load balancing,
capacity expansion, or reduced cost), and propagating updates from
a master copy to remote replicas. The mechanisms involve work
queues and asynchronous file migration daemons that operate
independently from and in parallel with the primary client-server
and network protocol to on-disk storage data paths.
[0128] FIG. 14 is a block diagram illustrating a distributed file
system 1400 with multiple client and storage server nodes, each
serving its own storage volumes, where storage node 1450 has been
elected as a master according to one embodiment of the present
invention. In this example, distributed file system 1400 includes
clients 1410 and 1420 and storage servers 1430, 1440, and 1450.
[0129] In some embodiments, the distributed file system 1400
enables client computers 1410 and 1420 to access files from storage
servers 1430, 1440, and 1450 via standard remote file system
protocols. For reasons of robustness, capacity, and scalability,
the storage servers 1430, 1440, and 1450 distributed the file
systems
[0130] Typically, clients 1410 and 1420 generate requests can be
entirely performed on a single storage server. Some operations,
however, require coordinated updates to other storage nodes (e.g.,
the other nodes that store copies of a particular file). To provide
for the coordination of such cooperative updates, in various
embodiments the storage servers 1430, 1440, and 1450 (e.g., using
standard clustering technology) elect one node (e.g., storage
server 1450 to be the "master" or "coordinator."
[0131] FIG. 15 is a block diagram illustrating elected work manager
1450 and multiple storage nodes 1430 and 1440 according to one
embodiment of the present invention. In this example, each of the
storage nodes 1430, 1440, and 1450 include a replication agent
1510, 1520, and 1530 respectively. Storage node 1450, as elected
master, includes a work manager 1540. Work manager 1540 generates
tasks to be performed by other storage servers in response to
events. The tasks are placed in work queues 1550 for retrieval by
the replication agents 1510, 1520, and 1530 to be performed by the
respective storage nodes.
[0132] In this example, communication from the work manager 1540 to
the background replication agents 1510, 1520, and 1530 is
accomplished through entries in (per storage node) work queues. An
entry (task) on such a queue includes, at minimum: a file name, an
operation, and a completion status. The completion status reflects,
at minimum, the following states: [0133] enqueued: not yet serviced
[0134] success: operation performed successfully [0135] failure:
unable to perform operation
[0136] According to some embodiments, the work manager 1540 may
support one or more of the following additional states: [0137] in
progress: received, not yet completed [0138] cancelled: requester
no longer wants this operation [0139] waiting: additional resources
needed [0140] retrying: trying to correct a problem
[0141] In general, the work queues are persistent, and able to
survive failures of the current master node.
[0142] In various embodiments, the most common types of request
that require coordination are: [0143] 1. file replication [0144] 2.
file update propagation [0145] 3. file deletion [0146] 4. file
migration
[0147] FIGS. 16A, 16B, 16C, and 16D are flowcharts of methods of
managing work tasks using the work manager 1540 of the storage
server 1450 according to one embodiment of the present invention.
FIG. 16A is a flowchart of a method for replication of files in the
storage system 1400. FIG. 16A begins in step 1602. In step 1604,
work manager 1540 of the master storage server 1450 receives a
replication task to be performed by a storage server. For each
replica to be copies in step 1606, work manager 1540 of the storage
server 1450 builds a remote copy request in step 1608.
[0148] In step 1610, work manager 1540 of the master storage server
1450 places the remote copy request on the work queue 1550 of the
storage server that will create the replica. In step 1612, work
manager 1540 of storage server 1450 awaits completion of the remote
copy request. Optionally, in step 1614, work manager 1540 of
storage server 1450 updates a file to location map in response to
the completed remote copy request.
[0149] In step 1616, work manager 1540 of master storage server
1450 determines whether all replicas are done. If not, the next
replica is created beginning in step 1606. If all replicas are done
in step 1616, FIG. 16A ends in step 1618.
[0150] In step 1625, work manager 1540 of the master storage server
1450 determines whether the event indicates a replication file
operation. If yes, work manager 1540 of the storage server 1450
generates a task to perform a remote copy of a file to one or more
storages servers that store a replica of the file in step 1620.
[0151] FIG. 16B is a flowchart of a method for updating files in
the storage system 1400. FIG. 16B begins in step 1620. In step
1622, work manager 1540 of the master storage server 1450 receives
an update task to be performed by a storage server. In step 1624,
work manager 1540 of the storage server 1450 builds a remote copy
request.
[0152] In step 1626, work manager 1540 of the master storage server
1450 places the remote copy request on the work queue 1550 of the
storage server that will update the copy of the file. In step 1628,
work manager 1540 of storage server 1450 awaits completion of the
remote copy request. FIG. 16B ends in step 1618.
[0153] FIG. 16C is a flowchart of a method for deleting files in
the storage system 1400. FIG. 16B begins in step 1632. In step
1634, work manager 1540 of the master storage server 1450 receives
a delete task to be performed by a storage server. In step 1636,
work manager 1540 of the storage server 1450 builds a remote delete
request.
[0154] In step 1638, work manager 1540 of the master storage server
1450 places the remote delete request on the work queue 1550 of the
storage server that will delete the file. In step 1640, work
manager 1540 of storage server 1450 awaits completion of the remote
delete request. Optionally, in step 1642, work manager 1540 of
storage server 1450 updates a file to location map in response to
the completed remote delete request. FIG. 16C ends in step
1644.
[0155] FIG. 16D is a flowchart of a method for migrating files in
the storage system 1400. FIG. 16D begins in step 1646. In step
1648, work manager 1540 of the master storage server 1450 receives
an migration task to be performed by a storage server. In step
1650, work manager 1540 of the storage server 1450 builds a remote
copy request.
[0156] In step 1652, the master storage server 1450 places the
remote copy request on the work queue 1550 of the storage server
that will copy the file to perform the migration. In step 1654,
work manager 1540 of storage server 1450 awaits completion of the
remote copy request. Optionally, in step 1656, work manager 1540 of
storage server 1450 updates a file to location map in response to
the completed remote copy request.
[0157] In step 1658, work manager 1540 of the master storage server
1450 builds a remote delete request. In step 1660, work manager
1540 of the master storage server 1450 places the remote delete
request on the work queue 1550 of the storage server that will
delete the file to complete the migration. Optionally, work manager
1540 of storage server 1450 may await completion of the remote
delete request. FIG. 16D ends in step 1662.
[0158] In some embodiments, work manager 1540 of the master storage
server 1450 may incorporate a function that automatically maps file
names into the identity of a storage node that stores that file.
Where such mapping functions exist, the work manager 1530 of the
storage server 1450 also updates that map: 1) to reflect the
location of new copies after a successful replication 2) to reflect
the new location after a migration, and 3) before the deletion of
the original copy to reflect deletions.
[0159] FIG. 17 is a flowchart of a method of servicing work queues
using remote replication agent 1510 of storage server 1430
according to one embodiment of the present invention. FIG. 17
begins in step 1700. In step 1700, the storage server 1430 polls
the work queue 1550 of the master storage server 1450 for the next
task. If the work queue 1550 is empty, the replication agent 1510
of storage server 1430 waits for a predetermined period of time
before checking the work queue 1550 for additional tasks.
[0160] If there are tasks in the work queue 1550 for storage server
1430, in step 1715, the storage server 1430 receives the next task.
In step 1720, the storage server 1430 determines whether the task
has been cancelled. If the task has been cancelled, the storage
server 1430 marks the task as failed in step 1725. If the task has
not been cancelled, in step 1730, the storage server 1430 updates
the work manager 1540 of master storage server 1450 that the task
received from the work queue 1550 is in-progress.
[0161] In step 1735, the storage server 1430 performs the received
task. Storage server 1430 may perform one or more actions
associated with the task. Some examples of actions are to copy a
file, delete a file, replicate a file, and the like. In step 1740,
the storage server 1430 updates the master storage server 1450 with
the results of the one or more actions performed. In some
embodiments, the storage server 1430 updates the master storage
server 1450 with a success or failure based on the performances of
the one or more actions.
[0162] In step 1745, the storage server 1430 signals the work
managers 1540 of master storage server 1450 that the task is
complete. The storage server 1430 also signals the work managers
1540 of master storage server 1450 that the task is complete if the
task has been cancelled in step 1720. In either event, storage
server 1430 then continues to poll the work queue 1550 for the next
task in step 1705.
[0163] In various embodiment, in each case the storage server 1430
requests the next operation from its associated queue, updates the
status to show the request is in progress, performs the task,
updates the status of the request to reflect success or failure,
and then signals the work coordinator that the request is
complete.
[0164] In some embodiments, for remote copy operations, the remote
replication agent 1510 of the storage server 1430 opens and reads
the remote file, and then writes that data into a file on the
specified local file system. In one embodiment, remote files are
obtained via NFS cross mounts. In another implementation, remote
files are obtained via HTTP. In another embodiment, remote files
are obtained via FTP.
[0165] There are many possible implementations of highly available
distributed work queues. In one embodiment, the work queues 1550
are implemented via remote procedure calls which are mirrored to a
designated successor to the current master node. In another
embodiment, the work queues 1550 are implemented as updates to a
shared highly available database.
[0166] FIG. 18 is a block diagram of a computer system 1800
suitable for implementing an embodiment of the present invention.
Computer system 1800 typically includes a monitor 1810, computer
1820, a keyboard 1830, a user input device 1840, and a network
interface 1850. User input device 1840 includes a computer mouse, a
trackball, a track pad, graphics tablet, touch screen, and/or other
wired or wireless input devices that allow a user to create or
select graphics, objects, icons, and/or text appearing on the
monitor 1810. Embodiments of network interface 1850 typically
provides wired or wireless communication with an electronic
communications network, such as a local area network, a wide area
network, for example the Internet, and/or virtual networks, for
example a virtual private network (VPN).
[0167] Computer 1820 typically includes components such as one or
more general purpose processors 1860, and memory storage devices,
such as a random access memory (RAM) 1870, disk drives 1880, and
system bus 1890 interconnecting the above components. RAM 1870 and
disk drive 1880 are examples of tangible media for storage of data,
audio/video files, computer programs, applet interpreters or
compilers, virtual machines, and embodiments of the herein
described invention. Other types of tangible media include floppy
disks; removable hard disks; optical storage media such as DVD-ROM,
CD-ROM, and bar codes; non-volatile memory devices such as flash
memories; read-only-memories (ROMS); battery-backed volatile
memories; and networked storage devices.
[0168] The present invention can be implemented in the form of
control logic in software or hardware or a combination of both. The
control logic may be stored in an information storage medium as a
plurality of instructions adapted to direct an
information-processing device to perform a set of steps disclosed
in embodiments of the present invention. Based on the disclosure
and teachings provided herein, a person of ordinary skill in the
art will appreciate other ways and/or methods to implement the
present invention.
[0169] The above description is illustrative but not restrictive.
Many variations of the invention will become apparent to those
skilled in the art upon review of the disclosure. The scope of the
invention should, therefore, be determined not with reference to
the above description, but instead should be determined with
reference to the pending claims along with their full scope or
equivalents.
* * * * *