Write leases for distributed file systems

Information

  • Patent Grant
  • 10951705
  • Patent Number
    10,951,705
  • Date Filed
    Thursday, June 30, 2016
    8 years ago
  • Date Issued
    Tuesday, March 16, 2021
    3 years ago
Abstract
A method, article of manufacture, and apparatus for providing a write leases in a distributed file system is discussed. A lease break is received for a file at a client from a metadata server (“MDS”), wherein the client has a write lease for the file. A write buffer is flushed on the client to an object store, wherein the write buffer comprises data objects comprising the file. A metadata request is transmitted from the client to the MDS in connection with flushing the write buffer. A lease extension is received for the write lease from the MDS.
Description
FIELD OF THE INVENTION

This invention relates generally to distributed file systems, and more particularly to systems and methods for providing write leases in distributed file systems.


BACKGROUND OF THE INVENTION

Distributed file systems manage files and folders spread across multiple computers. They may serve a similar function as traditional file systems, but are designed to provide file/folder storage and controlled access over local and wide area networks.


Cloud providers may offer scalable object stores for storing data. Individuals and business may be presented with multiple cloud provider options for storing their data.


There is a need, therefore, for an improved method, article of manufacture, and apparatus for providing a distributed file systems.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be readily understood by the following detailed description in conjunction with the accompanying drawings, wherein like reference numerals designate like structural elements, and in which:



FIG. 1 depicts a system architecture for a distributed file system in a cloud environment consistent with an embodiment of the present disclosure



FIG. 2 depicts a process for providing write leases consistent with an embodiment of the present disclosure.



FIG. 3 depicts a process flushing a write buffer consistent with an embodiment of the present disclosure.





DETAILED DESCRIPTION

A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. While the invention is described in conjunction with such embodiment(s), it should be understood that the invention is not limited to any one embodiment. On the contrary, the scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications, and equivalents. For the purpose of example, numerous specific details are set forth in the following description in order to provide a thorough understanding of the present invention. These details are provided for the purpose of example, and the present invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the present invention is not unnecessarily obscured.


It should be appreciated that the present invention can be implemented in numerous ways, including as a process, an apparatus, a system, a device, a method, or a computer readable medium such as a computer readable storage medium or a computer network wherein computer program instructions are sent over optical or electronic communication links. Applications may take the form of software executing on a general purpose computer or be hardwired or hard coded in hardware. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. In general, the order of the steps of disclosed processes may be altered within the scope of the invention.


An embodiment of the invention will be described with reference to a data storage system in the form of a storage system configured to store files, but it should be understood that the principles of the invention are not limited to this configuration. Rather, they are applicable to any system capable of storing and handling various types of objects, in analog, digital, or other form. Although terms such as document, file, object, etc. may be used by way of example, the principles of the invention are not limited to any particular form of representing and storing data or other information; rather, they are equally applicable to any object capable of representing information.


Embodiments of the present disclosure address a distributed file system operating on a cloud environment. Distributed files systems may be used to manage files, folders, and other data spread across multiple computing systems. They may be presented to users, applications, or other clients as traditional file systems, but may actually provide access to data over local and wide area networks. For example, the data could be stored in a cloud based object stores, such as Amazon's AWS S3, Microsoft Azure, Google Cloud Storage, a private object store, and/or a hybrid object store. A metadata server may manage access to the data on these object stores, which could be a local or remote server from a client reading or writing the data.



FIG. 1 depicts a system implementing a distributed file system in a cloud environment. The system of FIG. 1 may include client 100, metadata server (“MDS”) 102, and object store 104. While only one client 100 is shown, the system may include multiple clients accessing the distributed file system. Similarly, the system may include multiple object stores 104 and/or multiple MDS 102.


Client 100 may be any general purpose computing device. For example, client 100 may be a personal computer, workstation, handheld computer, smart phone, and/or tablet computer. Additionally or alternatively, client 100 may be a software module or application running on a general purpose computing device. Client 100 may be in communication with a MDS 102 and object store 104 over a network connection, such as a local area network (“LAN”) or wide are network (“WAN”), or via any other form of communication. Client computer 100 may interact with the distributed file system as it would with a traditional file system, such as by writing data to and reading data from the distributed file system.


