Patent application number | Description | Published |
20110078115 | METHODS OF CONSISTENT DATA PROTECTION FOR MULTI-SERVER APPLICATIONS - A system according to one embodiment includes at least one processor configured to: receive a request to perform a snapshot of data associated with an application running on multiple servers; instruct I/O Freezers on different servers to freeze data requests from instances of the application running on the servers; and instruct the I/O Freezers to initiate snapshot processing on the data associated with the application so that the I/O Freezers perform the snapshot processing within the same window of synchronization. | 03-31-2011 |
20130080390 | BLOCK LEVEL BACKUP AND RESTORE - For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image. | 03-28-2013 |
20130080391 | BLOCK LEVEL BACKUP AND RESTORE - For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image. | 03-28-2013 |
20150046402 | DATA BACKUP ACROSS PHYSICAL AND VIRTUALIZED STORAGE VOLUMES - Machines, systems and methods for backing up data, the method comprising retrieving identifying information about target data storage volumes from which target data is to be backed up; communicating the identifying information to a proxy application installed on a backup computing system utilized to backup the target data stored on the target data storage volumes, wherein the proxy application uses the identifying information to place the target data storage volumes in a first state in which write operations may not be performed to the target data storage volumes, wherein the proxy application causes snapshots to be taken of the target data storage volumes of a first type and a second type, in response to determining that the target data storage volumes are placed in the first state. | 02-12-2015 |
Patent application number | Description | Published |
20110022601 | BLOCK LEVEL TAGGING WITH FILE LEVEL INFORMATION - Embodiments for data tagging in a computing environment are provided. A write operation in an operating system (OS) file system level storage layer is intercepted. A set of signatures in a sub-chunk level is calculated. The set of signatures are aligned to the beginning of an OS file system-level object and stored in a memory location, such as a cache, along with file system information relating to the write operation and to the file system-level object that the data is written into. Following file system processing, and as the data is written into storage in blocks, the write operation is intercepted in the block level storage layer. A secondary set of signatures in a sub-block level is calculated using a common algorithm used to create the original set of signatures. The sets of signatures are compared against each other, and blocks of the data having matching signatures are tagged with the file system information stored in the memory location. | 01-27-2011 |
20110055293 | Data Repository Selection Within a Storage Environment - Described is a method, system, and computer program product for selecting a data repository within a computing environment. The data repository can exist on multiple target computing systems as a logical entity called a volume or a file system. When selecting at least one data repository, a data protection system of the computing environment analyzes the incoming data from a source computing system, in conjunction with information describing the data repositories. The data repository information, or repository characteristic information, can be stored on a repository volume table (RVT) of the data protection system. By determining a weighted selection score from the analysis of all the information available to the data protection system, the data protection system can intelligently select a data repository for storing data from the source computing system. Further, by tracking repository characteristic information on a continuous or periodic basis, the data protection system can enable emulated views of data that has been stored on the data repositories of the computing environment. | 03-03-2011 |
Patent application number | Description | Published |
20100198793 | METHODS OF MULTI-SERVER APPLICATION SYNCHRONIZATION WITHOUT STOPPING I/O - A method according to one embodiment includes receiving a request to perform a backup of data associated with an application running on multiple servers; calculating a time value based on communications with the servers, the time value calculation including at least one of a latency of at least one of the communications, and a difference between a reference time clock value and a time clock value of at least one of the servers; and communicating with I/O Handlers on the servers for initiating a coordinated backup operation on the data at about a same start time. Additional systems, methods, and computer program products are also disclosed. | 08-05-2010 |
20100198949 | METHODS OF CONSISTENT DATA PROTECTION FOR MULTI-SERVER APPLICATIONS - A method according to one embodiment includes receiving a request to perform a snapshot of data associated with an application running on multiple servers; coordinating I/O Freezers on different servers for freezing data requests from instances of the application running on the servers; and after determining that the I/O Freezers have frozen the data requests, requesting initiation of a snapshot operation to take the snapshot of the data. | 08-05-2010 |
20110145508 | AUTOMATIC DETERMINATION OF READ-AHEAD AMOUNT - Read-ahead of data blocks in a storage system is performed based on a policy. The policy is stochastically selected from a plurality of policies in respect to probabilities. The probabilities are calculated based on past performances, also referred to as rewards. Policies which induce better performance may be given precedence over other policies. However, the other policies may be also utilized to reevaluate them. A balance between exploration of different policies and exploitation of previously discovered good policies may be achieved. | 06-16-2011 |
20110208930 | Providing Shared Access to Data Storage Resources Across Cluster Computing Environment Boundaries - Providing shared access to data storage resources in a cluster computing environment, including detecting when a computer node requests access to a data storage device in a manner that excludes a computing device from accessing the data storage device, where the computer node is configured to communicate with the data storage device along a first communications channel, and where the computing device is configured to communicate with the data storage device along a second communications channel that is exclusive of the first communications channel, and responsive to the detecting, causing the data storage device to allow the computer node and the computing device to share access to the data storage device. | 08-25-2011 |
20120023068 | METHODS OF MULTI-SERVER APPLICATION SYNCHRONIZATION WITHOUT STOPPING I/O - A method according to one embodiment includes receiving a request to perform a backup of data associated with an application running on multiple servers; communicating with I/O Handlers on the servers for initiating a coordinated backup operation on the data at about a same start time; and instructing the I/O Handlers to stretch communication between instances of the application and data storage volumes associated therewith during initiating the backup operation. Additional systems, methods, and computer program products are also disclosed. | 01-26-2012 |
20120151136 | INSTANT DATA RESTORATION - Various embodiments are provided for restoration of data by a processor. In one embodiment, by way of example only, an exposed Internet Small Computer System Interface (iSCSI) target of a backup repository is defined as a source of, and a storage volume to be recovered as a target of, a mirrored pair of storage resources. The iSCSI target represents a point-in-time backup snapshot. Data from the iSCSI target is synchronized to the storage volume. The mechanisms of the illustrated embodiments leverage iSCSI with Instant Restore to reduce a Recovery Time Objective (RTO) and provide a secure transport when recovering a volume over a WAN. | 06-14-2012 |
20120203974 | AUTOMATIC DETERMINATION OF READ-AHEAD AMOUNT - Read-ahead of data blocks in a storage system is performed based on a policy. The policy is stochastically selected from a plurality of policies in respect to probabilities. The probabilities are calculated based on past performances, also referred to as rewards. Policies which induce better performance may be given precedence over other policies. However, the other policies may be also utilized to reevaluate them. A balance between exploration of different policies and exploitation of previously discovered good policies may be achieved. | 08-09-2012 |
20120203975 | AUTOMATIC DETERMINATION OF READ-AHEAD AMOUNT - Read-ahead of data blocks in a storage system is performed based on a policy. The policy is stochastically selected from a plurality of policies in respect to probabilities. The probabilities are calculated based on past performances, also referred to as rewards. Policies which induce better performance may be given precedence over other policies. However, the other policies may be also utilized to reevaluate them. A balance between exploration of different policies and exploitation of previously discovered good policies may be achieved. | 08-09-2012 |
20120254535 | INSTANT DATA RESTORATION - An exposed Internet Small Computer System Interface (iSCSI) target of a backup repository is defined as a source of, and a storage volume to be recovered as a target of, a mirrored pair of storage resources. The iSCSI target represents a point-in-time backup snapshot. Data from the iSCSI target is synchronized to the storage volume. The mechanisms of the illustrated embodiments leverage iSCSI with Instant Restore to reduce a Recovery Time Objective (RTO) and provide a secure transport when recovering a volume over a WAN. | 10-04-2012 |
20120317383 | FAST COPY USING FILE SYSTEM BLOCK MAPPINGS - Multiple target blocks are allocated on a first storage device to store a target object. The target blocks are arranged to be in a one-to-one correspondence with multiple source blocks of a source object. The target blocks are set to a non-populated state, and target blocks in the non-populated state are populated with data from corresponding source blocks. While the target blocks are being populated, if a request is received to retrieve data from one of the target blocks that is in the non-populated state, then the one of the target blocks is populated with the data from the corresponding source block and set to a populated state. | 12-13-2012 |
20120317387 | FAST COPY USING FILE SYSTEM BLOCK MAPPINGS - Multiple target blocks on a first storage device are allocated to store a target object. The target blocks are arranged to be in a one-to-one correspondence with multiple source blocks of a source object. The target blocks are set to a non-populated state, and target blocks in the non-populated state are populated with data from corresponding source blocks. While the target blocks are being populated, if a request is received to retrieve data from one of the target blocks that is in the non-populated state, then the one of the target blocks is populated with the data from the corresponding source block and set to a populated state. | 12-13-2012 |
20130007315 | METHODS OF MULTI-SERVER APPLICATION SYNCHRONIZATION WITHOUT STOPPING I/O - A method according to one embodiment includes receiving, at an I/O Handler, an instruction to initiate a backup operation on data associated with an application running on multiple servers; and stretching communication between instances of the application and data storage volumes associated therewith during initiating the backup operation. Additional systems, methods, and computer program products are also disclosed. | 01-03-2013 |
20140195759 | Increasing Efficiency of Block-Level Processes Using Data Relocation Awareness - A mechanism is provided for increasing the efficiency of block-level processes. Responsive to detecting an I/O write to a storage volume, a determination is made as to whether the I/O write matches one or more suspicious I/O reads in a plurality of suspicious I/O reads previously recorded in a memory. Responsive to the I/O write matching one or more suspicious I/O reads in the plurality of suspicious I/O reads, an identification is made that there is a data relocation associated with the sector associated with the I/O write. A data relocation application is informed of the data relocation of the sector associated with the one or more suspicious I/O reads associated with the sector indicated by the I/O write. Each sector associated with the one or more suspicious I/O reads is then released in a file system for reuse. | 07-10-2014 |
20150032910 | INPUT/OUTPUT MONITORING MECHANISM - Machines, systems and methods for I/O monitoring in a plurality of compute nodes and a plurality of service nodes utilizing a Peripheral Component Interconnect express (PCIe) are provided. In one embodiment, the method comprises assigning at least one virtual function to a services node and a plurality of compute nodes by the PCIe interconnect and a multi-root I/O virtualization (MR-IOV) adapter. The MR-IOV adapter enables bridging of a plurality of compute node virtual functions with corresponding services node virtual functions. A front-end driver on the compute node requests the services node virtual function to send data and the data is transferred to the services node virtual function by the MR-IOV adapter. A back-end driver running in the services node receives and passes the data to a software service to modify/monitor the data. The back-end driver sends the data to another virtual function or an external entity. | 01-29-2015 |
20150040121 | Bandwidth Control in Multi-Tenant Virtual Networks - Machines, systems and methods for managing quality of service (QoS) in a multi-tenant virtualized computing environment, the method comprising: collecting transmission rate statistics associated with data communicated in a virtual network, wherein at least one virtual switch monitors communications initiated by at least a virtual machine (VM) executed on a host machine serviced by the virtual switch; determining, by way of the virtual switch, profile parameters associated with a first communication initiated by the VM belonging to at least a first group, wherein a connection request is submitted by the virtual switch to a traffic controller to assist in establishing the first communication; classifying the connection request for establishing the first communication according to the profile parameters associated with the first communication; determining a first aggregated transmission rate associated with the VM that initiated the first communication based on the classifying. | 02-05-2015 |