Patent Grant
9779103
Field of the Invention
The present invention relates in general to computers, and more particularly to a system and computer program product for preserving redundancy and other data security characteristics in computing environments in which data deduplication systems are incorporated.
Description of the Related Art
Computers and computer systems are found in a variety of settings in today's society. Computing environments and networks may be found at home, at work, at school, in government, and in other settings. Computing environments increasingly store data in one or more storage environments, which in many cases are remote from the local interface presented to a user.
These computing storage environments may use many storage devices such as disk drives, often working in concert, to store, retrieve, and update a large body of data, which may then be provided to a host computer requesting or sending the data. In some cases, a number of data storage subsystems are collectively managed as a single data storage system. These subsystems may be managed by host “sysplex” (system complex) configurations that combine several processing units or clusters of processing units. In this way, multi-tiered/multi-system computing environments, often including a variety of types of storage devices, may be used to organize and process large quantities of data.
Many multi-tiered/multi-system computing environments implement data deduplication technologies to improve storage performance by reducing the amount of duplicated storage across storage devices. Data deduplication systems are increasingly utilized because they help reduce the total amount of physical storage that is required to store data. This reduction is accomplished by ensuring that duplicate data is not stored multiple times. Instead, for example, if a chunk of incoming application WRITE data matches with an already stored chunk of data, a pointer to the original data is stored in the virtual storage map instead of allocating new physical storage space for the new chunk of data.
In certain situations, however, the behavior of deduplication i.e. single instancing of duplicate data, may go against the redundancy requirements of a hosted application, for example, or a storage policy, or other requirements. A need exists for a mechanism whereby data having the need to be stored multiple times is safeguarded, yet the benefits of deduplication systems are not diminished, by allowing deduplication to occur for remaining data not having such requirements.
In view of the foregoing, various embodiments for preserving data redundancy in data deduplication systems are disclosed. In one embodiment, by way of example only, a method for such preservation is disclosed. An indicator is configured. The indicator is provided with a selected data segment to be written through the data deduplication system to designate that the selected data segment must not be subject to a deduplication operation.
In addition to the foregoing exemplary embodiment, various system and computer program embodiments are provided and supply related advantages.
In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:
Data deduplication in storage controllers typically works “behind the scene” of an application, and may sometimes operate contrary to the interests of the application when deduplication operations are performed against the needs of the application. This situation may arise if an application writes multiple copies of the same data, and intends to retain multiple physical copies, while the deduplication subsystem (deduplication engine) finds these matching copies and ends up deduplicating the copies while storing the data. This can be detrimental to the application, which expects to find multiple copies at various locations, and is made to believe that it has done so by the storage subsystem, but in reality only a single copy of the data has been written.
Consider the following example. File systems usually prefer to write multiple physical copies of the “Superblock,” or a segment of metadata describing the file system on a block-based storage device, (or other metadata information) on a virtual disk to ensure redundancy. Since the contents of the Superblock are the same, data deduplication would result in retaining a single, physical copy of the Superblock and point multiple virtual addresses to the same physical block. This situation is highly inadvisable, because the loss of a single block on the physical copy of the Superblock may render the file system totally unusable, as there are no redundant copies of the Superblock. Conventionally, there are no existing methodologies that directly address this problem in data deduplication systems.
Various indirect methodologies may be employed to attempt to address this problem. In one example, the storage pool from which the data deduplication subsystem carves out physical storage can be mirrored (i.e., contains 2 or 3 copies of the same data). Hence multiple redundant copies can be created despite deduplication. However, this is inadequate protection for the application because of the following reasons. First, the application may wish to keep, for example, ten (10) copies of the same data. However, if the storage pool is two-way mirrored, it may only retain a maximum of two (2) copies. Second, since data deduplication carves out physical storage pools that span across large amounts of storage and multiple file systems, it is likely that multiple applications and file systems share the same physical storage pool. Hence it is possible that some critical copies of data (like the Superblock) get physically placed on the same disk. Since deduplication would prevent multiple copies of the same data to be written to multiple physical locations, the number of copies of critical data reduces and they can get placed on the same physical disk for multiple file systems. This increases the risk of single failures becoming fatal.
The illustrated embodiments provide multiple mechanisms for addressing the issues discussed previously. One goal of these mechanisms is to ensure that the deduplication subsystem in the storage controller (or wherever it may be located) balances the benefits of reducing the number of copies of data against application requirements for physical allocating multiple copies of critical data. Each of the methodologies described in the following illustrated embodiments may be used in a variety of circumstances and may have attendant benefits specific to those circumstances.
In one such embodiment, an indicator may be provided by the application for a selected data segment to the target storage controller to designate that the particular data segment is not subject to deduplication operations. This action then forces the storage controller to allocate new, physical storage for the specified data blocks. One such indicator may include a bit, which is set high or low depending on whether the desired deduplication should be performed for the selected data segment/block.
In view of the described embodiment, by allowing the application to dictate whether a write must be deduplicated, the application is allowed flexibility to implement storage policy associated with the data it generates. This way, the application is in a better position than the deduplication system to determine whether selected data blocks, even though identical, must still be located in separate physical locations. In addition, the storage controller (or other storage management device) continues to perform its role of data reduction by deduplication, and at the same time allowed enough control to the application to rule out deduplication when required.
By providing write commands with an indicator to indicate to the storage controller (or again, other storage management devices) whether the selected data must skip deduplication, very fine-grained control is thereby provided to the application, allowing for flexibility in implementation while still retaining advantages of deduplication functionality and retaining redundancy for key data.
In the following description, reference is made to the accompanying drawings which form a part hereof and which illustrate several embodiments of the present invention. It is understood that other embodiments may be utilized and structural and operational changes may be made without departing from the scope of the present invention.
Turning to
Memory 16 is shown including an application program 15, and an application program 17, in which a file system 19 is operational. Application 15 and application 17 may create, delete, or otherwise manage segments of data, such as data chunks or data blocks, which are physically stored in devices such as mass storage device 14. File system 19 provides a means to organize data expected to be retained after the application program 17 terminates by providing procedures to store, retrieve, and update data, as well as manage the available space on the device(s) that contain it. The file system 19 organizes data in an efficient manner, and is tuned to the specific characteristics of the device (such as computer 10 and/or memory 16). In one embodiment, application 17 may be an operating system (OS) 17, and file system 19 retains a tight coupling between the OS 17 and the file system 19. File system 19 may provide mechanisms to control access to the data and metadata, and may contain mechanisms to ensure data reliability such as those necessary to further certain aspects of the present invention, as one of ordinary skill in the art will appreciate. File system 19 may provide a means for multiple application programs 15, 17 to update data in the same file at nearly the same time.
In the illustrated embodiment, memory device 16 and mass storage device 14 are connected to CPU 12 via a signal-bearing medium. In addition, CPU 12 is connected through communication port 18 to a communication network 20, having an attached plurality of additional computer systems 22 and 24. The computer system 10 may include one or more processor devices (e.g., CPU 12) and additional memory devices 16 for each individual component of the computer system 10 to execute and perform each operation described herein to accomplish the purposes of the present invention.
To facilitate a clearer understanding of the methods described herein, storage controller 240 is shown in
In some embodiments, the devices included in storage 230 may be connected in a loop architecture. Storage controller 240 manages storage 230 and facilitates the processing of write and read requests intended for storage 230. The system memory 243 of storage controller 240 stores program instructions and data that the processor 242 may access for executing functions associated with managing storage 230. In one embodiment, system memory 243 includes, is associated, or is in communication with the operation software 250, and configured in part for accomplishing functionality of the present invention. As shown in
In some embodiments, cache 245 is implemented with a volatile memory and non-volatile memory and coupled to microprocessor 242 via a local bus (not shown in
Storage 230 may be physically comprised of one or more storage devices, such as storage arrays. A storage array is a logical grouping of individual storage devices, such as a hard disk. In certain embodiments, storage 230 is comprised of a JBOD (Just a Bunch of Disks) array or a RAID (Redundant Array of Independent Disks) array. A collection of physical storage arrays may be further combined to form a rank, which dissociates the physical storage from the logical configuration. The storage space in a rank may be allocated into logical volumes, which define the storage location specified in a write/read request.
In one embodiment, by way of example only, the storage system as shown in
The storage controller 240 includes a control switch 241 for controlling the fiber channel protocol to the host computers 210, 220, 225, a microprocessor 242 for controlling all the storage controller 240, a nonvolatile control memory 243 for storing a microprogram (operation software) 250 for controlling the operation of storage controller 240, data for control and each table described later, cache 245 for temporarily storing (buffering) data, and buffers 244 for assisting the cache 245 to read and write data, a control switch 241 for controlling a protocol to control data transfer to or from the storage devices 230, and compression operation module 255 and compression operation list module 257 in which information may be set. Multiple buffers 244 may be implemented with the present invention to assist with the operations as described herein.
In one embodiment, the host computers or one or more physical or virtual devices, 210, 220, 225 and the storage controller 240 are connected through a network adaptor (this could be a fibre channel) 260 as an interface i.e., via at least one switch called “fabric.” In one embodiment, the operation of the system shown in
The storage controller 240 is shown including a data deduplication engine 255, in which a number of write requests 259 are processed. The data deduplication engine 255 may be structurally one complete module or may be associated and/or incorporated within other individual modules. Data deduplication engine 255 is configured for performing, in conjunction with other components of storage controller 240 such as microprocessor 242, data deduplication operations on write data passed through storage controller 240 to storage 230.
As previously indicated, storage controller 240 includes cache 245 (or what may be termed holistically as cache system) 245 accepts write data from hosts 210, 220, and 225, or similar devices, that is then placed in cache memory 245. Data deduplication engine 255 then tests the write data for duplication in the cache memory 245. The write requests 259 that the application 17 (
In one embodiment, the application 17/file system 19 first determines whether a given data block must be stored multiple times on physical storage. This may be Superblock metadata associated with the file system 19 itself. The application 17 then may initiate a write request 259 to the underlying disk (device) driver, with the indicator 257 set (such as a high bit), designating that this data block must not be deduplicated, even if the block is determined to be identical to a previously written data block.
In a following step, the disk driver in turn prepares a command, such as a Small Computer Systems Interface (SCSI) command with the set bit to indicate “skip deduplication” to the storage controller 240. On receiving the designated data block, the storage controller 240, via data deduplication engine 255, skips the deduplication steps of fingerprint generation, matching, etc., as one of ordinary skill in the art will appreciate, and directly writes the selected data block onto a new physical disk location, even if there may have been earlier instances of identical data being stored on the storage controller 240.
In one embodiment, for applications executing at the user level, the writesystem call may be provided with an extended attribute indicating that a data block must be written to physical disk even if its contents match data written to disk earlier. If this is the case, additional steps are performed in similar fashion to that previously described depending on whether the write was to a block or a file interface, for example.
Turning now to
In the illustrated embodiment shown in
Turning now to
In an alternative embodiment, which is not shown for purposes of illustrative convenience, the cache system 245 may be placed in front of the deduplication engine 255. In such cases, if the indicator 257 is set in the write command 259, the corresponding data segment is written through the cache 245. Alternatively, the cache 245 stores the bit indicator 257 such that when the segment is later flushed, the indicator 257 for a given set of segments is available to the deduplication engine 255. One of ordinary skill in the art will appreciate that other modifications to the functional aspects depicted in
In
Returning to step 610, if the SCSI command does not include the set bit for the particular selected data segment, then the associated data segment is processed through various deduplication algorithms in the deduplication engine (such as being checked for deduplication in other versions of the data segment that were previously stored, and performing other deduplication functionality that would be apparent to those of ordinary skill in the art. The method 600 then ends (step 618).
The mechanisms of the illustrated embodiments may be applicable to write requests themselves as previously described, or, in other embodiments, be implemented in the context of the selected data itself. For example, in one embodiment, the Superblock metadata itself may be flagged with the indicator to designate the information as not subject to data deduplication operations. Other techniques for providing an indication in conjunction with selected data may be apparent to those of ordinary skill in the art as appropriate for a specific application.
As will be appreciated by one of ordinary skill in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module,” “process” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical fiber cable, RF, etc., or any suitable combination of the foregoing. Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, or entirely on the remote computer or server. In the last scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks. The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the above figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
While one or more embodiments of the present invention have been illustrated in detail, one of ordinary skill in the art will appreciate that modifications and adaptations to those embodiments may be made without departing from the scope of the present invention as set forth in the following claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 7567188 | Anglin et al. | Jul 2009 | B1 |
| 7818495 | Tanaka et al. | Oct 2010 | B2 |
| 7908436 | Srinivasan et al. | Mar 2011 | B1 |
| 8074049 | Gelson et al. | Dec 2011 | B2 |
| 8086799 | Mondal et al. | Dec 2011 | B2 |
| 8117464 | Kogelnik | Feb 2012 | B1 |
| 8468138 | Chhaunker et al. | Jun 2013 | B1 |
| 8527544 | Colgrove et al. | Sep 2013 | B1 |
| 8589640 | Colgrove et al. | Nov 2013 | B2 |
| 8712976 | Chen | Apr 2014 | B1 |
| 9058118 | Urkude et al. | Jun 2015 | B1 |
| 20030115447 | Pham et al. | Jun 2003 | A1 |
| 20030225800 | Kavuri | Dec 2003 | A1 |
| 20040111625 | Duffy et al. | Jun 2004 | A1 |
| 20040131182 | Rogaway | Jul 2004 | A1 |
| 20060179489 | Mas Ribes | Aug 2006 | A1 |
| 20060230076 | Gounares et al. | Oct 2006 | A1 |
| 20070168350 | Utiger | Jul 2007 | A1 |
| 20080098083 | Shergill | Apr 2008 | A1 |
| 20080244172 | Kano | Oct 2008 | A1 |
| 20090063795 | Yueh | Mar 2009 | A1 |
| 20090063883 | Mori | Mar 2009 | A1 |
| 20090268903 | Bojinov et al. | Oct 2009 | A1 |
| 20090271402 | Srinivasan et al. | Oct 2009 | A1 |
| 20090319585 | Gokhale | Dec 2009 | A1 |
| 20090319772 | Singh et al. | Dec 2009 | A1 |
| 20100037118 | Saliba et al. | Feb 2010 | A1 |
| 20100070478 | Anglin | Mar 2010 | A1 |
| 20100070715 | Waltermann et al. | Mar 2010 | A1 |
| 20100121825 | Bates | May 2010 | A1 |
| 20100250501 | Mandagere et al. | Sep 2010 | A1 |
| 20100250549 | Muller | Sep 2010 | A1 |
| 20100268960 | Moffat et al. | Oct 2010 | A1 |
| 20100299311 | Anglin et al. | Nov 2010 | A1 |
| 20100306412 | Therrien et al. | Dec 2010 | A1 |
| 20100313036 | Lumb | Dec 2010 | A1 |
| 20100313040 | Lumb | Dec 2010 | A1 |
| 20100333116 | Prahlad et al. | Dec 2010 | A1 |
| 20110022718 | Evans et al. | Jan 2011 | A1 |
| 20110029739 | Nakajima et al. | Feb 2011 | A1 |
| 20110035541 | Tanaka et al. | Feb 2011 | A1 |
| 20110066628 | Jayaraman | Mar 2011 | A1 |
| 20110145207 | Agrawal et al. | Jun 2011 | A1 |
| 20110145576 | Bettan | Jun 2011 | A1 |
| 20110225130 | Tokoro | Sep 2011 | A1 |
| 20110225214 | Guo | Sep 2011 | A1 |
| 20110238634 | Kobara | Sep 2011 | A1 |
| 20110238635 | Leppard | Sep 2011 | A1 |
| 20110239097 | Bates et al. | Sep 2011 | A1 |
| 20110258398 | Saliba et al. | Oct 2011 | A1 |
| 20120017043 | Aizman et al. | Jan 2012 | A1 |
| 20120072654 | Olbrich et al. | Mar 2012 | A1 |
| 20120089574 | Doerner | Apr 2012 | A1 |
| 20120095968 | Gold | Apr 2012 | A1 |
| 20120158672 | Oltean et al. | Jun 2012 | A1 |
| 20120317084 | Liu | Dec 2012 | A1 |
| 20130086006 | Colgrove et al. | Apr 2013 | A1 |
| 20130097380 | Colgrove et al. | Apr 2013 | A1 |
| 20130144846 | Chhaunker et al. | Jun 2013 | A1 |
| 20130262404 | Daga et al. | Oct 2013 | A1 |
| 20130262753 | Prins et al. | Oct 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 1341240 | Mar 2002 | CN |
| 101656720 | Feb 2010 | CN |
| 201110156839 | Jun 2011 | CN |
| 102156727 | Aug 2011 | CN |
| 102221982 | Oct 2011 | CN |
| 102281320 | Dec 2011 | CN |
| 2006308636 | Nov 2006 | JP |
| 2011033582 | Mar 2011 | WO |
| Entry |
|---|
| Wang et al., “Research on Secure De-duplication based on Proxy-Recreation,” Sciencepaper Online, Dec. 27, 2011 (7 pages). |
| Gu Yu et al., “Reliability Provision Mechanism for Large-Scale De-duplication Storage Systems,” J Tsinghua Univ (Sci & Tech), ISSN 1000-0054, vol. 50, No. 5, 2010 (6 pages). |
| Number | Date | Country | |
|---|---|---|---|
| 20130282669 A1 | Oct 2013 | US |