MDS 102 may be a general purpose computing device managing distributed file system metadata. This metadata could include, for example, the location of data stored in the distributed file system. MDS 102 may be a physical or a virtual machine, and may operate in an environment local to or remote from client 100. For example, MDS 102 may be a virtual machine operating in the same datacenter as client 100. Alternatively, MDS 102 may operate in a third party cloud environment, such as Amazon Web Services (“AWS”). In some embodiments, MDS 102 may operate in the same third party cloud environment as object store 104.


Object store 104 may comprise a storage location for storing data in the distributed file system. Object store 104 may be a private, public, or hybrid cloud environment capable of storing data. A private cloud may be an object store only available to clients belonging to a particular enterprise. For example, a private cloud may be a Open Stack SWIFT install operating in a datacenter completely under the control of an enterprise. The install, including the associated data and services, may not be accessible to anyone outside of the enterprise. A public cloud may be any object store accessible to the public that requires authentication to access certain data. For example, Amazon S3 is available to members of the public but data stored in the object store is only accessible by authorized clients. A hybrid cloud may be a combination of a private and public cloud, such that some data is stored in the private cloud and other data is stored in the public cloud.


In some embodiments, client 100 may transmit communications to and receive responses from MDS 102. Similarly, client 100 may transmit communications to and receive responses from object store 104. Typically these communications will be IO requests and responses, such as read/write communications, though any other time of communication is consistent with the present disclosure.


For example, client 100 may decide to read data from the distributed file system. Client 100 may first mount the distributed file system by transmitting a mount request and/or intent to MDS 102. Similarly, if the distributed file system has already been mounted, client 100 may transmit a change location/directory request to MDS 102. In response, MDS 102 may consult a metadata table to determine data objects located at the root of the mount or in the new location, and transmit information related to the data back to client 100. This data could be, for example, a list of files and/or directories located at the root or new location. The data may also include a unique identifier for each data object, such as a hash and/or path of the object.


Once client 100 has a list of files and/or directories, client 100 may select a data object to read. Client 100 may transmit a read request identifying the desired data object back to MDS 102. In some embodiments, this read request may include a path or hash identifier for the data object the client desires. Once MDS 102 receives the request, it may attempt to locate the data object on the distributed file system.


In an embodiment, MDS 102 maintains location data for all of the data objects in the distributed file system. This location data may be maintained with other data object metadata in a database on MDS 102. For example, the database may comprise a table mapping a data object to one or more object store locations. These object store locations could reside, for example, on object store 104.


In response to the read request received from client 100, MDS 102 may consult the database table to determine the object location. MDS 102 may then return the object location back to client 100. In an embodiment, the object location returned might be a URL the client may use to access all or part of the data object. For example, the URL may comprise “http://<object store domain>/<container identifier>/<object identifier>”, where <object store domain> is the domain of the object store, <container identifier> is an identifier for the distributed file system, and <object identifier> identifies the object to be read. In an embodiment, the object identifier is a hash of the object and/or a hash of a version of the object.


Client 100 may attempt to access the data object once it receives the data object location from MDS 102. If the data object location is a URL, the client may issue an HTTP GET to the URL. For example, the client may issue a GET to object store 104 and/or the cloud service provider holding the data object. In response, object store 104 may return the requested data object to client 100.


The present system may also be used to write data objects to the distributed file system. This process may be similar to reading data objects, as discussed above. Once the distributed file system is mounted and client 100 has identified the file system location where it wishes to write the data, client 100 may transmit a write intent to MDS 102. This write intent may include the identified file system location and an object identifier for the data object client 100 intends to write. In some embodiments, this object identifier may be a hash of the data object.


Upon receiving the intent, MDS 102 may consult a database table to determine if the data object has already been placed in an object store, such as object store 104. If the data object already exists, there is no need to write it to the object store a second time. MDS 102 may perform this check by comparing the provided object identifier to all of the object identifiers in the table. If there is a match, the data object exists. If there is not a match, the data object does not exist.


If the data object already exists in object store 104, client 100 may not need to transmit the data object to the store a second time. Instead, MDS 102 may create a new entry in the table comprising the object identifier and the location client 100 wishes to write the data. MDS 102 may then transmit a write complete notification to client 100, and the write process may terminate. Should client 100 issue a subsequent read for the object, MDS 102 may provide a URL to the data object on object 104 as discussed above. This process provides an inherent form of data deduplication by ensuring a data object is not written to the same object store multiple times.


