Abstract: Methods and the like according to the disclosure can include determining an information type of digital information, writing the digital information using a first process (in response to a determination that the information type of the digital information is a first information type), and, in response to a determination that the information type of the digital information is a second information type, determining erasure-coded parity information for the digital information and writing the digital information using a second process (where the digital information is to be written to erasure-coded storage). In the former case, the first process that includes writing the digital information to storage. The second process includes writing the digital information and the erasure-coded parity information to erasure-coded storage, without writing the digital information to a log.

Abstract: The disclosed computer-implemented method for distributing information across failure domains in servers may include (1) dividing, at a computing device, each of a quantity of “K” failure domains (FDs) in a plurality of FDs into a quantity of “P” portions, where the “K” FDs in the plurality of FDs are constituent parts of respective servers in a plurality of servers, “P” is less than “K,” and “P” is a sum of a quantity of “M” data portions and a quantity of “N” parity portions, (2) creating a quantity of “K” erasure-coded volumes in the “K” FDs, where each erasure-coded volume includes “M” data portions and “N” parity portions, and each portion in each erasure-coded volume is stored in a different FD and (3) combining the “K” volumes to create a file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes to improve application performance in replication environments. In one embodiment, first application input/output (I/O) throughput and second application I/O throughput are associated with a data volume and are both sampled, with the first application I/O throughput being sampled while the data volume is set to an asynchronous write acknowledgement mode and the second application I/O throughput being sampled while the data volume is set to a synchronous write acknowledgement mode. A determination is made as to whether the asynchronous write acknowledgement mode or the synchronous write acknowledgement mode provides a higher application I/O throughput for the data volume. The data volume is then set to a preferred write acknowledgement mode that is selected, based on a result of the determining, from the asynchronous write acknowledgement mode and the synchronous write acknowledgement mode, and in certain embodiments, a mixed write acknowledgement mode.

Abstract: Disclosed herein are methods, systems, and processes to perform input/output (I/O) fencing without dedicated arbitrators. A coordination storage identifier is stored in a storage device as metadata. The coordination storage identifier is associated with a node of a cluster coupled to the storage device, and an I/O fencing operation is performed using the coordination storage identifier.

Abstract: The disclosed computer-implemented method for switching replication modes in a volume replication system may include (i) in response to deciding to switch from a synchronous replication mode of a volume replication system to an asynchronous replication mode, changing, by a computing device, to the asynchronous replication mode, (ii) associating a new write request to write data to storage, (iii) determining, based on metadata of the existing write request, that the existing write request was issued in the synchronous replication mode, (iv) in response to determining that the existing write request was issued in the synchronous replication mode, processing the existing write request via the synchronous replication, and (v) processing the new write request via the asynchronous replication based on the metadata of the new write request. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for detecting bit rot in distributed storage devices having failure domains may include (1) receiving, at a computing device, a combination of data chunks created by adding, for each failure domain storing data chunks, data chunks from different stripes, (2) receiving a combination of parity chunks created by adding, for each failure domain storing parity chunks, parity chunks from the different stripes, (3) creating at least one new parity chunk from the combination of data chunks, and (4) identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match the combination of parity chunks. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for transmitting data to a remote storage device may include (i) selecting, by a computing device, a bucket of a hash table for a data packet, (ii) adding a generation number to the data packet, (iii) transmitting the data packet to a remote storage device, (iv) adding the data packet to a send-list of the bucket, (v) receiving an acknowledgement packet for the data packet, (vi) determining that the acknowledgement packet corresponds to the generation number of the data packet, and (vii) removing the data packet from the send-list of the bucket. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for distributing information across distributed storage devices may include (1) dividing, at a computing device, each of “K” distributed storage devices (DSDs) in a plurality of DSDs into “P” portions, where “P” is a sum of “M” data portions and “N” parity portions, (2) creating “K” erasure-coded volumes, where each volume includes one portion on different DSDs, “M” data portions, and “N” parity portions, and (3) combining the “K” volumes to create a file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for managing quality of service may include (i) installing, at a network protocol layer, a latency monitoring plug-in that monitors latency at the network protocol layer as distinct from a storage layer beneath the network protocol layer, (ii) providing, by the latency monitoring plug-in, feedback reporting the latency at the network protocol layer to a quality of service engine that monitors characteristics of the storage layer such that the quality of service engine learns about the latency at the network protocol layer, and (iii) adjusting, by the quality of service engine, a calculation of system capacity, based on both the feedback from the latency monitoring plug-in reporting the latency at the network protocol layer and the monitored characteristics of the storage layer to enable an application to adhere to a service level agreement. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for detecting bit rot in distributed storage devices having failure domains may include (1) receiving, at a computing device, a combination of data chunks created by adding, for each failure domain storing data chunks, data chunks from different stripes, (2) receiving a combination of parity chunks created by adding, for each failure domain storing parity chunks, parity chunks from the different stripes, (3) creating at least one new parity chunk from the combination of data chunks, and (4) identifying a presence of bit rot in the failure domains when the at least one new parity chunk does not match the combination of parity chunks. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes to improve application performance in replication environments. A read command configured to cause a read operation to be performed on a unit of storage in a data volume is received. A state of a lock is determined. The state of the lock indicates whether a write operation is ongoing, and the write operation results in data being written to a storage replication log and to the data volume. The write operation is ongoing because writing the data to the storage replication log and to the data volume has not completed. In response to a determination that the write operation is not ongoing, the read operation is allowed to be performed on the unit of storage.

