Abstract: Systems and methods for managing data structures in a flash memory. A library is provided that supports read requests and write requests. The library allows reads and writes to be implemented without requiring the client to understand how the data structure is implemented in the flash memory.

Abstract: A method, computer program product, and computer system for receiving, by a computing device, a write I/O to a storage device array coupled to a cache, wherein the write I/O may be received from a host. A cache miss in the cache may be determined for the write I/O. One or more free pages may be allocated at an address in the cache to store data for the write I/O. The address in the cache to store the data may be sent to a hostside portion of a software stack in the storage device array. The data may be written directly from the hostside portion to the cache at the address.

Abstract: Data recovery is enabled using techniques described herein. A system can include data storage devices configured in a plurality of logical configurations, wherein the logical configurations are respectively associated with respective groups of the data storage devices, and wherein the respective groups of the data storage devices are structured such that at least a first one of the respective groups of the data storage devices comprises a different number of data storage devices than a second one of the respective groups of the data storage devices; and respective parity storage devices communicatively coupled to the data storage devices, wherein respective ones of the groups of the data storage devices are associated with respective ones of the parity storage devices.

Abstract: The system for backing up data comprises an input interface configured to receive an input set of files. The system for backing up data additionally comprises a processor configured to add modified objects to a list of modified objects in the set of files, and, in the event it is determined to provide the list of modified objects to a backup process, provide the list to the backup process.

Abstract: Embodiments of the present disclosure provide a method and device for storage management. The method comprises receiving at a storage management device a configuration request for a storage space managed by the storage management device, the configuration request indicating a capacity of the storage space and a target size of a chunk in the storage space; and based on the capacity and the target size, dividing the storage space into a metadata region storing a chunk status indicator indicating whether the chunk is assigned with data and a data region including the chunk with the target size. Embodiments of the present disclosure also provide a corresponding device.

Abstract: Systems, methods, and apparatus for authenticating and authorizing clients. A client certificate is used to authenticate and authorize a client (or user). When the client certificate is received, the certificate is authenticated. If the certificate is valid, a username included in the certificate is used to authorize the client. This may be done based on privileges or permissions associated with the user name. Once the client or user is authenticated and authorized, operations requested by the client can be performed as long as permitted by the privileges or permissions.

Abstract: Techniques and mechanisms for establishing and implementing performance objectives for an application based at least in part on a workload type of the application. A system includes a storage system on which an application imposes a workload by utilizing storage resources of the storage system, and a performance level has been associated with the application. A workload type is associated with the application based on the type of workload, and a performance objective is determined for the application based on the performance level and the workload type of the application. The storage resources are manipulated to achieve the performance objective.

Abstract: Backup operations on selected directories are performed in a computing system. File system operations that impact the ability to backup the selected directories are failed while other file system operations are allowed. In particular, file system operations that would require a trawl of the selected directory in order to perform the backup operation are failed.

Abstract: A technique for use in managing mapped RAID extents is disclosed. A neighborhood matrix denoting a distribution of neighboring physical storage portions across the N physical storage devices of the pool is created and initialized. A disk extent consumed array denoting a disk consumption metric is created and initialized. Disks in an extent pool are analyzed to identify a least consumed disk in the extent pool and a disk extent is allocated from the identified disk. The allocated disk extent is configured as a first disk extent for a first RAID extent. The neighborhood matrix and disk extent consumed array are updated appropriately. All the disks in the extent pool are analyzed to identify a valid disk extent that will result in the lowest variance value in the neighborhood matrix. The identified valid disk extent is allocated and the neighborhood matrix and disk extent consumed array are again updated.

Abstract: Methods and apparatus are provided for reporting space savings due to data reduction in storage systems. An exemplary method comprises establishing a leaf pointer for a plurality of allocation units of data in a storage system; for at least a first allocation unit of data matching a second allocation unit of data, replacing the leaf pointer for the first allocation unit with a deduplication pointer to the leaf pointer of the second allocation unit; determining a total number of pointers as a sum of a number of the leaf pointers and a number of the deduplication pointers; determining a difference between the total number of pointers and the number of leaf pointers; and providing a data reduction attributed to deduplication based on the difference. The allocation units of data are optionally also compressed. Data reduction attributed to the compression can optionally be determined independent of the data reduction attributed to the deduplication.

Abstract: An analytics platform is configured to receive a request to execute a distributed analytics workflow specification comprising multiple distributed computations to be performed across a plurality of data processing clusters associated with respective data zones. For each of a plurality of analytic services to be executed in accordance with the distributed analytics workflow specification, the platform determines if execution of the analytic service is authorized for the request, and for each of a plurality of datasets to be operated on by one or more of the analytic services in accordance with the distributed analytics workflow specification, the platform determines if execution of the one or more analytic services on the dataset is authorized by its corresponding data zone for the request.