If MDS 102 determines object store 104 does not have a copy of the data object (i.e. the object identifier is not found in the table), it may create a new entry for the object as discussed above. MDS 102 may additionally provide an object location back to client 100, and associate this object location with the new table entry. In some embodiments the object location is a URL constructed in the same manner as the URL generated during the read process.


Once client 100 receives the object location it may write the data object to that location. If the object location is a URL identifying an object store, such as object store 104, client 100 may write the data to that location using an HTTP POST or PUT. The POST/PUT request may include the data object client 100 wishes to store on object store 104. Client 100 may wait for a confirmation from object store 104 before determining the write was successful. Upon determining the write was successful, client 100 may transmit a commit request back to MDS 102. Once MDS 102 receives the commit request, it may update its metadata tables to indicate the location of the data object and that the write is successful.


While the above examples discuss reading and writing data objects as individuals, other configurations may exist. For example, individual data objects may be broken into a set of data chunks or segments. Each of these data chunks may be stored and accessed on the object store in the same manner as the individual data objects discussed above. When a client wishes to read a data object, the client may submit identifiers for all the data object's constituent chunks to the MDS and receive a URL for each. Similarly, for writes the client may submit identifiers for all the data object's constituent chunks to the MDS. In response, the MDS may only provide write URLs for the chunks that do not already exist on the object store. If the chunks already exist the MDS may simply update the metadata table; there is no need to write the chunks a second time.


In certain embodiments, dividing files into chunks, segments, or data objects before a client writes them to the distributed file system may enhance the distributed file system. This could, for example, reduce data redundancy, enhance compression, and/or improve read/write performance. Clients may store these data segments locally in a write-back buffer, which may be periodically flushed. To ensure other clients do not overwrite the file or read incorrect or incomplete data, a MDS may grant a client a write lease. Write leases may prevent any client other than the owner from writing data to a particular file.


Turning now to FIG. 2, a process for handling write leases and write-back buffers is discussed. In some embodiments, this process may occur on a system substantially similar to FIG. 1.


At block 200, a client may initiate a write to a file on a distributed file system. This initialization could be, for example, an intent transmitted to a MDS to create a new file. Additionally or alternatively, it may be a request to write to an existing file. In some embodiments, the intent may identify the location of the file on the distributed file system, as well as metadata information such as file type, permissions, etc.


In response to the write intent, at block 202 a MDS may grant the client a write lease on the file. In some embodiments, a write lease may be a flag, attribute, or other designator indicating that the file is not available to other clients for reading and/or writing. Granting a write lease to a particular client may ensure other clients do not overwrite data that the client holding the lease is writing. The write lease may further enable clients to read from a file only after changes have been committed, rather than mid way through a write process. In some embodiments, the write lease is not transmitted back to a client. Rather, the write lease is associated with the client and stored on MDS. If a different client attempts to read and/or write to the file, the MDS will note the write lease and either delay and/or reject the other client's request.


Once a client has a write lease for a file, the client may begin to write the data. In some embodiments, the file may be divided into data objects, segments, blocks, or chucks, as discussed above. The MDS may generate URLs for these objects, and they may be used to write to a remote objects store.


In some embodiments, a write-back buffer may be used to write the file to the object store. The write-back buffer may be a data structure that buffers write requests, such as data objects and/or their associated URLs, prior to making them to the object store. This write-back buffer may reside locally on the client, and may facilitate higher data transfer parallelism in the system.


Maximizing transfer parallelism may enhance the system's performance, and may be calculated as a bandwidth delay product (“BDP”). BDP may be defined as the amount of data in transit over a network to maximize bandwidth utilization. In a system with one connection that supports pipelining between a client and an object store, BDP may be calculated as the total available bandwidth multiplied by the round trip time. In a system that does not support pipelining or with multiple connections, a multiple of the calculated BDP may be necessary.


In some embodiments, the BDP may be associated with the write back buffer size. For example, the calculated BDP may be the theoretical minimum size for the write-back buffer. If the system does not support pipelining or utilizes multiple connections between the client and the object store, the write-back buffer size may be a multiple of the calculated BDP.