Abstract: Described herein are methods, systems, and processes to improve application performance in replication environments. A first write acknowledgement mode associated with a data volume is identified. The first write acknowledgement mode is one of multiple write acknowledgement modes. The write acknowledgement modes include a synchronous write acknowledgement mode and an asynchronous write acknowledgement mode. The data volume is switched from the first write acknowledgement mode to a second write acknowledgement mode that is part of the write acknowledgement modes, and is the synchronous write acknowledgement mode or the asynchronous write acknowledgement mode.

Abstract: Disclosed herein are methods, systems, and processes to perform input/output (I/O) fencing without dedicated arbitrators. A coordination storage identifier is stored in a storage device as metadata. The coordination storage identifier is associated with a node of a cluster coupled to the storage device, and an I/O fencing operation is performed using the coordination storage identifier.

Abstract: Various systems and methods for adjusting threshold access frequency based on cache pressure are disclosed. The threshold access frequency is adjusted based on a block of data in a storage volume that has an access frequency matching or exceeding the threshold access frequency. The threshold access frequency is used to determine whether the block of data should be inserted into the cache from the storage volume.

Abstract: Multiple nodes of a cluster have associated non-shared, local caches, used to cache shared storage content. Each local cache is accessible only to the node with which it is associated, whereas the cluster-level shared storage is accessible by any of the nodes. Attempts to access the shared storage by the nodes of the cluster are monitored. Information is tracked concerning the current statuses of the local caches of the nodes of the cluster. Current tracked local cache status information is maintained, and stored such that it is accessible by the multiple nodes of the cluster. The current tracked local cache status information is used in conjunction with the caching functionality to determine whether specific nodes of the cluster are to access their local caches or the shared storage to obtain data corresponding to specific regions of the shared storage.

Abstract: When a loss of connectivity between a first node in a cluster of nodes and a data store is detected, an input/output (I/O) request associated with an application that was executing on the first node is shipped to a second node in the cluster that is in communication with the data store. The application can be gracefully shut down on the first node, and the second node can execute the application and satisfy the I/O request.

Abstract: A computer-implemented method for identifying access rate boundaries of workloads may include (1) tracking the number of times each region of data within a plurality of regions of data is accessed during a period of time, (2) creating an ordered list of each region of data from the plurality of regions of data, (3) calculating one or more drops in access rates between two or more regions of data in the ordered list, (4) determining that a calculated access-rate drop from a first region of data to a second region of data exceeds a predefined threshold, and (5) calculating a boundary access rate for a workload of data. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer-implemented method for identifying access rate boundaries of workloads may include (1) tracking the number of times each region of data within a plurality of regions of data is accessed during a period of time, (2) creating an ordered list of each region of data from the plurality of regions of data, (3) calculating one or more drops in access rates between two or more regions of data in the ordered list, (4) determining that a calculated access-rate drop from a first region of data to a second region of data exceeds a predefined threshold, and (5) calculating a boundary access rate for a workload of data. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer-implemented method for facilitating access to shared resources within computer clusters may include (1) identifying a computer cluster, (2) identifying at least one node within the computer cluster that has been selected to execute an application, (3) identifying at least one different node within the computer cluster that has not yet been selected to execute the application, (4) importing a read-write configuration of at least one shared resource to the node, (5) importing a read-only configuration of the shared resource to the different node, (6) determining, after importing the read-only configuration of the shared resource to the different node, that the different node has been selected to execute the application, and then (7) converting, in response to this determination, the different node's read-only configuration of the shared resource to the read-write configuration of the shared resource. Various other systems, methods, and computer-readable media are also disclosed.

Abstract: A computer-implemented method for migrating files to tiered storage systems may include 1) identifying at least one file to migrate from a first file system to a second file system, where the second file system may include a plurality of storage tiers, 2) identifying file metadata associated with the file as stored on the first file system, 3) before writing the file to the second storage system, selecting a storage tier from the plurality of storage tiers based at least in part on the file metadata, and 4) writing the file directly to the selected storage tier within the second file system to avoid moving the file to the selected storage tier after writing the file to the second file system. Various other methods, systems, and computer-readable media are also disclosed.