Abstract: A mechanism for disaster recovery configurations and management in virtual tape applications. Specifically, the introduction of an additional computer process executing at an active datacenter site and at another active (or alternatively, a standby) datacenter site permit: (i) the generation and management of global configurations implemented on the active datacenter site prior to the occurrence of a failover event; and (ii) the implementation of global configurations on the another active (or standby) datacenter site after the occurrence of the failover event.

Abstract: Data storage facilities that provide data storage services frequently perform management tasks (e.g., workflows) on the data files that are being managed. These workflows have a variety of different characteristics and, as such, the data storage facility has an incentive to set different behaviors for different workflows. For example, many types of workflows performing operations on a file, once started, should be executed to completion before another workflow begins performing operations on the file. Thus, a persistent behavior for these workflows is desired such that the workflow can resume to completion after the workflow ceases executing for some reason (e.g., power loss, crash, restart, etc.). However, there is no guarantee that some workflows (e.g., user-initiated workflows) will resume after ceasing execution. For those workflows, a persistent behavior is not desired. A cookie can be employed to provide enhanced management of file workflows such as setting various behavioral parameters.

Abstract: A computing device includes user resources and a validation agent. The validation agent identifies a logical group of a solution architecture to which the computing device belongs. The validation agent obtains a baseline configuration associated with the logical group. The validation agent identifies a dependency of the user resources on second user resources of a second computing device of the logical group. The validation agent makes a determination that an override attribute is associated with the second user resources. The validation agent modifies the obtained baseline configuration using the override attribute. The validation agent initiates a modification of the user resources using the modified obtained baseline configuration.

Abstract: An improved technique involves generating, from historical transaction data, a relational graph that represents connections between users who initiate transactions and transaction devices used to carry out the transactions. By supplementing traditional relational database models with a tool such as a graph database, a risk analysis server is able to express users and transaction devices as nodes in a graph and the connections between them as edges in the graph. The risk analysis server may then match the topology of the graph in a neighborhood of the user initiating the transaction to a known topology that is linked to an indication of risk. In some arrangements, this topology is an input into a risk model used to compute a risk score for adaptive authentication.

Abstract: Techniques for a managing concurrent I/Os in a file system may include receiving a sequence of conflicting I/O lists of write data stored in a cache, the sequence specifying a sequential order in which the I/O lists are to be flushed to a file stored on non-volatile storage; determining a first I/O list of the sequence having a conflict with a second I/O list of the sequence, wherein the conflict between the first I/O list and the second I/O list is a first common block written to by both the first and second I/O lists; and performing first processing that modifies the first I/O list and the second I/O list to remove the conflict.

Abstract: Methods and apparatus are provided for reporting space savings due to pattern matching in storage systems. An exemplary method comprises, when a given allocation unit in a storage system matches one or more predefined patterns, (i) setting a corresponding pattern flag for the given allocation unit, and (ii) incrementing at least one pattern counter; generating at least one snapshot of at least a portion of a file comprising the given allocation unit; and determining a data reduction attributed to pattern matching based on the at least one pattern counter, wherein the one or more predefined patterns in the at least one snapshot are excluded from the data reduction attributed to pattern matching.

Abstract: According to one embodiment, a data processing system includes a plurality of processors, each of the processors being coupled to each of remaining processors via a processor interconnect, a plurality of memory controllers, each memory controller corresponding to one of the processors, a plurality of memory targets, each memory target includes one or more branches and a plurality of memory leaves for storing data, and an Ethernet switch fabric coupled to the memory controllers and the memory targets. When a first of the memory controllers writes data to a first of the memory leaves, the first memory controller sends a cache coherence message to remaining ones of the memory controllers to indicate that the data stored in the first memory leaf has been updated, such that any of the remaining memory controllers can update its cache by fetching the data from the first memory leaf.

Abstract: Split-key based cryptography techniques are provided for data protection and synchronization across multiple computing devices of a user. A method performed by a first device of a user comprises encrypting a data using a randomly-generated data encryption key; wrapping the data encryption key with a public key of a second device of the user; and sending the encrypted data and the wrapped data encryption key of the first device wrapped with the public key of the second device to a server. The server sends the encrypted data and the wrapped data encryption key of the first device wrapped with the public key of the second device to the second device. The first device or the second device can access the encrypted data by reconstructing their respective private key using a predefined number of shares obtained using a key splitting scheme.

Abstract: Techniques to provide secure cloud-based storage of data shared across file system objects and clients are disclosed. In various embodiments, a primary encryption key is determined for an object associated with a plurality of component chunks of file system data. The primary encryption key is used to generate for each of said component chunks a corresponding chunk key, based at least in part on the primary encryption key and data comprising or otherwise associated with the chunk. The respective chunk keys are provided to a file system client configured to create and store the object at least in part by encrypting each chunk included in the plurality of component chunks using the chunk key provided for that chunk to generated encrypted chunk data, and combining the encrypted chunk data to create and store the object.