text:
|Publication number
|Publication type
|Application number
|Publication date
|Aug 3, 2010
|Filing date
|Apr 10, 2006
|Priority date
|Mar 19, 2002
|Fee status
|Also published as
|Publication number
|Michael L. Federwisch, Shane S. Owara, Stephen L. Manley
|Original Assignee
|Netapp, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (19), Non-Patent Citations (35), Referenced by (28), Classifications (21), Legal Events (1)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is related to the following U.S. Patent Applications:
This application is a Continuation of U.S. Ser. No. 10/126,822 filed on Apr. 19, 2002, entitled SYSTEM AND METHOD FOR CHECKPOINTING AND RESTARTING AN ASYCHRONOUS TRANSFER OF DATA BETWEEN A SOURCE AND DESTINATION SNAPSHOT, now issued as U.S. Pat. No. 7,039,663 on May 2, 2006.
Ser. No. 10/100,950, filed Mar. 19, 2002 entitled SYSTEM AND METHOD FOR ASYNCHRONOUS MIRRORING OF SNAPSHOTS AT A DESTINATION USING A PURGATORY DIRECTORY AND INODE MAPPING, now issued as U.S. Pat. No. 7,225,204 on May 29, 2007, by Stephen L. Manley, et al., the teachings of which are expressly incorporated herein by reference;
Ser. No. 10/100,945, filed Mar. 19, 2002 entitled SYSTEM AND METHOD FOR STORAGE OF SNAPSHOT METADATA IN A REMOTE FILE, now issued as U.S. Pat. No. 7,043,485 on May 9, 2006, by Stephen L. Manley, et al., the teachings of which are expressly incorporated herein by reference;
Ser. No. 10/100,434, filed Mar. 19, 2002 entitled SYSTEM AND METHOD FOR REDIRECTING ACCESS TO A REMOTE MIRRORED SNAPSHOT, now issued as U.S. Pat. No. 7,010,553 on Mar. 7, 2006, by Raymond C. Chen, et al., the teachings of which are expressly incorporated herein by reference;
Ser. No. 10/100,879, filed Mar. 19, 2002 entitled FORMAT FOR TRANSMISSION OF FILE SYSTEM INFORMATION BETWEEN A SOURCE AND A DESTINATION, now issued as U.S. Pat. No. 7,007,046 on Feb. 28, 2006, by Stephen L. Manley, et al., the teachings of which are expressly incorporated herein by reference; and
Ser. No. 10/100,967, filed Mar. 19, 2002 entitled SYSTEM AND METHOD FOR DETERMINING CHANGES IN TWO SNAPSHOTS AND FOR TRANSMITTING CHANGES TO A DESTINATION SNAPSHOT, now issued as U.S. Pat. No. 6,993,539 on Jan. 31, 2006, by Michael L. Federwisch, et al., the teachings of which are expressly incorporated herein by reference.
This invention relates to storage of data using file servers and more particularly to mirroring or replication of stored data in remote storage locations over a network.
A file server is a computer that provides file service relating to the organization of information on storage devices, such as disks. The file server or filer includes a storage operating system that implements a file system to logically organize the information as a hierarchical structure of directories and files on the disks. Each "on-disk" file may be implemented as a set of data structures, e.g., disk blocks, configured to store information. A directory, on the other hand, may be implemented as a specially formatted file in which information about other files and directories are stored.
A filer may be further configured to operate according to a client/server model of information delivery to thereby allow many clients to access files stored on a server, e.g., the filer. In this model, the client may comprise an application, such as a database application, executing on a computer that "connects" to the filer over a direct connection or computer network, such as a point-to-point link, shared local area network (LAN), wide area network (WAN), or virtual private network (VPN) implemented over a public network such as the Internet. Each client may request the services of the file system on the filer by issuing file system protocol messages (in the form of packets) to the filer over the network.
A common type of file system is a "write in-place" file system, an example of which is the conventional Berkeley fast file system. By "file system" it is meant generally a structuring of data and metadata on a storage device, such as disks, which permits reading/writing of data on those disks. In a write in-place file system, the locations of the data structures, such as inodes and data blocks, on disk are typically fixed. An inode is a data structure used to store information, such as metadata, about a file, whereas the data blocks are structures used to store the actual data for the file. The information contained in an inode may include, e.g., ownership of the file, access permission for the file, size of the file, file type and references to locations on disk of the data blocks for the file. The references to the locations of the file data are provided by pointers in the inode, which may further reference indirect blocks that, in turn, reference the data blocks, depending upon the quantity of data in the file. Changes to the modes and data blocks are made "in-place" in accordance with the write in-place file system. If an update to a file extends the quantity of data for the file, an additional data block is allocated and the appropriate inode is updated to reference that data block.
Another type of file system is a write-anywhere file system that does not over-write data on disks. If a data block on disk is retrieved (read) from disk into memory and "dirtied" with new data, the data block is stored (written) to a new location on disk to thereby optimize write performance. A write-anywhere file system may initially assume an optimal layout such that the data is substantially contiguously arranged on disks. The optimal disk layout results in efficient access operations, particularly for sequential read operations, directed to the disks. A particular example of a write-anywhere file system that is configured to operate on a filer is the Write Anywhere File Layout (WAFL™) file system available from Network Appliance, Inc. of Sunnyvale, Calif. The WAFL file system is implemented within a microkernel as part of the overall protocol stack of the filer and associated disk storage. This microkernel is supplied as part of Network Appliance's Data ONTAP™ software, residing on the filer, that processes file-service requests from network-attached clients.
As used herein, the term "storage operating system" generally refers to the computer-executable code operable on a computer that manages data access and may, in the case of a filer, implement file system semantics, such as the Data ONTAP™ storage operating system, implemented as a microkernel, and available from Network Appliance, Inc. of Sunnyvale, Calif., which implements a Write Anywhere File Layout (WAFL™) file system. The storage operating system can also be implemented as an application program operating over a general-purpose operating system, such as UNIX� or Windows NT�, or as a general-purpose operating system with configurable functionality, which is configured for storage applications as described herein.
Disk storage is typically implemented as one or more storage "volumes" that comprise physical storage disks, defining an overall logical arrangement of storage space. Currently available filer implementations can serve a large number of discrete volumes (150 or more, for example). Each volume is associated with its own file system and, for purposes hereof, volume and file system shall generally be used synonymously. The disks within a volume are typically organized as one or more groups of Redundant Array of Independent (or Inexpensive) Disks (RAID). RAID implementations enhance the reliability/integrity of data storage through the redundant writing of data "stripes" across a given number of physical disks in the RAID group, and the appropriate caching of parity information with respect to the striped data. In the example of a WAFL file system, a RAID 4 implementation is advantageously employed. This implementation specifically entails the striping of data across a group of disks, and separate parity caching within a selected disk of the RAID group. As described herein, a volume typically comprises at least one data disk and one associated parity disk (or possibly data/parity partitions in a single disk) arranged according to a RAID 4, or equivalent high-reliability, implementation.
In order to improve reliability and facilitate disaster recovery in the event of a failure of a filer, its associated disks or some portion of the storage infrastructure, it is common to "mirror" or replicate some or all of the underlying data and/or the file system that organizes the data. In one example, a mirror is established and stored at a remote site, making it more likely that recovery is possible in the event of a true disaster that may physically damage the main storage location or it's infrastructure (e.g. a flood, power outage, act of war, etc.). The mirror is updated at regular intervals, typically set by an administrator, in an effort to catch the most recent changes to the file system. One common form of update involves the use of a "snapshot" process in which the active file system at the storage site, consisting of inodes and blocks, is captured and the "snapshot" is transmitted as a whole, over a network (such as the well-known Internet) to the remote storage site. Generally, a snapshot is an image (typically read-only) of a file system at a point in time, which is stored on the same primary storage device as is the active file system and is accessible by users of the active file system. By "active file system" it is meant the file system to which current input/output operations are being directed. The primary storage device, e.g., a set of disks, stores the active file system, while a secondary storage, e.g. a tape drive, may be utilized to store backups of the active file system. Once snapshotted, the active file system is reestablished, leaving the snapshotted version in place for possible disaster recovery. Each time a snapshot occurs, the old active file system becomes the new snapshot, and the new active file system carries on, recording any new changes. A set number of snapshots may be retained depending upon various time-based and other criteria. The snapshotting process is described in further detail in U.S. patent application Ser. No. 09/932,578, entitled INSTANT SNAPSHOT by Blake Lewis et al., which is hereby incorporated by reference as though fully set forth herein. In addition, the native Snapshot™ capabilities of the WAFL file system are further described in TR3002 File System Design for an NFS File Server Appliance by David Hitz et al., published by Network Appliance, Inc., and in commonly owned U.S. Pat. No. 5,819,292 entitled METHOD FOR MAINTAINING CONSISTENT STATES OF A FILE SYSTEM AND FOR CREATING USER-ACCESSIBLE READ-ONLY COPIES OF A FILE SYSTEM by David Hitz et al., which are hereby incorporated by reference.
The complete recopying of the entire file system to a remote (destination) site over a network may be quite inconvenient where the size of the file system is measured in tens or hundreds of gigabytes (even terabytes). This full-backup approach to remote data replication may severely tax the bandwidth of the network and also the processing capabilities of both the destination and source filer. One solution has been to limit the snapshot to only portions of a file system volume that have experienced changes. Hence,
In brief summary, the source creates a pair of time-separated snapshots of the volume. These can be created as part of the commit process in which data is committed to non-volatile memory in the filer or by another mechanism. The "new" snapshot 110 is a recent snapshot of the volume's active file system. The "old" snapshot 112 is an older snapshot of the volume, which should match the image of the file system replicated on the destination mirror. Note, that the file server is free to continue work on new file service requests once the new snapshot 112 is made. The new snapshot acts as a checkpoint of activity up to that time rather than an absolute representation of the then-current volume state. A differencer 120 scans the blocks 122 in the old and new snapshots. In particular, the differencer works in a block-by-block fashion, examining the list of blocks in each snapshot to compare which blocks have been allocated. In the case of a write-anywhere system, the block is not reused as long as a snapshot references it, thus a change in data is written to a new block. Where a change is identified (denoted by a presence or absence of an 'X' designating data), a decision process 200, shown in
Approaches to volume-based remote mirroring of snapshots are described in detail in commonly owned U.S. patent application Ser. No. 09/127,497, entitled FILE SYSTEM IMAGE TRANSFER by Steven Kleiman, et al. and U.S. patent application Ser. No. 09/426,409, entitled FILE SYSTEM IMAGE TRANSFER BETWEEN DISSIMILAR FILE SYSTEMS by Steven Kleiman, et al., both of which patents are expressly incorporated herein by reference.
This volume-based approach to incremental mirroring from a source to a remote storage destination is effective, but may still be inefficient and time-consuming as it forces an entire volume to be scanned for changes and those changes to be transmitted on a block-by-block basis. In other words, the scan focuses on blocks without regard to any underlying information about the files, inodes and data structures, which the blocks comprise. The destination is organized as a set of volumes so a direct volume-by-volume mapping is established between source and destination. Again, where a volume may contain a terabyte or more of information, the block-by-block approach to scanning and comparing changes may still involve significant processor overhead and associated processing time. Often, there may have been only minor changes in a sub-block beneath the root inode block being scanned. Since a list of all blocks in the volume is being examined, however, the fact that many groupings of blocks (files, inode structures, etc.) are unchanged is not considered. In addition, the increasingly large size and scope of a full volume make it highly desirable to sub-divide the data being mirrored into sub-groups, because some groups are more likely to undergo frequent changes, it may be desirable to update their replicas more often than other, less-frequently changed groups. In addition, it may be desirable to mingle original and replicated (snapshotted) sub-groups in a single volume and migrate certain key data to remote locations without migrating an entire volume. Accordingly, a more sophisticated approach to scanning and identifying changed blocks may be desirable, as well as a sub-organization for the volume that allows for the mirroring of less-than-an-entire volume.
One such sub-organization of a volume is the well-known qtree. Qtrees, as implemented on an exemplary storage system such as described herein, are subtrees in a volume's file system. One key feature of qtrees is that, given a particular qtree, any file or directory in the system can be quickly tested for membership in that qtree, so they serve as a good way to organize the file system into discrete data sets. The use of qtrees as a source and destination for snapshotted data is desirable.
A transfer of update data from a source to a destination may take a significant amount of time. As an asynchronous (lazy write) procedure is used to perform the transfer, several minutes or hours may elapse before the transfer completes. Within the intervening time, it is possible that a crash, communication failure or other exigent circumstance may interrupt the transfer.
Accordingly, it is desirable to provide a technique for tracking the data committed to persistent storage by a destination receiving mirrored or other data streams.
This invention overcomes the disadvantages of the prior art by providing a system and method for generating checkpoints into an asynchronous transfer of data between a source file system and a replicated destination file system so as to allow the source to maintain synchronization in the transfer with the current state of the destination. More specifically, in an illustrative embodiment the data transferred from the source to the destination typically represents changes between a base and incremental snapshot on the source file system used for updating the replicated destination file system so that it reflects the state of the incremental snapshot.
In an illustrative embodiment, a discrete checkpoint value or number is inserted into a segment of the overall data stream being sent from a source to a destination at regular intervals. These intervals can be based upon a predetermined an amount of data transferred, an elapsed time, or both. Concurrently with the insertion of this checkpoint number, the state of the source is stored in a source-based registry that is associated with the checkpoint number. In the event of a loss of communication between the source and the destination file systems (after some predetermined time lapsed or event indicating a communication loss), the destination can alert the source to the last checkpoint reached by the destination in committing the data stream to a destination-related persistent storage medium, such as a disk, NVRAM or the like. The source can follow up the alert by utilizing the checkpoint information to reinitialize the so as to retransmit the data stream starting from the segment following the last-fully committed segment (i.e. the beginning of the next incremental checkpoint number after the number provided by the destination). Alternatively an earlier checkpoint, than the last checkpoint can be used. In other words, the resumed procedure will send any new data starting from the last checkpointed segment successfully written or stored by the destination.
In an illustrative embodiment, the checkpoint numbers are provided to the data stream as entries in data format headers. The data format can be an extensible, file system-independent format adapted to be encapsulated in a networking protocol, such as TCP/IP. Additionally, the changes sent from the source file system to the destination file system relate to a sub-organization of a volume on the source. In one embodiment this sub-organization is a qtree, identified by a qtree identifier (ID) in the associated modes and data stream.
The above and further advantages of the invention may be better understood by referring to the following description in conjunction with the accompanying drawings in which like reference numerals indicate identical or functionally similar elements:
By way of further background,
In the particular example of a pair of networked source and destination filers, each filer 310 and 312 can be any type of special-purpose computer (e.g., server) or general-purpose computer, including a standalone computer. The source and destination filers 310, 312 each comprise a processor 320, a memory 325, a network adapter 330 and a storage adapter 340 interconnected by a system bus 345. Each filer 310, 312 also includes a storage operating system 400 (
It will be understood to those skilled in the art that the inventive technique described herein may apply to any type of special-purpose computer (e.g., file serving appliance) or general-purpose computer, including a standalone computer, embodied as a storage system. To that end, the filers 310 and 312 can each be broadly, and alternatively, referred to as storage systems. Moreover, the teachings of this invention can be adapted to a variety of storage system architectures including, but not limited to, a network-attached storage environment, a storage area network and disk assembly directly-attached to a client/host computer. The term "storage system" should, therefore, be taken broadly to include such arrangements.
In the illustrative embodiment, the memory 325 comprises storage locations that are addressable by the processor and adapters for storing software program code. The memory comprises a form of random access memory (RAM) that is generally cleared by a power cycle or other reboot operation (i.e., it is "volatile" memory). The processor and adapters may, in turn, comprise processing elements and/or logic circuitry configured to execute the software code and manipulate the data structures. The operating system 400, portions of which are typically resident in memory and executed by the processing elements, functionally organizes the filer by, inter alia, invoking storage operations in support of a file service implemented by the filer. It will be apparent to those skilled in the art that other processing and memory means, including various computer readable media, may be used for storing and executing program instructions pertaining to the inventive technique described herein.
The network adapter 330 comprises the mechanical, electrical and signaling circuitry needed to connect each filer 310, 312 to the network 318, which may comprise a point-to-point connection or a shared medium, such as a local area network. Moreover the source filer 310 may interact with the destination filer 312 in accordance with a client/server model of information delivery. That is, the client may request the services of the filer, and the filer may return the results of the services requested by the client, by exchanging packets 355 encapsulating, e.g., the TCP/IP protocol or another network protocol format over the network 318.
The storage adapter 340 cooperates with the operating system 400 (
Each filer may also be interconnected with one or more clients 370 via the network adapter 330. The clients transmit requests for file service to the source and destination filers 310, 312, respectively, and receive responses to the requests over a LAN or other network (318). Data is transferred between the client and the respective filer 310, 312 using data packets 374 defined as an encapsulation of the Common Internet File System (CIFS) protocol or another appropriate protocol such as NFS.
In one exemplary filer implementation, each filer 310, 312 can include a nonvolatile random access memory (NVRAM) 335 that provides fault-tolerant backup of data, enabling the integrity of filer transactions to survive a service interruption based upon a power failure, or other fault. The size of the NVRAM depends in part upon its implementation and function in the file server. It is typically sized sufficiently to log a certain time-based chunk of transactions (for example, several seconds worth). The NVRAM is filled, in parallel with the buffer cache, after each client request is completed, but before the result of the request is returned to the requesting client.
In an illustrative embodiment, the disks 360 are arranged into a plurality of volumes (for example, source volumes 314 and destination volumes 316), in which each volume has a file system associated therewith. The volumes each include one or more disks 360. In one embodiment, the physical disks 360 are configured into RAID groups so that some disks store striped data and some disks store separate parity for the data, in accordance with a preferred RAID 4 configuration. However, other configurations (e.g. RAID 5 having distributed parity across stripes) are also contemplated. In this embodiment, a minimum of one parity disk and one data disk is employed. However, a typical implementation may include three data and one parity disk per RAID group, and a multiplicity of RAID groups per volume.
To facilitate generalized access to the disks 360, the storage operating system 400 (
The organization of the preferred storage operating system for each of the exemplary filers is now described briefly. However, it is expressly contemplated that the principles of this invention can be implemented using a variety of alternate storage operating system architectures. In addition, the particular functions implemented on each of the source and destination filers 310, 312 may vary. As shown in
Bridging the disk software layers with the network and file system protocol layers is a file system layer 450 of the storage operating system 400. Generally, the layer 450 implements a file system having an on-disk format representation that is block-based using, e.g., 4-kilobyte (KB) data blocks and using inodes to describe the files. In response to transaction requests, the file system generates operations to load (retrieve) the requested data from volumes if it is not resident "in-core", i.e., in the filer's memory 325. If the information is not in memory, the file system layer 450 indexes into the inode file using the inode number to access an appropriate entry and retrieve a volume block number. The file system layer 450 then passes the volume block number to the disk storage (RAID) layer 440, which maps that volume block number to a disk block number and sends the latter to an appropriate driver (for example, an encapsulation of SCSI implemented on a fibre channel disk interconnection) of the disk driver layer 445. The disk driver accesses the disk block number from volumes and loads the requested data in memory 325 for processing by the filer 310, 312. Upon completion of the request, the filer (and storage operating system) returns a reply, e.g., a conventional acknowledgement packet 374 defined by the CIFS specification, to the client 370 over the respective network connection 372.
It should be noted that the software "path" 470 through the storage operating system layers described above needed to perform data storage access for the client request received at the filer may alternatively be implemented in hardware or a combination of hardware and software. That is, in an alternate embodiment of the invention, the storage access request data path 470 may be implemented as logic circuitry embodied within a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC). This type of hardware implementation increases the performance of the file service provided by filer 310, 312 in response to a file system request packet 374 issued by the client 370.
Overlying the file system layer 450 is the snapshot mirroring (or replication) application 490 in accordance with an illustrative embodiment of this invention. This application, as described in detail below, is responsible (on the source side) for the scanning and transmission of changes in the snapshot from the source filer 310 to the destination filer 312 over the network. This application is responsible (on the destination side) for the generation of the updated mirror snapshot from received information. Hence, the particular function of the source and destination applications are different, and are described as such below. The snapshot mirroring application 490 operates outside of the normal request path 470 as shown by the direct links 492 and 494 to the TCP/IP layers 415, 410 and the file system snapshot mechanism (480). Notably, the application interacts with the file system layer to gain knowledge of files so it is able to use a file-based data structure (inode files, in particular) to replicate source snapshots at the destination.
The inherent Snapshot™ capabilities of the exemplary WAFL file system are further described in TR3002 File System Design for an NFS File Server Appliance by David Hitz et al., published by Network Appliance, Inc., which is hereby incorporated by reference. Note, "Snapshot" is a trademark of Network Appliance, Inc. It is used for purposes of this patent to designate a persistent consistency point (CP) image. A persistent consistency point image (PCPI) is a point-in-time representation of the storage system, and more particularly, of the active file system, stored on a storage device (e.g., on disk) or in other persistent memory and having a name or other unique identifiers that distinguishes it from other PCPIs taken at other points in time. A PCPI can also include other information (metadata) about the active file system at the particular point in time for which the image is taken. The terms "PCPI" and "snapshot" shall be used interchangeably through out this patent without derogation of Network Appliance's trademark rights.
Snapshots are generally created on some regular schedule. This schedule is subject to great variation. In addition, the number of snapshots retained by the filer is highly variable. Under one storage scheme, a number of recent snapshots are stored in succession (for example, a few days worth of snapshots each taken at four-hour intervals), and a number of older snapshots are retained at increasing time spacings (for example, a number of daily snapshots for the previous week(s) and weekly snapshot for the previous few months). The snapshot is stored on-disk along with the active file system, and is called into the buffer cache of the filer memory as requested by the storage operating system 400 or snapshot mirror application 490 as described further below. However, it is contemplated that a variety of snapshot creation techniques and timing schemes can be implemented within the teachings of this invention.
An exemplary file system inode structure 500 according to an illustrative embodiment is shown in
When the file system generates a snapshot of a given file system, a snapshot inode is generated as shown in
In accordance with an illustrative embodiment of this invention the source utilizes two snapshots, a "base" snapshot, which represents the image of the replica file system on the destination, and an "incremental" snapshot, which is the image that the source system intends to replicate to the destination, to perform needed updates of the remote snapshot mirror to the destination. In one example, from the standpoint of the source, the incremental snapshot can comprise a most-recent snapshot and the base can comprise a less-recent snapshot, enabling an up-to-date set of changes to be presented to the destination. This procedure shall now be described in greater detail.
Having described the general procedure for deriving a snapshot, the mirroring of snapshot information from the source filer 310 (
As indicated above, it is contemplated that this procedure can take advantage of a sub-organization of a volume known as a qtree. A qtree acts similarly to limits enforced on collections of data by the size of a partition in a traditional Unix� or Windows� file system, but with the flexibility to subsequently change the limit, since qtrees have no connection to a specific range of blocks on a disk. Unlike volumes, which are mapped to particular collections of disks (e.g. RAID groups of n disks) and act more like traditional partitions, a qtree is implemented at a higher level than volumes and can, thus, offer more flexibility. Qtrees are basically an abstraction in the software of the storage operating system. Each volume may, in fact, contain multiple qtrees. The granularity of a qtree can be a sized to just as a few kilobytes of storage. Qtree structures can be defined by an appropriate file system administrator or user with proper permission to set such limits.
Note that the above-described qtree organization is exemplary and the principles herein can be applied to a variety of file system organizations including a whole-volume approach. A qtree is a convenient organization according to the illustrative embodiment, at least in part, because of its available identifier in the inode file.
Before describing further the process of deriving changes in two source snapshots, from which data is transferred to a destination for replication of the source at the destination, general reference is made again to the file block structures shown in
In order to scale beyond the maximum number of VBN "pointers" in an inode, "indirect blocks" are used. In essence, a disk block is allocated and filled with the VBNs of the data blocks, the inode pointers then point to the indirect block. There can exist several levels of indirect blocks, which can create a large tree structure. Indirect blocks are modified in the same manner as regular data blocks are—every time a VBN in an indirect block changes, a new disk/volume block is allocated for the altered data of the indirect block.
1. Source
In the example of a write-anywhere file layout, storage blocks are not immediately overwritten or reused. Thus changes in a file comprised of a series of volume blocks will always result in the presence of a new volume block number (newly written-to) that can be detected at the appropriate logical file block offset relative to an old block. The existence of a changed volume block number at a given offset in the index between the base snapshot inode file and incremental snapshot inode file generally indicates that one or more of the underlying inodes and files to which the inodes point have been changed. Note, however, that the system may rely on other indicators of changes in the modes or pointers—this may be desirable where a write-in-place file system is implemented.
A scanner 820 searches the index for changed base/incremental inode file snapshot blocks, comparing volume block numbers or another identifier. In the example of
Block pairs (e.g. blocks 7 and 8) that have been identified as changed are forwarded (as they are detected by the scan 820) to the rest of the source process, which includes an inode picker process 830. The inode picker identifies specific modes (based upon qtree ID) from the forwarded blocks that are part of the selected qtree being mirrored. In this example the qtree ID Q2 is selected, and inodes containing this value in their file metadata are "picked" for further processing. Other inodes not part of the selected qtree(s) (e.g. inodes with qtree IDs Q1 and Q3) are discarded or otherwise ignored by the picker process 830. Note that a multiplicity of qtree IDs can be selected, causing the picker to draw out a group of inodes—each having one of the selected qtree associations.
The appropriately "picked" inodes from changed blocks are then formed into a running list or queue 840 of changed inodes 842. These inodes are denoted by a discrete inode number as shown. Each inode in the queue 840 is handed off to an inode handler or worker 850, 852 and 854 as a worker becomes available.
The inode picker process 830 queries whether either (1) the base snapshot's version of the subject inode (a given inode number) is allocated and in a selected qtree (box 860) or (2) the incremental snapshot's version of the inode is allocated and in a selected qtree (box 862). If neither the base nor incremental version are allocated and in the selected qtree then both inodes are ignored (box 864) and the next pair of inode versions are queried.
If the base inode is not in allocated or not in the selected qtree, but the incremental inode is allocated and in the selected qtree, then this implies an incremental file has been added, and the appropriate inode change is sent to the workers (box 866). Similarly, if the base inode is allocated and in the selected qtree, but the incremental inode is not allocated or not in the selected qtree, then the this indicates a base file has been deleted and this is sent on to the destination via the data stream format (as described below) (box 868).
Finally, if a base inode and incremental inode are both allocated and in the selected qtree, then the process queries whether the base and incremental inodes represent the same file (box 870). If they represent the same file, then the file or its metadata (permissions, owner, permissions, etc) may have changed. This is denoted by different generation numbers on different versions of the inode number being examined by the picker process. In this case, a modified file is sent and the inode works compare versions to determine exact changes as described further below (box 872). If the base and incremental are not the exact same file, then this implies a deletion of the base file and addition of an incremental file (box 874). The addition of the incremental file is noted as such by the picker in the worker queue.
Inode 2801 is allocated in both inode files. It is in the proper qtree Q2, and the two versions of this inode share the same generation number. This means that the inode represents the same file in the base and the incremental snapshots. It is unknown at this point whether the file data itself has changed, so the inode picker sends the pair to the changed inode queue, and a worker determines what data has changed. Inode 2802 is allocated in the base inode file, but not allocated in the incremental inode file. The base version of the inode was in the proper qtree Q2. This means this inode has been deleted. The inode picker sends this information down to the workers as well. Finally, inode 2803 is allocated in the base inode file, and reallocated in the incremental inode file. The inode picker 830 can determine this because the generation number has changed between the two versions (from #1-#2). The new file which this inode represents has been added to the qtree, so like inode 2800, this is sent to the changed inode queue for processing, with a note that the whole file is new.
A predetermined number of workers operate on the queue 840 at a given time. In the illustrative embodiment, the workers function in parallel on a group of inodes in the queue. That is, the workers process inodes to completion in no particular order once taken from the queue and are free process further inodes from the queue as soon as they are available. Other processes, such as the scan 820 and picker 830 are also interleaved within the overall order.
The function of the worker is to determine changes between each snapshot's versions of the files and directories. As described above, the source snapshot mirror application is adapted to analyze two versions of modes in the two snapshots and compares the pointers in the modes. If the two versions of the pointers point to the same block, we know that that block hasn't changed. By extension, if the pointer to an indirect block has not changed, then that indirect block has no changed data, so none of its pointers can have changed, and, thus, none of the data blocks underneath it in the tree have changed. This means that, in a very large file, which is mostly unchanged between two snapshots, the process can skip over/overlook VBN "pointers" to each data block in the tree to query whether the VBNs of the data blocks have changed.
The operation of a worker 850 is shown by way of example in
Notably, because nearly every data structure in this example is a file, the above-described process can be applied not only to file data, but also to directories, access control lists (ACLs) and the inode file itself.
It should be again noted, that the source procedure can be applied to any level of granularity of file system organization, including an entire volume inode file. By using the inherent qtree organization a quick and effective way to replicate a known subset of the volume is provided.
2. Communication Between Source and Destination
With further reference to
The format 1020 is described further below. In general, its use is predicated upon having a structure that supports multiple protocol attributes (e.g. Unix permissions, NT access control lists (ACLs), multiple file names, NT streams, file type, file-create/modify time, etc.). The format should also identity the data in the stream (i.e. the offset location in a file of specific data or whether files have "holes" in the file offset that should remain free). The names of files should also be relayed by the format. More generally, the format should also be independent of the underlying network protocol or device (in the case of a tape or local disk/non-volatile storage) protocol and file system—that is, the information is system "agnostic," and not bound to a particular operating system software, thereby allowing source and destination systems of different vendors to share the information. The format should, thus, be completely self-describing requiring no information outside the data stream. In this manner a source file directory of a first type can be readily translated into destination file directory of a different type. It should also allow extensibility, in that newer improvements to the source or destination operating system should not affect the compatibility of older versions. In particular, a data set (e.g. a new header) that is not recognized by the operating system should be ignored or dealt with in a predictable manner without triggering a system crash or other unwanted system failure (i.e. the stream is backwards compatible). This format should also enable transmission of a description of the whole file system, or a description of only changed blocks/information within any file or directory. In addition, the format should generally minimize network and processor overhead.
As changed information is forwarded over the network, it is received at the destination pipeline piece 1030. This pipeline also includes a networker 1032 to read out TCP/IP packets from the network into the snapshot replication data stream format 1020 encapsulated in TCP/IP. A data reader and header stripper 1034 recognizes and responds to the incoming format 1020 by acting upon information contained in various format headers (described below). A file writer 1036 is responsible for placing file data derived from the format into appropriate locations on the destination file system.
The destination pipeline 1030 forwards data and directory information to the main destination snapshot mirror process 1040, which is described in detail below. The destination snapshot mirror process 1040 consists of a directory stage 1042, which builds the new replicated file system directory hierarchy on the destination side based upon the received snapshot changes. To briefly summarize, the directory stage creates, removes and moves files based upon the received formatted information. A map of modes from the destination to the source is generated and updated. In this manner, inode numbers on the source file system are associated with corresponding (but typically different) inode numbers on the destination file system. Notably, a temporary or "purgatory" directory 1050 (described in further detail below) is established to retain any modified or deleted directory entries 1052 until these entries are reused by or removed from the replicated snapshot at the appropriate directory rebuilding stage within the directory stage. In addition, a file stage 1044 of the destination mirror process populates the established files in the directory stage with data based upon information stripped from associated format headers.
The format into which source snapshot changes are organized is shown schematically in
The generic part 1102 contains an identifier of header type 1110. Standalone header types (i.e. headers not followed by associated data) can indicate a start of the data stream; an end of part one of the data stream; an end of the data stream; a list of deleted files encapsulated in the header; or the relationship of any NT streamdirs. Later versions of Windows NT allow for multiple NT "streams" related to particular filenames. A discussion of streams is found in U.S. patent application Ser. No. 09/891,195, entitled SYSTEM AND METHOD FOR REPRESENTING NAMED DATA STREAMS WITHIN AN ON-DISK STRUCTURE OF A FILE SYSTEM, by Kayuri Patel, et al, the teachings of which are expressly incorporated herein by reference. Also in the generic part 1102 is a checksum 1112 that ensures the header is not corrupted. In addition other data such as a "checkpoint" 1114 used by the source and destination to track the progress of replication is provided. By providing a list of header types, the destination can more easily operate in a backwards-compatible mode—that is, a header type that is not recognized by the destination (provided from a newer version of the source) can be more easily ignored, while recognized headers within the limits of the destination version are processed as usual.
The kind of data in the non-generic part 1104 of the header 1100 depends on the header type. It could include information relating to file offsets (1120) in the case of the basic header, used for follow-on data transmission, deleted files (in a standalone header listing of such files that are no longer in use on the source or whose generation number has changed) (1122), or other header-specific information (1124 to be described below). Again, the various standalone headers are interposed within the data stream format at an appropriate location. Each header is arranged to either reference an included data set (such as deleted files) or follow-on information (such as file data).
Next a series of headers and follow-on data in the format 1020 define various "part 1" information (1204). Significantly, each directory data set being transmitted is preceded by a basic header with no non-generic data. Only directories that have been modified are transmitted, and they need not arrive in a particular order. Note also that the data from any particular directory need not be contiguous. Each directory entry is loaded into a 4 KB block. Any overflow is loaded into a new 4 KB block. Each directory entry is a header followed by one or more names. The entry describes an inode and the directory names to follow. NT stream directories are also transmitted.
The part 1 format information 1204 also provides ACL information for every file that has an associated ACL. By transmitting the ACLs before their associated file data, the destination can set ACLs before file data is written. ACLs are transmitted in a "regular" file format. Deleted file information (described above) is sent with such information included in the non-generic part 1104 of one or more standalone headers (if any). By sending this information in advance, the directory tree builder can differentiate between moves and deletes.
The part 1 format information 1204 also carries NT stream directory (streamdir) relationship information. One or more standalone headers (if any) notifies the destination file server of every changed file or directory that implicates NT streams, regardless of whether the streams have changed. This information is included in the non-generic part 1104 of the header 1100 (
Finally, the part 1 format information 1204 includes special files for every change in a symlink, named pipe, socket, block device, or character device in the replicated data stream. These files are sent first, because they are needed to assist the destination in building the infrastructure for creation of the replicated file system before it is populated with file data. Special files are, like ACLs, transmitted in the format of regular files.
Once various part 1 information 1204 is transmitted, the format calls for an "end of part 1 of the data stream" header 1206. This is a basic header having no data in the non-generic part 1104. This header tells the destination that part 1 is complete and to now expect file data.
After the part 1 information, the format presents the file and stream data 1208. A basic header 1210 for every 2 MB or less of changed data in a file is provided, followed by the file data 1212 itself The files comprising the data need not be written in a particular order, nor must the data be contiguous. In addition, referring to the header in
In general files (1212) are written in 4 KB chunks with basic headers at every 512 chunks (2 MB), at most. Likewise, streams (also 1212) are transmitted like regular files in 4 KB chunks with at most 2 MB between headers.
Finally, the end of the replicated data stream format 1020 is marked by a footer 1220 consisting of standalone header of the type "end of data stream." This header has no specific data in its non-generic part 1104 (
3. Destination
When the remote destination (e.g. a remote file server, remote volume, remote qtree or the same qtree) receives the formatted data stream from the source file server via the network, it creates a new qtree or modifies an existing mirrored qtree (or another appropriate organizational structure) and fills it with data.
The directory stage 1042 is invoked first during a transmission the data stream from the source. It consists of several distinct parts. These parts are designed to handle all part 1 format (non-file) data. In an illustrative embodiment the data of part 1 is read into the destination, stored as files locally, and then processed from local storage. However, the data may alternatively be processed as it arrives in realtime.
More particularly, the first part of the directory stage 1042 involves the processing of deleted file headers (1310). Entries in the inode map (described further below) are erased with respect to deleted files, thereby severing a relation between mapped inodes on the replicated destination snapshot and the source snapshot.
Next the directory stage undertakes a tree cleaning process (1312). This step removes all directory entries form the replicated snapshot directory 1330 that have been changed on the source snapshot. The data stream format (1020) indicates whether a directory entry has been added or removed. In fact, directory entries from the base version of the directory and directory entries from the incremental version of the directory are both present in the format. The destination snapshot mirror application converts the formatted data stream into a destination directory format in which each entry that includes an inode number, a list of relative names (e.g. various multi-protocol names) and a "create" or "delete" value. In general each file also has associated therewith a generation number. The inode number and the generation number together form a tuple used to directly access a file within the file system (on both the source and the destination). The source sends this tuple information to the destination within the format and the appropriate tuple is stored on the destination system. Generation numbers that are out of date with respect to existing destination files indicate that the file has been deleted on the source. The use of generation numbers is described further below.
The destination processes base directory entries as removals and incremental directory entries as additions. A file which has been moved or renamed is processed as a delete (from the old directory or from the old name), then as an add (to the new directory or with a new name). Any directory entries 1052 that are deleted, or otherwise modified, are moved temporarily to the temporary or "purgatory" directory, and are not accessible in this location by users. The purgatory directory allows modified entries to be, in essence, "moved to the side" rather than completely removed as the active file system's directory tree is worked on. The purgatory directory entries, themselves point to data, and thus prevent the data from becoming deleted or losing a link to a directory altogether.
On a base transfer of a qtree to the destination, the directory stage tree building process is implemented as a breadth-first traversal of all the files and directories in the data stream, starting with the root of the qtree. The directory stage then undertakes the tree building process, which builds up all the directories with stub entries for the files. However, the depicted incremental directory stage (1042), as typically described herein, differs from a base transfer in that the tree building process (1314) begins with a directory queue that includes all modified directories currently existing on both the source and the destination (i.e. the modified directories that existed prior to the transfer). The incremental directory stage tree building process then processes the remainder of the directories according to the above-referenced breadth-first approach.
For efficiency, the source side depends upon inode numbers and directory blocks rather than pathnames. In general, a file in the replicated directory tree (a qtree in this example) on the destination cannot expect to receive the same inode number as the corresponding file has used on the source (although it is possible). As such, an inode map is established in the destination. This map 1400, shown generally in
More specifically, each entry in the inode map 1400 contains an entry for each inode on the source snapshot. Each inode entry 1402 in the map is indexed and accessed via the source inode number (1404). These source modes are listed in the map in a sequential and monotonically ascending order, notwithstanding the order of the mapped destination inodes. Under each source inode number (1404), the map includes: the source generation number (1406) to verify that the mapped inode matches the current file on the source; the destination inode number (1408); and destination generation number (1410). As noted above, the inode number and generation number together comprise a tuple needed to directly access an associated file in the corresponding file system.
By maintaining the source generation number, the destination can determine if a file has been modified or deleted on the source (and its source associated inode reallocated), as the source generation number is incremented upwardly with respect to the stored destination. When the source notifies the destination that an inode has been modified, it sends the tuple to the destination. This tuple uniquely identifies the inode on the source system. Each time the source indicates that an entirely new file or directory has to be created (e.g. "create") the destination file system creates that file. When the file is created, the destination registers data as a new entry in its inode map 1400. Each time the source indicates that an existing file or directory needs to be deleted, the destination obliterates that file, and then clears the entry in the inode map. Notably, when a file is modified, the source only sends the tuple and the data to be applied. The destination loads the source inode's entry from the inode map. If the source generation number matches, then it knows that the file already exists on the destination and needs to be modified. The destination uses the tuple recorded in the inode map to load the destination inode. Finally, it can apply the file modifications by using the inode.
As part of the tree building process reused entries are "moved" back from the purgatory directory to the replicated snapshot directory 1330. Traditionally, a move of a file requires knowledge of the name of the moved file and the name of the file it is being moved to. The original name of the moved file may not be easily available in the purgatory directory. In addition, a full move would require two directories (purgatory and replicated snapshot) to be modified implicating additional overhead.
However, in the illustrative embodiment, if the source inodes received at the destination refer to inodes in the inode map 1400, then the directory stage creates (on the current built-up snapshot directory 1330) a file entry having the desired file name. This name can be exactly the name derived from the source. A hard link 1332 (i.e. a Unix-based link enables multiple names to be assigned to a discrete file) is created between that file on the snapshot directory 1330 and the entry in the purgatory directory. By so linking the entry, it is now pointed to by both the purgatory directory and the file on the snapshot directory itself. When the purgatory directory root is eventually deleted (thereby killing off purgatory) at the end of the data stream transfer, the hard link will remain to the entry, ensuring that the specific entry in the purgatory directory will not be deleted or recycled (given that the entry's link count is still greater than zero) and a path to the data from the file on the new directory is maintained. Every purgatory entry that eventually becomes associated with a file in the newly built tree will be similarly hard linked, and thereby survive deletion of the purgatory directory. Conversely, purgatory entries that are not relinked will not survive, and are effectively deleted permanently when purgatory is deleted.
It should now be clear that the use of mapping and generation number tuples avoids the expensive (from a processing standpoint) use of conventional full file pathnames (or relative pathnames) in the data stream from the source. Files that are modified on the source can be updated on the destination without loading a directory on either the source or destination. This limits the information needed from the source and the amount of processing required. In addition, the source need not maintain a log of directory operations. Likewise, since the destination need not maintain a central repository of the current file system state, multiple subdirectories can be operated upon concurrently. Finally, neither the source, nor the destination must explicitly track deleted files as such deleted files are automatically removed. Rather, the source only sends its list of deleted files and the destination uses this list to conform the inode map. As such, there is no need to selectively traverse a tree more than once to delete files, and at the conclusion of the transfer, simply eliminating the purgatory directory is the only specific file cleaning step.
The directory stage 1042 sets up any ACLs on directories as the directories are processed during tree building (substep 1316). As described above, the ACL and NT stream relationships to files are contained in appropriate standalone headers. ACLs are then set on files during the below-described file stage. NT streams are created on files as the files are, themselves, created. Since an NT steam is, in fact, a directory, the entries for it are processed as part of the directory phase.
The new directory tree may contain files with no data or old data. When the "end of part 1" format header is read, the destination mirror process 1040 enters the file stage 1044 in which snapshot data files 1340 referenced by the directory tree are populated with data (e.g. change data).
At the end of both the directory stage 1042 and data stage 1044, when all directory and file data have been processed, and the data stream transfer from the source is complete, the new replicated snapshot is exposed atomically to the user. At this time the contents of the purgatory directory 1050 (which includes any entries that have not be "moved" back into the rebuilt tree) is deleted.
It should be noted that the initial creation (the "level zero" transfer) of the replicated snapshot on the destination follows the general procedures discussed above. The difference between a level zero transfer and a regular update is that there is no base snapshot, so the comparisons always process information in the incremental snapshot as additions and creates rather than modifications. The destination mirror application starts tree building by processing any directories already known to it. The initial directory established in the destination is simply the root directory of the replicated snapshot (the qtree root). A destination root exists on the inode map. The source eventually transmits a root (other files received may be buffered until the root arrives), and the root is mapped to the existing destination root. Files referenced in the root are then mapped in turn in a "create" process as they are received and read by the destination. Eventually, the entire directory is created, and then the data files are populated. After this, a replica file system is complete.
As described above, in reference to
In the event of a loss of communication between the source and destination, caused by, for example, a failure of the network 318, it is desirable to restart the data transfer process from a fixed point within the overall progress of the transfer. While the process could simply be restarted from the beginning of the procedure, this would result in substantial duplication of data transfer and computational overhead. To provide intermediate points to which the process can be restarted, the source inserts a number of discrete checkpoint numbers into the data stream 1020 sent from the source to the destination.
This checkpointing procedure 1600 is shown in detail in
The newly created and associated checkpoint number from step 1620 is then inserted into the data stream for transmission to the destination (step 1625). Note particularly that the checkpoint number can be inserted into a checkpoint data section 1114 of the data stream header 1100 (
In the procedure 1600, after the inode workers have been restarted, the source manages the set of registries that it has accumulated (step 1635). As a new registry entry is created each time a checkpoint number is placed into the data stream, the source accumulates a number of registry entries. These registered entries can be managed in a preset and predetermined manner. For example, the source may keep a set of ten registry entries with the oldest being deleted, round robin, each time a new registry entry is created. After managing the registry entries, the procedure 1600, in step 1640, then waits a preset time period, or alternatively for a certain level of data processing/throughput, before initiating another halt and looping to step 1605.
A schematic block diagram of an exemplary top-of-queue registry 1700 is shown in
The destination receives and acts upon the checkpoint numbers packaged in the formatted data stream 1020 while receiving and performing the destination process on the stream. In the illustrative embodiment, the destination stores the checkpoint number for the last segment of the transfer that has been fully committed to persistent storage. For example, if all data up to "checkpoint number 9" has been written to disk, the destination stores "checkpoint number 9" for use during the novel restart procedure, which is now further described.
The restart procedure 1800 performed mutually by the destination and source in response to a loss of a communication path (or other error) is shown in
By way of example, if the destination has written all of the data up to "checkpoint number 7" plus some of the data between "checkpoint number 7" and "checkpoint number 8," then if the loss of communication or other error occurs, the destination would transfer back to the source an alert stating that it has completed "checkpoint number 7." After the destination alerts the source that is completed "checkpoint number 7," the destination has an expectation that it will receive retransmission of all data starting no later than the end of the "checkpoint number 7" segment. The source can restart from any previous checkpoint (e.g., "checkpoint number 4"); however, the closer that the source can begin to the checkpoint number sent by the destination, the less work needs to be redone. Thus, for example, if the destination had sent "checkpoint number 7", but the source begins at "checkpoint number 4" then the data between "checkpoint number 4" and "checkpoint number 7" will need to be rewritten.
In the restart procedure 1800, after receiving the last-checkpoint-number alert from the destination, the source then selects, in step 1810, the appropriate stored registry that is associated with the checkpoint number, or the entry with the largest checkpoint number less than the requested value. This selected registry contains all of the information that the source requires to restart the inode workers in the exact state that they were in at the time of the particular checkpoint number (or otherwise transfer an appropriate buffer containing stored worked-on changes to the pipeline/network). Where the inode workers are restarted the source initializes the workers at the appropriate inode and volume block number that is indicated in the selected checkpoint's registry (step 1815). The inode picker process is also initialized at the inode that was at the top of the queue in step 1820. At this point, the source has recreated the state that it was in at the time of the selected checkpoint. Thus, the data stream generated by this restored configuration will include the same set of changes as before the loss of communication between the source and destination. A checkpoint number is appended to the new data stream upon restart. This checkpoint number is, of course, the next increment from the last fully committed number provided by the destination.
After the restart procedure 1800 is performed, the transmission of changes from the source to the destination can continue with both the source and destination having agreed on a mutual starting point, namely the selected checkpoint transmitted by the destination. Note that the destination may receive change data after the restart procedure that the destination had already committed to persistent storage, i.e. a change that was written after the selected checkpoint but before the error condition requiring a restart. The destination simply rewrites the change data to its persistent storage using the methodology described above. This rewriting of change data is possible because the data stream sent from the source to the destination specifies the location in the file where the data needs to be written. Typical replication software simply appends data to a destination side file. By sending the location in the file where the change is to be written, the destination can accommodate the need to "redo" work by overwriting already written data.
The above-described purgatory directory 1050 is employed by the destination during as part of the restart of directory processing. As the directory entries for modified and deleted files are moved into the purgatory directory, they are not deleted until the entire update of the destination file system is fully completed. In the interim, any changes that occur after an agreed upon checkpoint for restarting can be undone by moving the deleted and modified entries back from the purgatory directory to the destination file system. This ensures that the destination side directory processing restarts from the exact point of restart by the source side. The use of the purgatory directory is described further in the above-incorporated U.S. Patent Application entitled SYSTEM AND METHOD FOR ASYNCHRONOUS MIRRORING OF SNAPSHOTS AT A DESTINATION USING A PURGATORY DIRECTORY AND INODE MAPPING.
The foregoing has been a detail description of illustrative embodiments of the invention. Various modifications and additions can be made without departing form the spirit and scope of the invention. For example, the number of interconnected source and/or destination servers depicted can be varied. In fact, the source and destination servers can be the same machine. It is expressly contemplated that a plurality of sources can transfer data to a destination and vice versa. Likewise, the internal architecture of the servers or their respective storage arrays, as well as their network connectivity and protocols, are all highly variable. The operating systems used on various source and destination servers can differ. In addition, it is expressly contemplated that any of the operations and procedures described herein can be implemented using hardware, software comprising a computer-readable medium having program instructions executing on a computer, or a combination of hardware and software.
|Cited Patent
|Filing date
|Publication date
|Mar 28, 1983
|Feb 11, 1986
|Allen Bruce S
|Man machine interface
|Sep 8, 1989
|Nov 10, 1992
|Auspex Systems, Inc.
|Parallel i/o network file server architecture
|Jun 26, 1992
|Apr 13, 1993
|Thinking Machines Corporation
|Storage system using multiple independently mechanically-driven storage units
|Dec 20, 1990
|Jan 11, 1994
|International Business Machines Corp.
|Version management system using pointers shared by a plurality of versions for indicating active lines of a version
|May 31, 1995
|Oct 6, 1998
|Network Appliance, Inc.
|Method for maintaining consistent states of a file system and for creating user-accessible read-only copies of a file system
|Jun 30, 1998
|Oct 5, 1999
|Network Appliance, Inc.
|Write anywhere file-system layout
|Sep 14, 1998
|Sep 11, 2001
|Network Appliance, Inc.
|Write anywhere file-system layout
|Jun 26, 2001
|Sep 10, 2002
|Bs&B Safety Systems, Inc.
|Rupture disk assembly
|Oct 25, 1999
|Jun 3, 2003
|Network Appliance, Inc.
|File systems image transfer between dissimilar file systems
|Jul 31, 1998
|Aug 5, 2003
|Network Appliance, Inc.
|File system image transfer
|Mar 29, 2001
|May 3, 2005
|Network Appliance, Inc.
|Cascading support for mirrored volumes
|Mar 19, 2002
|Jan 31, 2006
|Network Appliance, Inc.
|System and method for determining changes in two snapshots and for transmitting changes to destination snapshot
|Mar 19, 2002
|Feb 28, 2006
|Network Appliance, Inc.
|Format for transmission file system information between a source and a destination
|Mar 19, 2002
|Mar 7, 2006
|Network Appliance, Inc.
|System and method for redirecting access to a remote mirrored snapshot
|Apr 19, 2002
|May 2, 2006
|Network Appliance, Inc.
|System and method for checkpointing and restarting an asynchronous transfer of data between a source and destination snapshot
|Mar 19, 2002
|May 9, 2006
|Network Appliance, Inc.
|System and method for storage of snapshot metadata in a remote file
|Mar 19, 2002
|May 29, 2007
|Network Appliance, Inc.
|System and method for asynchronous mirroring of snapshots at a destination using a purgatory directory and inode mapping
|Aug 17, 2001
|Nov 18, 2008
|Network Appliance, Inc.
|Write allocation based on storage system map and snapshot
|Mar 19, 2002
|Sep 25, 2003
|Manley Stephen L.
|System and method for asynchronous mirroring of snapshots at a destination using a purgatory directory and inode mapping
|Akyurek, Sedat, Placing Replicated Data to Reduce Seek Delays, Department of Computer Science, University of Maryland, UMIACS-TR-91-121, CS-TR-2746, Aug. 1991.
|Bitton, Dina, Disk Shadowing, Proceedings of the 14th VLDB Conference, LA, CA 1988.
|Chaudhuri, Surajit, et al., Self-Tuning Technology in Microsoft SQL Server, Data Engineering Journal 22, 2 1999 pp. 20-27.
|Chutani, Sailesh, et al., The Episode File System, In Proceedings of the USENIX Winter 1992.
|Coyne, Robert A., et al., Storage Systems for National Information Assets, Proc. Supercomputing 92, Minneapolis, Nov. 1992, pp. 626-633.
|Finlayson, Ross S., et al., Log Files: An Extended File Service Exploiting Write-Once Storage Department of Computer Science, Stanford University, Report No. STAN-CS-87/1177, Sep. 1987.
|Gray, Jim, et al., The Recovery Manager of the System R Database Manager, ACM Computing Surveys, (13)2:223-242 1981.
|Hecht, Matthew S., et al. Shadowed Management of Free Disk Pages with a Linked List, ACM Transactions on Database Systems, 8/4, Dec. 1983, pp. 503-514.
|Howard, John H., An Overview of the Andrew File System, Carnegie Mellon University, CMU-ITC-88-062 1988.
|Howard, John, H. et al., Scale and Performance in a Distributed File System, ACM Trans. Computer System, 6(1), Feb. 1988 pp. 51-81.
|Howard, John, H. et al., Scale and Performance in a Distributed File System, Carnegie Mellon University, CMU-ITC-87-068, Aug. 1987.
|Kazar, Michael L., et al., DEcorum File System Architectural Overview, USENIX Summer Conference, Anaheim, California, 1990.
|Kemper, Alfons, et al., Performance Tuning for SAP R/3, Data Engineering Journal 22, 2 1999 pp. 33-40.
|Kent, Jack et al., Optimizing Shadow Recovery Algorithms, IEEE Transactions on Software Engineering, 14( 2): 155-168 , Feb. 1988.
|Kistler, et al., Disconnected Operation in the Coda File System, ACM Transactions on Computer Systems, vol. 10, No. 1, Feb. 1992, pp. 3-25.
|Lorie, Raymond, A. Physical Integrity in a Large Segmented Database, ACM Trans. Database Syst., vol. 2, Mar. 1977, pp. 91-104 .
|Ousterhout, John et al., Beating the I/O Bottleneck: A Case for Log-Structured File Systems, Technical Report, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley, Oct. 30, 1988.
|Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID),-SIGMOD International Conference on Management of Data, Chicago, IL, USA, Jun. 1-3, 1988, SIGMOD Record (17)3:109-16 Sep. 1988.
|Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID),—SIGMOD International Conference on Management of Data, Chicago, IL, USA, Jun. 1-3, 1988, SIGMOD Record (17)3:109-16 Sep. 1988.
|Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID),-Technical Report, CSD-87-391, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley 1987.
|Patterson, D., et al., A Case for Redundant Arrays of Inexpensive Disks (RAID),—Technical Report, CSD-87-391, Computer Science Division, Electrical Engineering and Computer Sciences, University of California at Berkeley 1987.
|Peterson, Zachary Nathaniel Joseph, Data Placement for Copy-on-Write Using Virtual Contiguity, University of CA, Santa Cruz, Master's Thesis for the Department of Science in Computer Science, Sep. 2002.
|Quinlan, Sean, A Cached WORM File System, Software-Practice and Experience, 21(12):1289-1299 1991.
|Rosenblum, Mendel, et al. The Design and Implementation of a Log-Structured File System Jul. 24, 1991 pp. 1-15.
|Rosenblum, Mendel, et al., The Design and Implementation of a Log-Structured File System, In Proceedings of ACM Transactions on Computer Systems, (10)1:26-52, Feb. 1992.
|Rosenblum, Mendel, et al., The LFS Storage Manager, Computer Science Division, Electrical Engineering and Computer Sciences, Univ. of CA, presented at Summer '90 USENIX Technical Conference, Anaheim, CA Jun. 1990.
|Rosenblum, Mendel, The Design and Implementation of a Log-Structured File System, 1992 pp. 1-93.
|Schiefer, Berni, et al., DB2 Universal Database Performance Tuning, Data Engineering Journal 22, 2 1999 pp. 12-19.
|Seltzer, Margo I., et al., Journaling Versus Soft Updates: Asynchronous Meta-Data Protection in File Systems, Proceedings of 200 USENIX Annual Technical Conference, Jun. 18-23, 2000.
|Shasha, Dennis, Tuning Time Series Queries in Finance: Case Studies and Recommendations, Data Engineering Journal 22, 2 1999 pp. 41-47.
|Sidebotham, Bob, Volumes: The Andrew File System Data Structuring Primitive, EEUG Conference Proceedings, Manchester, UK, Autumn 1986.
|Subramanian, Muralidhar, et al., Performance Challenges in Object-Relational DBMSs, Data Engineering Journal 22, 2 1999 pp. 28-32.
|Weikum, Gerhard, et al., Towards Self-Tuning Memory Management for Data Servers, Data Engineering Journal 22, 2 1999 pp. 3-11.
|West, Michael, et al. The ITC Distributed File System: Prototype and Experience, Carnegie-Mellon University, Technical Report CMU-ITC-040, Mar. 1985.
|Zayas, Edward R., AFS-3 Programmer's Reference: Architectural Overview, Transarc Corporation, Pittsburgh, PA, 1.0 edition 1991.
|Citing Patent
|Filing date
|Publication date
|Apr 12, 2011
|Netapp, Inc.
|System and method for transparent data replication over migrating virtual servers
|Apr 30, 2009
|Feb 14, 2012
|Netapp, Inc.
|Data distribution through capacity leveling in a striped file system
|Jun 19, 2012
|Netapp, Inc.
|Single nodename cluster system for fibre channel
|Aug 21, 2012
|Apple Inc.
|N-way synchronization of data
|Feb 11, 2009
|Nov 27, 2012
|Apple Inc.
|Peer-to-peer N-way syncing in decentralized environment
|Dec 8, 2011
|Jun 11, 2013
|Microsoft Corporation
|Configuring a data protection system
|Jan 23, 2012
|Jun 11, 2013
|Microsoft Corporation
|Method, system, and apparatus for providing resilient data transfer in a data protection system
|Sep 10, 2008
|Jul 23, 2013
|Apple Inc.
|Peer-to-peer syncing in a decentralized environment
|May 21, 2007
|Sep 3, 2013
|International Business Machines Corporation
|Creating a checkpoint for modules on a communications stream
|Dec 9, 2011
|Dec 10, 2013
|Microsoft Corporation
|Configuring a data protection system
|Aug 10, 2011
|Jan 21, 2014
|Apple Inc.
|Peer-to-peer syncing in a decentralized environment
|Dec 1, 2008
|Jan 28, 2014
|Microsoft Corporation
|Supporting media content revert functionality across multiple devices
|Dec 27, 2010
|Oct 21, 2014
|Apple Inc.
|Method and system for using global equivalency sets to identify data during peer-to-peer synchronization
|Mar 14, 2013
|Aug 25, 2015
|International Business Machines Corporation
|Avoiding restart on error in data integration
|Sep 11, 2014
|Aug 25, 2015
|International Business Machines Corporation
|Avoiding restart on error in data integration
|Mar 15, 2013
|Feb 9, 2016
|International Business Machines Corporation
|Selective checkpointing of links in a data flow based on a set of predefined criteria
|Mar 25, 2014
|Feb 16, 2016
|International Business Machines Corporation
|Selective checkpointing of links in a data flow based on a set of predefined criteria
|Mar 15, 2013
|Apr 26, 2016
|International Business Machines Corporation
|Deploying parallel data integration applications to distributed computing environments
|Jun 10, 2013
|Jun 21, 2016
|Microsoft Technology Licensing, Llc
|Method, system, and apparatus for providing resilient data transfer in a data protection system
|Mar 15, 2013
|Jul 26, 2016
|International Business Machines Corporation
|Data integration on retargetable engines in a networked environment
|Mar 24, 2005
|Sep 28, 2006
|Microsoft Corporation
|Method and system for a consumer oriented backup
|May 21, 2007
|Nov 27, 2008
|David Jones Craft
|Creating a checkpoint for modules on a communications stream
|Sep 10, 2008
|Jan 1, 2009
|Apple Inc.
|Peer-to-Peer Syncing in a Decentralized Environment
|Feb 11, 2009
|Jun 4, 2009
|Apple Inc.
|Peer-to-peer n-way syncing in decentralized environment
|Dec 17, 2009
|Apr 29, 2010
|Apple Inc.
|N-Way Synchronization of Data
|Dec 1, 2008
|Jun 3, 2010
|Microsoft Corporation
|Supporting media content revert functionality across multiple devices
|May 17, 2012
|Microsoft Corporation
|Method, system, and apparatus for providing resilient data transfer in a data protection system
|Mar 9, 2011
|Sep 13, 2012
|Hitachi, Ltd.
|Computer system, method of scheduling data replication, and computer-readable non-transitory storage medium
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification


text:
After a year together, we were on the way to Omaha from our home in Florida to see Jeff's grandmother for her 90th birthday. We had decided we would sneak across to Iowa and get married while we were there. It was supposed to be quiet and simple, but with friends invited and cakes ordered, it became something we hadn't expected, and we loved every moment. My best friend since high school flew in from Dallas so her infant son could give me the ring that I would slip on my husband's finger. It was an amazing day and the gathering afterwards included a bleeding armadillo cake (Midwestern people were sort of weirded out by this).
I couldn't have asked for anything more perfect.
– Addison

subset: commoncrawl


text:
Wicked Po'Boys and Seafood delivers iconic Big Easy dishes
Photo: Kye R. Lee/Staff Photographer
A soft shell crab po'boy comes on a baguette dressed with the traditional touches ($9).
To post a comment, log into your chosen social network and then add your comment below. Your comments are subject to our Terms of Service and the privacy policy and terms of service of your social network. If you do not want to comment with a social network, please consider writing a letter to the editor.


text:
There won't be a whole lot of changes at the 34th annual Oktoberfest in Lowell - and that's part of the attraction.
"We stick with what works," said Terry Schwendeman, Oktoberfest chairman.
That includes German potato salad, rotisserie chicken, live local entertainment and flea market vendors galore.
Article Photos
Photo submitted
Lowell residents Donna and Howard Wagner will serve as marshals for the annual Oktoberfest parade this weekend.
Lowell resident Donna Wagner, 70, and her husband, Howard, will serve as this year's parade marshals. A former co-chairwoman of the event, Wagner said she likes the fundraising opportunities Oktoberfest provides for local organizations.
"And then the food's good," she said.
Her favorites are the roast chicken and the beef sandwiches. She'll be helping to make the latter this year after leading the Saturday morning parade.
Fact Box
If you go
What: 34th annual Oktoberfest.
When: 9 a.m. to dark Saturday and 9 a.m. to 5 p.m. Sunday.
Where: Buell Island, Lowell.
Admission and parking: Free.
Parade: 10 a.m. Saturday (for more information, 896-2831).
Entertainment: German music, Space Chickens, Rockin' Country, Rube Band and Rags to Riches on Saturday; Steve and Bev Pottmeyer, the Fossils, Rube Band and GBS Production on Sunday.
Church services: Catholic Mass at 7:30 p.m. Saturday in Shelter A; services at 9:30 a.m. Sunday in Shelter C.
Raffle: $1 per chance or six for $5; drawing at 5 p.m. Sunday.
Other activities: Numerous flea market and craft booths, horseshoe pitching daily at 1 p.m., games for children, and, of course, Oktoberfest's signature food.
The parade will start to line up around 9:30 a.m. at the former Deano's Pizzeria and Carryout in the north end of Lowell. It will travel down Fourth Street, to Third Street, then across the river to Buell Island.
There is no registration or fee for the parade, said Jim Lenhart, parade chairman.
"Whoever shows up, we put in," he said.
As for the food, the cream puffs added last year will be back, Schwendeman said. There may also be another new item, also from Schmidt's Restaurant und Sausage Haus in Columbus, the Bahama Mama Burger, which features sausage, sliced and grilled like a burger and topped with sauteed vegetables and a slice of cheese on a rye bun.
The festival started as a sort of homecoming for Lowell residents, many of whom are of German descent. And that's why longtime committee member Mildred Schwendeman, Terry's mother, says the festival's name should be spelled with a "k," even though a "c" had replaced it in recent years.
"I like the 'k' better," she said. "It's more German."


text:
Theologian John D. Geib of the Logos Institute will offer a seminar, "The Foundations of Discernment: Preparing for the Coming Worldwide Deception," from 9 a.m. to 3 p.m. on Jan. 25 at First Baptist Church at 1659 W. State St. The cost is $10 per person. Reservations are recommended. Call 330-823-3118 from 8 a.m. to noon weekdays; or call 330-415-1978; or contact Cindy Friley by email at firstname.lastname@example.com.
Location, ST | website.com


text:
Weewar will go down briefly today at 5pm PST (UTC-7) to address a bug with kicking players.
Have you noticed any major lag on Weewar recently? Our last update on Tuesday should have fixed it, but if you still experience any slowdowns, please let us know!
[Update 6/24/10 5:14pm – We're back!]
[Update 6/25/10 – Yesterday's update introduced a bug in player's signing in after registering. This is pretty crucial so we're releasing a fix for it today at 5:30pm PST. We'll only be down very briefly.]
[Update 6/25/10 5:40pm – A bit longer than expected, but we're back now!]


text:
DistributionRead full entry
Choloepus hoffmanni (Hoffman's two-toed sloth) is a native South American mammal whose distribution also reaches Central America. The distribution extends from southern Nicaragua to Brazil and Bolivia and is composed of two disjunct populations. The northern population extends from Central America to northern and western Colombia, western Ecuador, and westernmost Venezuela. The southern population spans the area east of the Andes in Ecuador, Peru, Bolivia, and western Brazil. The two species of Choloepus (Choloepus hoffmanni and Choloepus didactylus) overlap partially in the Andean regions and western Amazonia.
Biogeographic Regions: neotropical (Native )


text:
A 9-year-old Cincinnati boy had the scare of his life when two robbers came into his house and pulled a gun on him Thursday afternoon.
No email address was supplied by
To complete your registration on this site, please supply an address.
Please confirm or modify the email address to which you will have subscription offers sent.
For a more personalized experience, please supply the following optional information.


text:
Several Vermont individuals and groups are being honored for their work to promote and take care of trees in their communities.
The Vermont Urban and Community Forest Council this week gave out its annual Vermont tree stewards awards at the Statehouse in Montpelier.
They went to Susan Smith of Charlotte, the city of Montpelier, the Dummerston Conservation Commissioner, Will Sightler and Polly Thompson of Rockingham.
Lee Krohn, chairman of the Urban & Community Forestry Council, said the awards are a way to say thank you for the great work volunteers are doing to promote trees in their communities.


text:
We use cookies to provide you with the best experience on our site. If you continue shopping with us we'll assume that you're happy to receive cookies. Find out more about cookies x
Please note that changing your country whilst shopping will remove all items from your basket.
It contains Ciclopirox olamine, an ingredient that is clinically proven to treat the underlying cause of itchy, flaky scalp conditions.
Menthol, to give a cooling soothing effect with repaid itch relief.
Salicylic acid, which breaks down and loosens dead skin cells and effectively removes the flakes.
Oilatum scalp intensive is suitable for all hair types. Contains provitamin B5 (panthenol), which conditions the hair to leave it in great condition.
Apply to wet hair. Gently massage over the scalp to produce a lather. For best results leave on for 3 - 5 minutes. Rinse thoroughly then repeat. Use twice weekly.
For external use only
As with most shampoos, avoid contact with eyes.
If contact occurs, rinse thoroughly with water.
If irritation persists, consult a doctor.
Do not use if you have any sensitivity to any of the ingredients in this shampoo.
Rarely, mainly in individuals with damaged or grey hair discoloration has been observed.
Aqua, sodium laureth sulfate, Cocamide DEA, Polysorbate 80, PEG- 120 methyl glucose dioleate, salicylic Acid, Ciclopirox Olamine, Disodium Cocoamphodiacetate, Sodium Cocoamphodiacetate, Oleyl Alcohol, Propylene Glycol, Sodium Chloride, Glycerin, Sodium Hydrocide, Citric Acid, Menthol, Panthenol, Tocopherol.
The item can be delivered to all addresses within the UK. Northern Ireland and to BFPO addresses.
Boots.com deliver to British Forces Post Office addresses. The charge for BFPO delivery is £6.00, this includes the cost of delivering your parcel to the BFPO sorting office and the charge applied for delivery to your address.
We can't ship aerosols to BFPO addresses. Aerosols will be intercepted and returned to us.
Please also note that certain areas carry specific weight restrictions and parcels over these weight limits are automatically returned to us.
However you like to shop we've got you covered, from placing an order in-store or by phone to shopping online and through our app.
Discover our first serum clinically proven to reduce the look of wrinkles, firm skin and even skin tone
£7.49 or 749 points
100 ML £7.49 per 100ML
Save £2.50
Was £9.99
Collect in store
Home delivery
Oilatum Scalp Intensive treatment shampoo contains added ingredients for a fast effective relief from itch and severe scaly build up. Reduces redness and removes scale. Cools and soothes the scalp
Collect 28 points with this purchase
Copyright © The Boots Company PLC. All rights reserved. Boots.com is a trading name of Boots UK Limited. Registered office: Nottingham NG2 3AA.Registered in England: company number 928555. Registered VAT number 116300129. For details of Boots registered internet pharmacies see Using Our Pharmacy Services page.


text:
MAY 10, 2013 - Business Insider
A Must Read - Share
Evercore chairman Roger Altman was on CNBC this morning arguing that austerity in Europe was not a "choice" but rather something that was forced onto countries by raging credit markets that were rebelling against high debt loads. This is incorrect, and provably so. Here's a chart going back 3 years of Italian borrowing costs (the yield on the 10-year Italian bond). There were two big peaks in the country's borrowing costs. The first was in late 2011, and the second was in summer 2012. Something important happened at both of those peaks: The European Central Bank stepped up and began to
Read More
Editor's Picks
Hey you have no friends!!! Get to work and start inviting friends to help build your Comunitee. Click Here to invite friends.
© 2011 Comunitee, Inc.


text:
21508 Players currently online!
Man vs. Machine - good luck!
Turn-based games at any time!
Vote for the best move to win!
Do you have what it takes?
Backgammon, Yatzy, and more!
Sharpen your tactical vision!
Get advice and game insights!
Learn from top players & pros!
View millions of master games!
Your virtual chess coach!
Perfect your opening moves!
Test your skills vs. computer!
Find the right private coach!
Can you solve it each day?
Bring it all together!
Beginners, start here!
Make friends & play team games!
News from the world of chess!
Search all Chess.com members!
Find local clubs & events!
Who's the best of your friends?
Read what members are saying!
So, I have been dying to know what the chess community thinks about the upcoming World Chess Championship match between these two great GMs. I personally believe that Topalov may have a slight advantage, and he is (in my humble opinion) likely to become the champion after this match.
I would like to know who you think will win and why.
I think Vishy is going to retain his title. last time against Kramnik he was spot on.
I hope that Vishy wins, because I'm a big fan of his. What I know, however, is that it will be hard fought. We haven't seen Topalov at major tournaments in awhile despite his huge rating, which means he's certainly preparing in depth for his chance at claiming the title.I support Vishy's experience and practice.
Go Vishy!
I believe Anand will win...in the current Corus Chess Tournament, he is the only one who has not lost a game....says something of his form playing the likes of Carlsen, Shirof, and defeating Kramnik easily today....while still holding back special variations for the match with Topalov.
I'm putting my bets on Anand. His style of play should prove more solid than Topalov's "gambling problem," as Chess Life magazine once called it. Topalov has a knack (as can be seen in his semi-final match with Kamsky) for pushing the odds with his games and almost never playing for a draw when the game could push him closer to the "big picture" goal of his, in this case the World Chess Championship. I believe that if Anand sticks with his Karpov-like style of play, he should be able to take advantage of Topalov's... recklessness(?) and defend against the complex tactics he'll face. Then again, Topalov's intense fighting spirit could overwhelm Anand, if Anand can't keep his cool.
I don't mind who wins, I'm just gagging for it.
It should be a rather interesting match and hopefully it will generate some interesting games. As Topalov loves complexity we shouldn't get too bored following the match. Anand seems to play extremely solid chess, not too many great risks, just expanding within the position versus Toplaov's more agressive demeanor.
All in all I am actually more excited about seeing the qualifying for the next WCC.
Here's Kramnik's take on this: http://blip.tv/play/hIkMgc%2BjOQI
Just curious ... we've seen Topalov blow away the competition in multi-player tourneys, but how is his history of tearing apart anyone at head-to-head match play? I've seen quite the opposite in the Kramnik match and just wondering if I missed anyone besides Kamsky?
Not trying to stir the pot, just wanted to compare the two players in terms of match playing experience.
Wow, Kramnik is no fan of Toplaov and his team. I suppose that's understandable. He seems to be all but predicting that they will use underhanded tactics in Sofia.
That's awesome. I'd never heard Kramnik speak before. He sounds, to me, a lot like Kaidanov.
I don't know, but that's a good question. Anand's preparation against Kramnik was excellent of course, but like Kramnik said after losing, hard work isn't enough (he said he worked extremely hard on his own preparation), you have to prepare correctly and use your time efficiently. So even if Topalov work very hard in preparation, it doesn't necessarily mean he will be better in match play.
In terms of level of play, Topalov didn't seem to blow away Kamsky, it seemed pretty close. Kamsky is a very strong player of course, but I think Anand is on another level. It will be interesting to see how effective Topalov's preparation is.
Interesting interview with Kramnik. If Topolov really hated Kramnik, then he'd make this match with Anand go as smooth as possible well, at least I hope this WC match is only about chess, and not antics off the board.
I think Topalov may win, simply because of his preparation (as it is his only chance, so he will be pressured to work extra hard), and Anand doesn't feel the pressure, except for losing the title, but he may be overconfident by now, he may take more risks simply because he's already WCC.
I don't know how much rating has to do with it, but Topalov has a pretty high rating, perhaps it means he can face off against the best GMs and come out ahead in high-pressure rated and timed matches.
Anand may win as well, his form is strong. He has done it before, so maybe he'll be more relaxed, while Topalov may be nervous.
On the other hand, Topalov is much younger, he may learn more variations and can study anand's hundreds of past games. While Anand may have less games of Topalov's to study.
For players who both will open with either e4 or d4 I wonder what kind of immense preparation Anand and Topalov are doing?
Chess life had an article about some of Anand's prep against Kramnik. Basically how these guys who were helping him would sometimes stay up all night coming up with relevant study positions, opening prep, novelties, etc and Anand would eat breakfast, go work out, then for 10 hours or something have these guys feed him all that stuff. At the end of the day he'd go to sleep and his team may be up another 5 hours preparing more for tomarrow... pretty nuts.
I'm rooting for Topalov. Anand has been the most undeserving and boring Champion in the history of chess. No charisma, no personality. Completely dull and one-dimensional.
Nice vid, and I agree with Kramnik's take on the match (which I'm sure will be a great relief to Vlad!). I would add only that the reason Anand agreed to play in Sofia seemed to me to be financial. The government-backed bid was far higher than the others - if I recall correctly, it was nearly double the second highest bid.
Since Kasparov, and with a worldwide economic slowdown, it has been difficult to raise big money even for WC matches. Even the drama and controversy of Kramnik-Topalov didn't have "legs" in the non-chess world, and without outside interest there won't be huge prize funds. That may change when Carlsen challenges, he has a very broad appeal.
I think Anand is one of the strongest all-around players ever, and has become a very difficult fellow to defeat. If the match were the "traditional" 24 games (which apparently just costs too much in the modern world), he would be a strong favorite. Topalov, though, is so sharp tactically he can create opportunities where none are apparent, even taking great risks, so one cannot bet against him in a short match.
A strong edge goes to the first player to win a game in a short match. The psychological pressure on the player down a point makes it tougher to come back. So it is a toss-up, and should be an exciting match to watch.
Kramnik says it would be better for chess if Anand wins, which reminds me of the report from the Tal Memorial in Moscow. The reporter noted the only top player not present was Topalov, and asked Morozevich if he missed him. "No," came the reply, "I never miss him."
Topalov will win because the match is being held in home turf.
This is one of the most ignorant statements I have ever seen.
You prefer boorish (Topalov) over good manners (Anand)? You discount that no champion ever worked longer and harder to reach the top than Anand? I cannot even imagine the observations you have made to reach this conclusion. Your view is contrary to everything that I have seen of Anand.
If Topalov plays against Anand as poorly as he did against Kamsky he will lose for sure. He will have to play better chess against Anand to win. His risk taking is great for tournaments but I think will hurt him in a match against another top player. However, his risk taking makes his games some of the most exciting/interesting games to follow and he has very few short colorless draws, probably fewer than any other in the top ten. I just hope its a "clean" match with no off the board stunts like occured in Elista with Kramnik.
Why didn't Fischer play Karpov
by Pulpofeira a few minutes ago
8/28/2016 - Invincible
by abekiroz 3 minutes ago
8/26/2016 - Kouatly - Tsheshkovsky, Hoogovens 1988
by BryanCFB 5 minutes ago
Beautiful Brazilian Braganca Set Showcases Replacements by Alan Dewey
by cgrau 6 minutes ago
Illegal Position Contest!
by Senior-Lazarus_Long 7 minutes ago
8/27/2016 - Alexander Hildebrand, Springaren, 1951
by kfleming 9 minutes ago
Any "good" book about openings?
by kindaspongey 15 minutes ago
I am baned
by etc2000chess 16 minutes ago
Tell me which opening moves to play in my next games!
by IamNoMaster 17 minutes ago
I threw away the win.
by lutak22 17 minutes ago
Home |
Why Join | Chess Topics |
About |
FAQs |
Help & Support |
Site Map
Privacy Policy |
Legal |
© 2016 Chess.com
• Chess - English
We are working hard to make Chess.com available in over 70 languages. Check back over the year as we develop the technology to add more, and we will try our best to notify you when your language is ready for translating!


text:
NPR reported on the ongoing investigation of possible euthanasia at Memorial Hospital in New Orleans.
The report describes 4 eyewitnesses that testify about activites that suggest but do not prove patients on the 7th floor ( operated by the Lifecare Hospital) were given lethal doses of drugs after it was decided that the "critical" patients either could not or would not be evacuated. The 7th floor housed a long term facility not operated by the corporation who owned Memorial Hospital.
According to NPR, witnesses described hearing that the decision had been made that the DNR patients on 7 would not be evacuated or left alive after the other patients were evacuated.
Apparently there are no witness testifying that they saw anyone administer the medications.
The New Orleans coroner is quoted as saying the bodies were too decomposed to allow a definitive diagnosis of cause of death.
To date no charges have been filed.
Regardless of the final outcome of the investigation and legal actions that may be taken and what really happened , this is one more sad aspect of the tragic events of Katrina.