Abstract: Storage locations in a first tier of a multi-tier storage system are allocated to a first set of data structures (e.g., inodes) in a first file set. A file that is stored in the first tier is associated with a first data structure of the first set. In response to determining that data in the file should be moved to a second tier of the multi-tier storage system, the file is associated with a second data structure in a second file set. The second data structure is allocated a storage location in the second tier. Consequently, two data structures are associated with the file. The data is copied from the first tier to the storage location in the second tier, and can be subsequently accessed using the second data structure.

Abstract: The disclosed computer-implemented method for automatic storage tiering may include (1) receiving characteristics of previous accesses to storage system objects stored in a data storage system including multiple storage tiers, (2) generating, based on the characteristics of previous accesses to the storage system objects, a model that predicts characteristics of future accesses to the storage system objects, (3) selecting, based on the model, a next storage tier of the multiple storage tiers for each of the storage system objects, and (4) relocating at least some of the storage system objects from a current storage tier to the next storage tier selected for each of the at least some of the storage system objects. 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 managing quality of service may include (i) providing, in a network storage environment, a quality of service engine to regulate network traffic by assigning three separate factors to applications that are consuming a network resource, (ii) adding, to a configuration of the quality of service engine, a fourth priority factor that establishes two tiers of priority among applications that generate traffic that is regulated by the quality of service engine, and (6) regulating, by the quality of service engine based on the fourth priority factor, network traffic in the network storage environment by providing access to the network resource to an application assigned a higher priority over another application assigned a lower priority such that the fourth priority factor enables the quality of service engine 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 distributing cache space may include (i) identifying workloads that make input/output requests to a storage system that comprises a cache that stores a copy of data recently written to the storage system, (ii) calculating a proportion of the cache that is occupied by data written to the cache by a workload, (iii) determining that the proportion of the cache that is occupied by the data written to the cache by the workload is disproportionate, and (iv) limiting the volume of input/output requests from workload that will be accepted by the storage system in response to determining that the proportion of the cache that is occupied by the data written to the cache by the workload is disproportionate. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for flushing data in a virtual computing environment is provided. The method includes writing application output from an application spanning one or more virtual machines to a cache, wherein each virtual machine is implemented using one or more compute nodes and the cache is implemented in storage associated with the one or more compute nodes. In an effort to flush data associated with application writes more efficiently from the cache to a local backing store or one or more data nodes, the method may include generating a mapping of each of the plurality of application writes. The method may further include sorting sets of one or more virtual disks based upon an offset of each application write as indicated in the mapping. In addition, a storage virtualizer may cancel duplicate application writes, merge multiple contiguous application writes, and merge multiple epochs prior to flushing the data.

Abstract: A method for implementing continuous data replication in a distributed computer system. The method includes receiving a forwarded data object write I/O from a data server. The method further includes examining attribute information of the data object to determine a consistency group for the data object. A replication policy is examined in view of the consistency group of the data object to determine a destination redundancy server. The data object write I/O is forwarded to the destination redundancy server for storage. An acknowledgment is then sent to the data server upon storage of the data object in the destination redundancy server.

Abstract: A method for two level quality of service scheduling for latency and queue depth control in a storage system is provided. The method includes determining queue depth as input/output operations per unit time that a storage subsystem can sustain, for each of a plurality of queues corresponding to storage subsystems in the storage system and determining system capacity as total input and output operations per unit time that the storage system can sustain, based on the queue depth of each of the plurality of queues. The method includes determining whether to accept or deny an input/output request for placement onto an input/output stack, based on a comparison of credits of the input/output request to the system capacity as determined on an ongoing basis, and placing the input/output request from the input/output stack onto one of the plurality of queues based on whether doing so maintains the queue depth of the one of the plurality of queues.

Abstract: The disclosed computer-implemented method for improving quality of service within hybrid storage systems may include (1) monitoring a performance measurement of a hybrid storage system that includes first and second types of storage devices that handle I/O throughput in connection with an application, (2) determining, based at least in part on the monitored performance measurement, an approximate amount of the I/O throughput handled by the first type of storage device over a period of time, (3) determining, based at least in part on the approximate amount of I/O throughput, a rate at which the application is allowed to deliver subsequent I/O throughput to the hybrid storage system over a subsequent period of time, and then (4) regulating, based at least in part on the rate, the subsequent I/O throughput in connection with the application over the subsequent period of time. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for Quality of Service (QoS) for internal input/output (I/O) using an internal flow mechanism in a storage system is provided. The method includes establishing internal I/O flows corresponding to external I/O flows for one or more computing machines or virtual machines implemented with physical computing resources requesting I/Os. The method includes inheriting service-level agreement (SLA) values from the external I/O flows to the internal I/O flows and determining demands for the external I/O flows and the internal I/O flows. The method includes distributing credits to the internal I/O flows and the external I/O flows according to minimum I/O operations per unit time values, based on the service-level agreement values, and distributing remaining credits to the external I/O flows and the internal I/O flows according to priority and demand of each of the external I/O flows and the internal I/O flows.

