Abstract: The present invention provides for a system and a method for optimized predictive risk assessment of software development lifecycle of projects. The present invention provides for fetching an unstructured attribute dataset and grouping the unstructured attribute dataset based on derived Knowledge Performance Indicator (KPI) scores. The present invention provides for converting the unstructured attribute dataset into a structured attribute dataset by applying pre-defined rules, where each attribute data of the structured attribute dataset is mapped to pre-determined categorical values. The present invention provides for correlating a derived attribute data from the structured attribute dataset with a defined attribute data to derive an accuracy percentage. The present invention provides for combining the KPI scores, the accuracy percentage and the spillover risk values and the defect density values for risk assessment in the software development lifecycle of projects to generate indicators of risks.

Abstract: Techniques for generating a crash-consistent clone of file(s) stored by a distributed file system are described herein. To generate the crash-consistent clone, a coordinator node may identify multiple nodes (e.g., at least a first node and a second node) of the distributed file system that are storing different portions of data of the file. The coordinator node may then send a first command to the multiple nodes to cause each of the multiple nodes to quiesce the file and clone the different portions of the data to generate the crash-consistent clone of the file. The coordinator node may then receive, from the multiple nodes, a status associated with generating the crash-consistent clone of the file. Based at least in part on the status, the coordinator node may send a second command to the multiple nodes to cause each of the multiple nodes to unquiesce the file.

Abstract: Systems, methods, and computer-readable media are provided for utilizing distributed erasure encoding in a redundant array of independent disks (RAID) system. An example method can include generating a plurality of virtual redundant array of independent disk (vRAID) stripes, each of the plurality of vRAID stripes including a segment having a plurality of data, each of the plurality of data including metadata, the metadata including a checksum of a corresponding data of the plurality of data, distributing the segment of each of the plurality of vRAID stripes over a plurality of virtual nodes, mapping at least one of logical files, volumes, or objects to the plurality of data chunks and the at least one parity chunk of the plurality of vRAID stripes to avoid write-hole issues, and verifying data integrity of the corresponding data of the plurality of data using the checksum of the corresponding data.

Abstract: Systems, methods, and computer-readable media are provided for utilizing distributed erasure encoding in a redundant array of independent disks (RAID) system. An example method can include generating a plurality of virtual redundant array of independent disk (vRAID) stripes, each of the plurality of vRAID stripes including a segment having a plurality of data, each of the plurality of data including metadata, the metadata including a checksum of a corresponding data of the plurality of data, distributing the segment of each of the plurality of vRAID stripes over a plurality of virtual nodes, mapping at least one of logical files, volumes, or objects to the plurality of data chunks and the at least one parity chunk of the plurality of vRAID stripes to avoid write-hole issues, and verifying data integrity of the corresponding data of the plurality of data using the checksum of the corresponding data.

Abstract: Techniques for generating a crash-consistent clone of file(s) stored by a distributed file system are described herein. To generate the crash-consistent clone, a coordinator node may identify multiple nodes (e.g., at least a first node and a second node) of the distributed file system that are storing different portions of data of the file. The coordinator node may then send a first command to the multiple nodes to cause each of the multiple nodes to quiesce the file and clone the different portions of the data to generate the crash-consistent clone of the file. The coordinator node may then receive, from the multiple nodes, a status associated with generating the crash-consistent clone of the file. Based at least in part on the status, the coordinator node may send a second command to the multiple nodes to cause each of the multiple nodes to unquiesce the file.

Abstract: In one embodiment, a device performs a plurality of iterations of write operations on portions of a file tree of a file system to a first storage cluster, each write operation flagging the written portion of the file tree with a generation identifier indicative of the associated iteration of the write operations. The device identifies a set of the written portions of the file tree as unsynchronized between the first storage cluster and a second storage cluster by performing a search for changes made to the written portions of the file tree between a generation identifier associated with the first storage cluster and a generation identifier associated with the second storage cluster. The device synchronizes the first and second storage clusters by sending, via a network, the unsynchronized portions of the file tree from the first storage cluster to the second storage cluster.

Abstract: In one embodiment, a device performs a plurality of iterations of write operations on portions of a file tree of a file system to a first storage cluster, each write operation flagging the written portion of the file tree with a generation identifier indicative of the associated iteration of the write operations. The device identifies a set of the written portions of the file tree as unsynchronized between the first storage cluster and a second storage cluster by performing a search for changes made to the written portions of the file tree between a generation identifier associated with the first storage cluster and a generation identifier associated with the second storage cluster. The device synchronizes the first and second storage clusters by sending, via a network, the unsynchronized portions of the file tree from the first storage cluster to the second storage cluster.

