Abstract: Intelligent snapshot tiering facilitates efficient management of snapshots and efficient restore of snapshots. For intelligent snapshot tiering, a storage appliance can limit cross-tier migration to invalidated data blocks of a snapshot instead of an entire snapshot. Based on a policy, a storage appliance can identify a snapshot to be migrated to another storage tier and then determine which data blocks are invalidated by an immediately succeeding snapshot. This would limit network bandwidth consumption to the invalidated data blocks and maintain the valid data blocks at the faster access storage tier since the more recent snapshots are more likely to be restored.

Abstract: A storage appliance can be designed to facilitate efficient restore of multiple backed up files in a system that allows files to share data blocks. A data management application or storage OS names data blocks and communicates those names to the storage appliance when backing up to or through the storage appliance. The storage appliance can leverage the data block names when restoring a group of files by restoring at data block granularity instead of file granularity. Restoring at the granularity of the data blocks by their names allows the storage appliance to avoid repeatedly sending a same data block to the restore requestor (e.g., a storage OS or data management application) while still instructing the restore requestor how to reconstruct the corresponding file(s) with mappings between valid data ranges and the named data blocks.

Abstract: A computer-implemented system is disclosed for producing a design for a rotating machine assembly. It comprises a data module (10) configured for receiving data relating to one or more components of the rotating machine assembly; a user interface module (20 configured for specifying data to be received by the data module and for receiving from a user a type of analysis to be performed on the data; and an analysis module (30) configured for analysing a performance of the rotating machine assembly according to the type of analysis selected and selected features of the data to be used. It further includes a recognition module (40) configured for identifying and selected features of the data be used for the analysis according to the type of analysis selected.

Abstract: A method for designing a gearset meeting one or more design targets is described. In particular, the design target is efficiency. Initially, a size and ratio of the gear set is specified. Gear friction coefficients are then calculated, and a value for a design target for the gear set is calculated. One or more of the macro-geometry parameters are modified, and the macro-geometry parameters are chosen such that the advantageous effects of one macro-geometry parameter on the design target counteract any disadvantageous effects of another macro-geometry parameter. In this way, a design for a gearset meeting the one or more design targets is produced. The efficiency calculation includes the effect of a lubricant. Further design targets can include gear noise and gear durability.

Abstract: A storage appliance arranges snapshot data and snapshot metadata into different structures, and arranges the snapshot metadata to facilitate efficient snapshot manipulation, which may be for snapshot management or snapshot restore. The storage appliance receives snapshots according to a forever incremental configuration and arranges snapshot metadata into different types of records. The storage appliance stores these records in key-value stores maintained for each defined data collection (e.g., volume). The storage appliance arranges the snapshot metadata into records for inode information, records for directory information, and records that map source descriptors of data blocks to snapshot file descriptors. The storage appliance uses a locally generated snapshot identifier as a key prefix for the records to conform to a sort constrain of the key-value store, which allows the efficiency of the key-value store to be leveraged.

Abstract: With a forever incremental snapshot configuration and a typical caching policy (e.g., least recently used), a storage appliance may evict stable data blocks of an older snapshot, perhaps unchanged data blocks of the snapshot baseline. If stable data blocks have been evicted, restore of a recent snapshot will suffer the time penalty of downloading the stable blocks for restoring the recent snapshot. Creating synthetic baseline snapshots and refreshing eviction data of stable data blocks can avoid eviction of stable data blocks and reduce the risk of violating a recovery time objective.

Abstract: A method for designing a planetary gearset meeting one or more design targets is described. Initially, a size and ratio of the planetary gear set, and the number of planet gears for the planetary gearset is specified. All valid combinations of tooth numbers and planet numbers that satisfy one or more constraints are then calculated. From these, a starting combination is selected and a value for a design target for the gear set is calculated. One or more of the macro-geometry parameters are modified, and the macrogeometry parameters are chosen such that the positive effects of one macrogeometry parameter on the design target counteract any negative effects of another macrogeometry parameter. In this way, a design for planetary gearset meeting the one or more design targets is produced. Also disclosed is a method additionally calculating a sideband distribution resulting from the selected combination.

Abstract: Exemplary embodiments relate to cache replacement schemes. Incoming data may be sorted into buckets. When it comes time to replace information in the cache, an entire bucket may be eliminated or replaced at once. By sorting incoming data into the buckets and performing cache replacement on a bucket-by-bucket basis, cache fragmentation is reduced. Moreover, the buckets may be scored based on characteristics of the data in the buckets (e.g., whether a data item is cold archived, whether a customer has pinned the data item, or whether the customer has requested early eviction of the data item). By accounting for these metrics when the cache score is calculated, cache usage and hit rates may be improved. According to exemplary embodiments, scoring may be applied to entire buckets, or may be applied to individual cache items (e.g., for use as a cache replacement metric in a cache eviction scheme).

Abstract: Exemplary embodiments relate to cache replacement schemes. Incoming data may be sorted into buckets. When it comes time to replace information in the cache, an entire bucket may be eliminated or replaced at once. By sorting incoming data into the buckets and performing cache replacement on a bucket-by-bucket basis, cache fragmentation is reduced. Moreover, the buckets may be scored based on characteristics of the data in the buckets (e.g., whether a data item is cold archived, whether a customer has pinned the data item, or whether the customer has requested early eviction of the data item). By accounting for these metrics when the cache score is calculated, cache usage and hit rates may be improved. According to exemplary embodiments, scoring may be applied to entire buckets, or may be applied to individual cache items (e.g., for use as a cache replacement metric in a cache eviction scheme).

Abstract: A remote data storage system for providing one or more mobile devices with a remote data store. The system may include a cloud platform with a storage management application and a data store. A mobile storage application may operate on a mobile device to enable the mobile device to interact with the storage management application. The storage management application may condition data for exchange between the mobile device and the data store. The conditioning of data may include the replacement of duplicate data subsets with references to equivalent data subsets. Other embodiments are described and claimed.

Abstract: Exemplary embodiments address the problem of disk fragmentation by using the heuristics of write operations to assign block sizes. As write requests are received, a storage system may register a size of the write request. Using the registered sizes, the storage system may identify one or more clusters of sizes at which write requests are particularly prevalent. The storage system may calculate a distribution or variance for block sizes centered on each cluster. The distribution or variance may be used to distribute the block sizes such that the block sizes change by a small amount in the vicinity of the cluster, and by a larger amount as the blocks move away from the center of the cluster. When it comes time to allocate new blocks, the clusters and distribution may be consulted to determine what sizes of blocks to allocate, and how many blocks of each size.

Abstract: Methods, systems, and apparatus, including computer program products, for ranking news articles. A plurality of news articles referenced in one or more hub pages are identified, where each of the hub pages include respective references to one or more of the news articles. A score component is derived for a news article from a measure of a prominence of the news article in the hub pages that includes a reference to the news article.

Abstract: Methods, systems, and apparatus, including computer program products, for ranking news articles. A plurality of news articles referenced in one or more hub pages are identified, where each of the hub pages include respective references to one or more of the news articles. A score component is derived for a news article from a measure of a prominence of the news article in the hub pages that includes a reference to the news article.

Abstract: Methods, systems, and apparatus, including computer program products, for ranking news articles. A plurality of news articles referenced in one or more hub pages are identified, where each of the hub pages include respective references to one or more of the news articles. A score component is derived for a news article from a measure of a prominence of the news article in the hub pages that includes a reference to the news article.

Abstract: Methods, systems, and apparatus, including computer program products, for ranking news articles. A plurality of news articles referenced in one or more hub pages are identified, where each of the hub pages include respective references to one or more of the news articles. A score component is derived for a news article from a measure of a prominence of the news article in the hub pages that includes a reference to the news article.

Abstract: Methods, systems, and apparatus, including computer program products, for scoring documents. A plurality of documents with an initial ordering is received. Local term relationships between terms in the plurality of documents are identified, each local term relationship being a relationship between a pair of terms in a respective document. Relationships among the documents in the plurality of documents are determined based on the local term relationships and on the initial order of the documents. A respective score is determined for each document in the plurality of documents based on the document relationships.

Abstract: Methods, systems, and apparatus, including computer program products, for scoring documents. A plurality of documents with an initial ordering is received. Local term relationships between terms in the plurality of documents are identified, each local term relationship being a relationship between a pair of terms in a respective document. Relationships among the documents in the plurality of documents are determined based on the local term relationships and on the initial order of the documents. A respective score is determined for each document in the plurality of documents based on the document relationships.