At block 204, the client may receive a lease break transmission from the MDS. This could occur, for example, while the client has data in the write-back buffer or is transmitting data to the object store. In some embodiments, a lease break transmission indicates that a client should commit all of the writes made to a file. For example, the lease break may indicate that the client should flush a write-back buffer containing data segments for a particular file to an object store for persistent storage. The lease break transmission may be sent from the MDS to the client when a different client attempts to read and/or write to the file, or after a designated time-to-live expires.


At 206, the client may initiate a flush to the object store. For example, the client may flush all of the data in the write-back buffer to the object store. Flushing the data may ensure that it is persistently stored before another client accesses it. Flushing the write-back buffer may, however, take a period of time. If the MDS issues a lease break and immediately enables another client to read the file using data in the object store, the data may be out of date or corrupt since the first client has not finished flushing the buffer. The present disclosure addresses this challenge.


At block 208, a metadata request may be transmitted from the client to the MDS in connection with flushing the write back buffer. For example, if the buffer is filled with data objects and/or segments, the client may request write URLs for each object from the MDS. This request, or write intent (as discussed above) may constitute a metadata request to the MDS. Similarly, once a data object has been written the client may transmit a commit request to the MDS. This commit may also be a metadata request associated with the flush.


In some embodiments, anytime or some of the time the MDS receives a metadata request from a client a count associated with the write lease may be incremented. This count may be a lease extension count, and may monitor the number of lease extensions a client may receive. Lease extensions may be extend a client's write lease, even after lease expires and/or a lease break has been transmitted to the client. For example, the MDS may receive a request from a different client while a client is flushing a write-back buffer to an object store. The MDS may then determine whether a client has any lease extensions available (i.e. the lease extension count is above 0). If it does, the count may be decremented and the lease may be extended for a period of time. Once the time expires, a lease break may be transmitted to the client. In some embodiments, the lease extension counter may be capped, such as at 1 extension. Once the counter reaches 0, no additional leases may be granted. Additionally or alternatively, the lease extension counter may not be incremented during a flush process.


At block 210, a lease extension for the client may be received. For example, an extension notification may be transmitted to the client. Additionally or alternatively, a lease break may be retained at the MDS and not transmitted to the client until the extension expires.


Turning now to FIG. 3, a process for flushing a write-back buffer is discussed. At block 300, a write intention may be transmitted to a MDS. In an embodiment, the write intent may be transmitted for every data object in the write-back buffer. In response, the MDS may provide write URLs for one or more data objects in the write back buffer.


Once the client receives a URL, it may write at least one of the data objects to an object store at block 302. This may be substantially similar to the write process discussed above.


Finally, once the write is successful, the client may transmit a data object commit request back to the MDS. This commit request may enable the MDS to update the metadata associated with the data object to indicate that the write was successful.


For the sake of clarity, the processes and methods herein have been illustrated with a specific flow, but it should be understood that other sequences may be possible and that some may be performed in parallel, without departing from the spirit of the invention. Additionally, steps may be subdivided or combined. As disclosed herein, software written in accordance with the present invention may be stored in some form of computer-readable medium, such as memory or CD-ROM, or transmitted over a network, and executed by a processor.


All references cited herein are intended to be incorporated by reference. Although the present invention has been described above in terms of specific embodiments, it is anticipated that alterations and modifications to this invention will no doubt become apparent to those skilled in the art and may be practiced within the scope and equivalents of the appended claims. More than one computer may be used, such as by using multiple computers in a parallel or load-sharing arrangement or distributing tasks across multiple computers such that, as a whole, they perform the functions of the components identified herein; i.e. they take the place of a single computer. Various functions described above may be performed by a single process or groups of processes, on a single computer or distributed over several computers. Processes may invoke other processes to handle certain tasks. A single storage device may be used, or several may be used to take the place of a single storage device. The disclosed embodiments are illustrative and not restrictive, and the invention is not to be limited to the details given herein. There are many alternative ways of implementing the invention. It is therefore intended that the disclosure and following claims be interpreted as covering all such alterations and modifications as fall within the true spirit and scope of the invention.