Abstract: The disclosed computer-implemented method for allocating input/output bandwidth in storage systems may include (1) allocating, in accordance with a pre-defined service-level agreement, an assigned amount of input/output bandwidth to an application that performs actions on a storage system, (2) receiving a request from the application to perform an input/output operation on the storage system, (3) identifying an amount of latency associated with fulfilling the input/output operation, (4) calculating, based at least in part on the amount of latency associated with fulfilling the input/output operation, an amount of input/output bandwidth consumed by the input/output operation, (5) deducting the amount of input/output bandwidth consumed by the input/output operation from the assigned amount of input/output bandwidth allocated to the application, and (6) allocating bandwidth to future input/output requests from the application from the remaining amount of input/output bandwidth allocated to the application.

Abstract: A multi-subscriber identification module (MSIM) wireless communication device may have at least a first SIM and a second SIM associated with a shared radio frequency (RF) resource. The wireless communication device may detect that the first SIM is set as a designated data subscription (DDS), such that a modem stack associated with the first SIM receives information broadcast by a first network. The wireless communication device may perform a network attach procedure with a second network on a modem stack associated with the second SIM, such that a default packet data network (PDN) connection is established with the second network. The wireless communication device may set the default PDN connection as a persistent PDN connection, with the modem stack associated with the second SIM maintaining at least one persistent PDN connection.

Abstract: A computer-implemented method for enabling replication targets to reclaim unused storage space on thin-provisioned storage systems may include: 1) replicating data from a replication source to a replication target, 2) identifying unused storage space within the replicated data, 3) generating a reclamation request for reclaiming the unused storage space from a thin-provisioned storage system that provides thin-provisioned storage for the replication target, and then 4) issuing the reclamation request to the thin-provisioned storage system in order to reclaim the unused storage space from the thin-provisioned storage system. Various other related systems, methods, and configured computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for allocating input/output bandwidth in storage systems may include (1) allocating, in accordance with a pre-defined service-level agreement, an assigned amount of input/output bandwidth to an application that performs actions on a storage system, (2) receiving a request from the application to perform an input/output operation on the storage system, (3) identifying an amount of latency associated with fulfilling the input/output operation, (4) calculating, based at least in part on the amount of latency associated with fulfilling the input/output operation, an amount of input/output bandwidth consumed by the input/output operation, (5) deducting the amount of input/output bandwidth consumed by the input/output operation from the assigned amount of input/output bandwidth allocated to the application, and (6) allocating bandwidth to future input/output requests from the application from the remaining amount of input/output bandwidth allocated to the application.

Abstract: A method for flushing data in a virtual computing environment is provided. The method includes writing application output from an application spanning one or more virtual machines to a cache, wherein each virtual machine is implemented using one or more compute nodes and the cache is implemented in storage associated with the one or more compute nodes. In an effort to flush data associated with application writes more efficiently from the cache to a local backing store or one or more data nodes, the method may include generating a mapping of each of the plurality of application writes. The method may further include sorting sets of one or more virtual disks based upon an offset of each application write as indicated in the mapping. In addition, a storage virtualizer may cancel duplicate application writes, merge multiple contiguous application writes, and merge multiple epochs prior to flushing the data.

Abstract: An exemplary method for efficiently backing up data in thin-provisioned environments may include: 1) identifying a volume to be backed up, 2) identifying a thin-provisioned storage system that contains storage space allocated to the volume, 3) obtaining information from the thin-provisioned storage system that identifies portions of the volume for which storage space has been allocated on the thin-provisioned storage system, and then 4) creating a backup of the volume by invoking read operations only for those portions of the volume for which storage space has been allocated on the thin-provisioned storage system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computer-implemented method for end-to-end quality of service control in distributed systems may include (1) identifying a plurality of computing systems, wherein each computing system (a) is coupled to a storage resource for the computing system, (b) hosts a plurality of applications that share the storage resource coupled to the computing system, (c) hosts a quality of service agent that limits throughput utilization of the storage resource by each of the plurality of applications, and (d) copies input/output data generated by the applications to a secondary computing system, (2) determining a throughput capacity of the secondary computing system, and (3) providing feedback to at least one quality of service agent hosted by at least one computing system to further limit throughput utilization of at least one of a plurality of applications hosted by the computing system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for storing data in a storage system. In one embodiment, implementation of a method for storing data in compliance with a compression handling instruction includes: at a storage controller, receiving an object for storage within a data storage, wherein the object is in an original state; determining whether a compression handling instruction is received in association with the object; and executing the compression handling instruction when storing the object.

Abstract: A system and method for minimizing duplicate data transfer in a clustered storage system, having compute nodes in a compute plane coupled to data nodes in a data plane is provided. The method may include generating a hash key relating to content of a virtual disk associated with a compute node. During a data replication phase, the method may detect duplicate data stored in respective storage units of the compute node and the data node using the hash key. Further, the method may eliminate redundant data transfers through the use of an index and mapping scheme, where only non-duplicate data is transferred along with a set of logical block addresses associated with duplicate data from the replicating compute node to the data node. During a data recovery phase, the method may transfer duplicate data from a peer compute node or from a virtual machine to the requesting compute node, eliminating excess data transfer.

Abstract: A method of storing data in a storage system is provided. The method includes writing data, from a virtual machine in a compute node, to a primary storage coupled to the virtual machine and sending a first copy of the data from the compute node to a data node. The method includes writing the first copy of the data from the compute node to an intermediate storage coupled as direct attached storage to the data node, and writing a second copy of data from the intermediate storage to a secondary storage, wherein at least one method operation is performed by a processor. A storage system is also provided.