Abstract: Aspects of the subject technology relate to a system configured to receive a request for data associated with a key, identify the key in a first pre-filter in a set of cascading pre-filters for the cache memory, wherein the set of cascading pre-filters is arranged in an order, and store, in response to the key being in the first pre-filter, the key in a second pre-filter in the set of cascading pre-filters, wherein the second pre-filter is next in the order after the first pre-filter.

Abstract: Aspects of the subject technology relate to a system configured to receive a request for data associated with a key, identify the key in a first pre-filter in a set of cascading pre-filters for the cache memory, wherein the set of cascading pre-filters is arranged in an order, and store, in response to the key being in the first pre-filter, the key in a second pre-filter in the set of cascading pre-filters, wherein the second pre-filter is next in the order after the first pre-filter.

Abstract: Embodiments relate to management of hybrid workloads in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.

Abstract: Creating and using highly available transaction logs in a distributed storage system is described, where the storage controller functions of the distributed storage system are separated from that of distributed storage system storage media. In an exemplary embodiment, a storage controller server receives a transaction entry at a first storage pool of the distributed storage system. The storage controller server further looks up a transaction log to store the transaction entry, where the transaction log is associated with a second storage pool. The storage controller server routes the transaction entry to the second storage pool, wherein the second storage pool stores the transaction entry.

Abstract: A distributed storage system called StorFS that performs distributed data deduplication is described. In an exemplary embodiment, a storage controller server determines if there is duplicative data in a distributed storage system. In this embodiment, the storage controller server determines if an entity is duplicated in the distributed storage system in line with an incoming input/output operation. The storage controller server determines if the entity is duplicated in the distributed storage system by receiving the entity and looking up the entity in a data deduplication table. If the entity exists in the data deduplication table, the storage controller server updates the metadata for the entity to point to the duplicate entity.

Abstract: Embodiments relate to management of hybrid workloads in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.

Abstract: Embodiments relate to management of hybrid workloads, including serial and parallel workload optimizations, in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.

Abstract: A distributed storage system that dispatches an input/output request is described. In an exemplary embodiment, a storage controller client receives the input/output request, wherein the distributed storage system includes the storage controller client, a plurality of storage controller servers, a plurality of virtual nodes distributed among a plurality of physical nodes, and each of the plurality of physical nodes is hosted on one of the plurality of storage controller servers. The storage controller client further computes a target virtual node for the input/output request, where the target virtual node is one of the plurality of virtual nodes. Using the computed target virtual node, the storage controller client determines a target physical node that corresponds to the target virtual node, where the target physical node is one of the plurality of physical nodes.

Abstract: Embodiments of the present invention provide approaches (e.g., online methods) to analyze end-to-end performance issues in a multi-tier enterprise storage system (ESS), such as a storage cloud, where data may be distributed across multiple storage components. Specifically, performance and configuration data from different storage components (e.g., nodes) is collected and analyzed to identify nodes that are becoming (or may become) performance bottlenecks. In a typical embodiment, a set of components distributed among a set of tiers of an ESS is identified. For each component, a total capacity and a current load are determined. Based on these values, a utilization of each component is determined. Comparison of the utilization with a predetermined threshold and/or analysis of historical data allows one or more components causing a bottleneck to be identified.

Abstract: An approach for managing and optimizing available resources utilized in a networked computing environment (e.g., a cloud computing environment) is provided. In one aspect, a plurality of resources in a plurality of storage pools within the networked computing environment are monitored. Each storage pool is running at least one application workload using a corresponding subset of the plurality of resources. The storage pools are ranked based on the application workloads. In response to an over-utilized storage pool and/or an under-utilized storage pool, the plurality of resources are dynamically reconfigured.

Abstract: A distributed snapshot in a distributed storage system is described, where the storage controller functions of the distributed storage system are separated from that of distributed storage system storage media. In an exemplary embodiment, a storage controller server receives a request to create the snapshot in the distributed storage system, where the distributed storage system includes a plurality of virtual nodes and a plurality of physical nodes, and the source object includes a plurality of stripes. The storage controller server further determines a set of virtual nodes from the plurality of virtual nodes, where each of the set of virtual nodes owns one of the plurality of stripes of the source object. For each of the set of virtual nodes, the storage controller server sends a clone request to that virtual node, where the request is to create a snapshot for the stripe hosted by that virtual node.

Abstract: Embodiments relate to management of hybrid workloads, including serial and parallel workload optimizations, in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.

Abstract: Embodiments of the invention relate to management of hybrid workloads, including serial and parallel workload optimizations, in a shared pool of configurable computer resources. Resource utilization in the shared pool is dynamically tracked, and employed for assessing a set of servers a parallel access protocol should utilize for one or more I/O requests in conjunction with any serial workload optimizations. Accordingly, the load balancing embodies a diverse set of workloads to support dynamic and equitable allocation.