Claims
  • 1. A method for providing write leases in a distributed file system (“DFS”), the distributed file system including a metadata server (“MDS”) and an object store that is separate from the MDS, wherein metadata stored at the MDS includes location data for all data objects stored in the distributed file system and wherein the metadata includes a mapping of each data object to one or more object store locations and wherein data objects identified by the metadata are stored only at the object store, wherein communications between a client and the MDS are separate from communications between the client and the object store, the method comprising: initiating a write to a file, by the client, by transmitting a write intent to the MDS, wherein the MDS grants a write lease for the file to the client, wherein the write lease is stored only at the MDS and prevents other clients from writing to the file stored at the object store;receiving a lease break for the file at the client from the MDS, wherein the lease break indicates to the client to commit all writes made to the file to the object store;flushing a write buffer on the client to the object store by the client by writing data objects associated with the file and stored in the write buffer to the object store, wherein communications between the client and the object store are separate from communications between the client and the MDS;in connection with flushing the write buffer, transmitting a metadata request from the client to the MDS in connection with flushing the write buffer to the object store to obtain write URLs from the MDS for data objects associated with the file;decrementing a lease extension count, by the MDS, in response to the metadata request and providing a lease extension for the write lease, wherein the lease extension is denied when the lease extension count is zero, wherein the lease extension count is not incremented while flushing the write buffer;receiving the lease extension for the write lease from the MDS for the file in response to the metadata request, wherein the lease extension is maintained by the MDS and prevents other clients from overwriting the file subject to the lease extension;writing, by the client, the data objects associated with the file to the object store based on the write URLs received from the MDS;transmitting, by the client, a data object commit request back to the MDS such that the MDS can update metadata associated with all the data objects associated with the file flushed from the write buffer to indicate that the data objects associated with the file were successfully written to the object store.
  • 2. The method of claim 1, wherein flushing the write buffer comprises transmitting at least one of the data objects associated with the file to the object store.
  • 3. A computer program product for providing write leases in a distributed file system (“DFS”), the distributed file system including a metadata server (“MDS”) and an object store that is separate from the MDS, wherein metadata stored at the MDS includes location data for all data objects stored in the distributed file system and wherein the metadata includes a mapping of each data object to one or more object store locations and wherein data objects identified by the metadata are stored only at the object store, wherein communications between a client and the MDS are separate from communications between the client and the object store, the computer program product comprising a non-transitory computer readable medium encoded with computer executable program, the code enabling: initiating a write to a file, by the client, by transmitting a write intent to the MDS, wherein the MDS grants a write lease for the file to the client, wherein the write lease is stored only at the MDS and prevents other clients from writing to the file stored at the object store;receiving a lease break for the file at the client from the MDS, wherein the lease break indicates to the client to commit all writes made to the file to the object store;flushing a write buffer on the client to the object store by the client by writing data objects associated with the file and stored in the write buffer to the object store, wherein communications between the client and the object store are separate from communications between the client and the MDS;in connection with flushing the write buffer, transmitting a metadata request from the client to the MDS in connection with flushing the write buffer to the object store to obtain write URLs from the MDS for data objects associated with the file;decrementing a lease extension count, by the MDS, in response to the metadata request and providing a lease extension for the write lease, wherein the lease extension is denied when the lease extension count is zero, wherein the lease extension count is not incremented while flushing the write buffer;receiving the lease extension for the write lease from the MDS for the file in response to the metadata request, wherein the lease extension is maintained by the MDS and prevents other clients from overwriting the file subject to the lease extension;writing, by the client, the data objects associated with the file to the object store based on the write URLs received from the MDS;transmitting, by the client, a data object commit request back to the MDS such that the MDS can update metadata associated with all the data objects associated with the file flushed from the write buffer to indicate that the data objects associated with the file were successfully written to the object store.
  • 4. The computer program product of claim 3, wherein flushing the write buffer comprises transmitting at least one of the data objects associated with the file to the object store.
  • 5. A system for providing write leases in a distributed file system (“DFS”), the distributed file system including a metadata server (“MDS”) and an object store that is separate from the MDS, wherein metadata stored at the MDS includes location data for all data objects stored in the distributed file system and wherein the metadata includes a mapping of each data object to one or more object store locations and wherein data objects identified by the metadata are stored only at the object store, wherein communications between a client and the MDS are separate from communications between the client and the object store, the system comprising a computer processor configured to execute instructions comprising: initiating a write to a file, by the client, by transmitting a write intent to the MDS, wherein the MDS grants a write lease for the file to the client, wherein the write lease is stored only at the MDS and prevents other clients from writing to the file stored at the object store;receiving a lease break for the file at the client from the MDS, wherein the lease break indicates to the client to commit all writes made to the file to the object store;flushing a write buffer on the client to the object store by the client by writing data objects associated with the file and stored in the write buffer to the object store, wherein communications between the client and the object store are separate from communications between the client and the MDS;in connection with flushing the write buffer, transmitting a metadata request from the client to the MDS in connection with flushing the write buffer to the object store to obtain write URLs from the MDS for data objects associated with the file;decrementing a lease extension count, by the MDS, in response to the metadata request and providing a lease extension for the write lease, wherein the lease extension is denied when the lease extension count is zero, wherein the lease extension count is not incremented while flushing the write buffer;receiving the lease extension for the write lease from the MDS for the file in response to the metadata request, wherein the lease extension is maintained by the MDS and prevents other clients from overwriting the file subject to the lease extension;writing, by the client, the data objects associated with the file to the object store based on the write URLs received from the MDS;transmitting, by the client, a data object commit request back to the MDS such that the MDS can update metadata associated with all the data objects associated with the file flushed from the write buffer to indicate that the data objects associated with the file were successfully written to the object store.
  • 6. The system of claim 5, wherein flushing the write buffer comprises transmitting at least one of the data objects associated with the file to the object store.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation in part and claims priority to U.S. patent application Ser. No. 14/671,740 for DISTRIBUTED FILE SYSTEMS IN MULTI-CLOUD ENVIRONMENTS, filed Mar. 27, 2015, which is incorporated herein by reference for all purposes.

