Patent classifications
G06F2201/825
METHOD AND DEVICE FOR PROCESSING DISTRIBUTED TRANSACTION
An objective of the present application is to provide a method and device for processing a distributed transaction. Compared with the prior art, in a distributed system, a first device in the present application is a group formed by multiple nodes. The first device acquires a writer lock adding request, sent by an SQL compiler, about a target table of a to-be-processed transaction, and performs writer lock adding processing on the target table on the basis of the writer lock adding request, so as to avoid collision problems in multi-transaction concurrence and to ensure isolation of transactions. If the writer lock adding processing is successful, to-be-processed version information of the target table is sent to the SQL compiler, so as to ensure that the SQL compiler operates a correct version of the target table later. Further, by restarting child nodes which do not respond to the writer lock adding request or migrating service of the child nodes to other physical machines and then updating locking state information of the child nodes, the present application effectively recovers errors and ensures in-group consistency.
Self-healing virtualized file server
In one embodiment, a system for managing a virtualization environment comprises a plurality of host machines, one or more virtual disks comprising a plurality of storage devices, a virtualized file server (VFS) comprising a plurality of file server virtual machines (FSVMs), wherein each of the FSVMs is running on one of the host machines and conducts I/O transactions with the one or more virtual disks, and a virtualized file server self-healing system configured to identify one or more corrupt units of stored data at one or more levels of a storage hierarchy associated with the storage devices, wherein the levels comprise one or more of file level, filesystem level, and storage level, and when data corruption is detected, cause each FSVM on which at least a portion of the unit of stored data is located to recover the unit of stored data.
Using a logical operation coalescer to enable recovery from update failures to a shared data store
The technologies described herein are generally directed toward maintaining data coherence after an updating node fails during an update. According to an embodiment, a system can comprise a processor and a memory that can enable performance of operations including, based on first updating activity by first updating equipment, locking a portion of a data structure for updates with a lock, where the first updating equipment has been determined to have abnormally ceased the first updating activity, resulting in an update activity failure. The operations can further include receiving, by the computing equipment, from second updating equipment, an indication of the update activity failure, during second updating activity of the portion. Further, the operations can include, based on the indication, reconciling, by the computing equipment, the second updating activity and the update activity failure.
FAILURE RECOVERY IN SHARED STORAGE OPERATIONS
Systems and methods for failure recovery in shared storage operations. An example method comprises: acquiring a lock with respect to a storage domain comprising a specified disk image; creating a transaction marker associated with the disk image; creating a component of a new volume associated with the disk image; destroying the transaction marker; and releasing the lock with respect to the storage domain.
METHODS AND SYSTEMS FOR A COPY-OFFLOAD OPERATION
Methods and systems for a copy-offload operation are provided. A soft range lock is placed for a data container for generating a token for a copy-offload operation for copying the data container from a source location to a destination location, where presence of the soft range lock indicates that content of the data container has not changed during the copy-offload operation. A token for the copy-offload operation represents the content of data container and includes information regarding the soft range lock. The token with the soft range lock information is provided to the client that requests the copy-offload operation. If the soft range lock exists, then the data container is copied without using a point in time copy of the data container.
SELF-HEALING VIRTUALIZED FILE SERVER
In one embodiment, a system for managing a virtualization environment comprises a plurality of host machines, one or more virtual disks comprising a plurality of storage devices, a virtualized file server (VFS) comprising a plurality of file server virtual machines (FSVMs), wherein each of the FSVMs is running on one of the host machines and conducts I/O transactions with the one or more virtual disks, and a virtualized file server self-healing system configured to identify one or more corrupt units of stored data at one or more levels of a storage hierarchy associated with the storage devices, wherein the levels comprise one or more of file level, filesystem level, and storage level, and when data corruption is detected, cause each FSVM on which at least a portion of the unit of stored data is located to recover the unit of stored data.
RUNTIME FILE SYSTEM CONSISTENCY CHECKING DURING BACKUP OPERATIONS
The present disclosure relates to maintaining file system consistency on a mounted storage device in a computing system during system runtime. In one embodiment, a method generally includes locking access to a file stored in a file system on the mounted storage volume and metadata associated with the file. A computing system determines one or more properties associated with the file and examines the metadata for inconsistencies between the metadata and the determined properties. Upon determining that the metadata and the determined properties are consistent, the computing system generates a backup copy of the file, commits the backup copy to a backup data repository, and unlocks access to the file.
Method of testing coverage of meta data access patterns within a distributed relational system
A first and a second catalog access statement are obtained. For the first catalog access statement, a first lock schedule which includes a catalog resource being locked and a lock strength is obtained. For the second catalog access statement, a second lock schedule which includes a catalog resource being locked and a lock strength are obtained. A potential deadlock between the first and the second catalog access statement is identified, including by comparing the first lock schedule and the second lock schedule.
Using a recovery snapshot during live migration
Examples perform live migration of VMs from a source host to a destination host using destructive consistency breaking operations. The disclosure makes a record of a consistency group of VMs on storage at a source host as a fail-back in the event of failure. The source VMs are live migrated to the destination host, disregarding consistency during live migration, and potentially violating the recovery point objective. After live migration of all of the source VMs, consistency is automatically restored at the destination host and the live migration is declared a success.
Increased parallelization efficiency in tiering environments
A computer-implemented method, according to one embodiment, includes: identifying block addresses which are associated with a given object, and combining the block addresses to a first set in response to determining that at least one token is currently issued on one or more of the identified block addresses. A first portion of the block addresses is transitioned to a second set, where the first portion includes ones of the block addresses determined as having a token currently issued thereon. Moreover, a second portion of the block addresses is divided into equal chunks, where the second portion includes the block addresses remaining in the first set. The chunks in the first set are allocated across two or more parallelization units. Furthermore, the block addresses in the second set are divided into equal chunks, and the chunks in the second set are allocated to at least one dedicated parallelization unit.