US Referenced Citations (131)
Number Name Date Kind
6091518 Anabuki Jul 2000 A
6112319 Paulson Aug 2000 A
6289345 Yasue Sep 2001 B1
6324492 Rowe Nov 2001 B1
6434608 Desal et al. Aug 2002 B1
6434609 Humphrey Aug 2002 B1
6467048 Olarig Oct 2002 B1
6658533 Bogin Dec 2003 B1
6959339 Wu Oct 2005 B1
7533133 Lanzatella May 2009 B1
7590803 Wintergerst Sep 2009 B2
7685463 Linnell Mar 2010 B1
8122102 Wein Feb 2012 B2
8224994 Schneider Jul 2012 B1
8260913 Knapp Sep 2012 B2
8281035 Farber Oct 2012 B2
1467167 Desai Mar 2015 A1
1467174 Desai et al. Mar 2015 A1
1467307 Desai et al. Mar 2015 A1
8984144 Schapira Mar 2015 B2
1486439 Panghal Sep 2015 A1
1486442 Panghal Sep 2015 A1
1486533 Panghal et al. Sep 2015 A1
9160704 Wein Oct 2015 B2
1497842 Panghal et al. Dec 2015 A1
1497848 Panghal et al. Dec 2015 A1
1497852 Panghal et al. Dec 2015 A1
9280683 Echeverria Mar 2016 B1
9286331 Knapp Mar 2016 B2
1519959 Desai et al. Jun 2016 A1
1519962 Desai et al. Jun 2016 A1
9426071 Caldejon Aug 2016 B1
1538880 Javadekar et al. Dec 2016 A1
9847966 Wein Dec 2017 B2
9898477 Panghal Feb 2018 B1
1002121 Desai Jul 2018 A1
1603177 Desai Jul 2018 A1
10191914 Manville Jan 2019 B2
10353873 Desai Jul 2019 B2
10417194 Desai et al. Sep 2019 B1
10423507 Panghal et al. Sep 2019 B1
10430385 Desai et al. Oct 2019 B1
10445296 Panghal Oct 2019 B1
10452619 Panghal et al. Oct 2019 B1
10547585 Wein Jan 2020 B2
20020124098 Shaw Sep 2002 A1
20020138559 Ulrich Sep 2002 A1
20020152318 Menon Oct 2002 A1
20030004952 Nixon et al. Jan 2003 A1
20030005084 Humphrey Jan 2003 A1
20040064485 Yoshida Apr 2004 A1
20040255048 Lev Ran Dec 2004 A1
20050246393 Coates Nov 2005 A1
20050262150 Krishnaswamy Nov 2005 A1
20060036602 Unangst Feb 2006 A1
20060080511 Hoover Apr 2006 A1
20060161642 Bopardikar et al. Jul 2006 A1
20060200623 Gonzalez Sep 2006 A1
20060277196 Oosawa Dec 2006 A1
20070094354 Soltis Apr 2007 A1
20070168542 Gupta Jul 2007 A1
20070171562 Maejima Jul 2007 A1
20070174333 Lee Jul 2007 A1
20070179981 Vincent Aug 2007 A1
20070237086 Tulac Oct 2007 A1
20080005468 Faibish Jan 2008 A1
20080189470 Saika Aug 2008 A1
20080195483 Moore Aug 2008 A1
20090083494 Bhanoo Mar 2009 A1
20090300279 Helsley et al. Dec 2009 A1
20100042743 Jeon Feb 2010 A1
20100070982 Pitts Mar 2010 A1
20100106914 Krishnaprasad Apr 2010 A1
20100161657 Cha Jun 2010 A1
20100250648 Cao et al. Sep 2010 A1
20100293336 Shribman Nov 2010 A1
20100299447 Salvi Nov 2010 A1
20100332401 Prahiad Dec 2010 A1
20100332456 Prahiad Dec 2010 A1
20110119437 Ogus May 2011 A1
20110145189 Zheng et al. Jun 2011 A1
20110258461 Bates Oct 2011 A1
20120054152 Adkins Mar 2012 A1
20120151016 Wein Jun 2012 A1
20120226770 Schapira Sep 2012 A1
20120254116 Thereska Oct 2012 A1
20120311248 Goodman Dec 2012 A1
20130041872 Aizman Feb 2013 A1
20130060884 Bernbo Mar 2013 A1
20130110906 Zearing May 2013 A1
20130179573 McCarty Jul 2013 A1
20130226888 Govind Aug 2013 A1
20130238752 Park et al. Sep 2013 A1
20130290284 Knapp Oct 2013 A1
20130297735 Wein Nov 2013 A1
20130297969 Kim Nov 2013 A1
20140039818 Arya Feb 2014 A1
20140040412 Yanagihara Feb 2014 A1
20140047261 Patiejunas et al. Feb 2014 A1
20140156822 Choi Jun 2014 A1
20140165119 Liu Jun 2014 A1
20140189432 Gokhale Jul 2014 A1
20140304268 Gunda Oct 2014 A1
20140337484 Kasten Nov 2014 A1
20140365866 Kinoshita Dec 2014 A1
20150058935 Tolia et al. Feb 2015 A1
20150113330 Grondin Apr 2015 A1
20150161048 Patil et al. Jun 2015 A1
20150180968 Schapira Jun 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150277802 Oikarinen Oct 2015 A1
20150280959 Vincent Oct 2015 A1
20150350106 Whalley Dec 2015 A1
20150364168 Riley Dec 2015 A1
20160011816 Aizman Jan 2016 A1
20160065670 Kimmel et al. Mar 2016 A1
20160092354 Steely Mar 2016 A1
20160196215 Ogihara Jul 2016 A1
20160212208 Kulkarni et al. Jul 2016 A1
20160239397 Thomas Aug 2016 A1
20160269501 Usgaonkar Sep 2016 A1
20160292429 Manville Oct 2016 A1
20160337426 Shribman Nov 2016 A1
20160357450 Rao et al. Dec 2016 A1
20160364407 Hong Dec 2016 A1
20170004082 Sehgal Jan 2017 A1
20170277709 Strauss et al. Sep 2017 A1
20170293766 Schnjakin Oct 2017 A1
20180322141 Desai Nov 2018 A1
20190340158 Desai Nov 2019 A1
20200026689 Desai et al. Jan 2020 A1
Non-Patent Literature Citations (5)
Entry
U.S. Appl. No. 16/511,252, filed Jul. 15, 2019, Rajiv Desai.
What is Data Deduplication?—Definition from Techopedia, https://www.techopedia.com/definition/1067/data-deduplication (Year: 2014).
What is Data Deduplication?—Definition from Techopedia, https://www.techopedia.com/definition/13725/inline-deduplication (Year: 2014).
Mark W. Storer et al, “Secure Data Deduplication”, ACM 2008, 10 pages. (Year: 2008).
What is Inline Deduplication?—Definition from Techopedia, https://www.techopedia.com/definition/13725/inline-deduplication (Year: 2014).
Provisional Applications (1)
Number Date Country
62088427 Dec 2014 US
Continuation in Parts (1)
Number Date Country
Parent 14671740 Mar 2015 US
Child 15199617 US