American Megatrends, Inc.

Other

Avaz, Inc.

Ajit Narayanan

Paresh Chatterjee

Vijayarankan Muthirisavenugopal

Anandh Mahalingam

Narayanan Balakrishnan

Sharon Enoch

Loganathan Ranganathan

Srikumar Subramanian

Suresh Grandhi

Raja Jayaraman

Narayanaswami Ganapathy

Jomy Jose Maliakal

Sharon Samuel Enoch

Vijayarankan Muthirisavengopal

Systems and methods for computer-aided education include providing at least a part of a pedagogical exercise to a user to obtain a user response to the at least the part of the pedagogical exercise from the user, and also providing at least the part of the pedagogical exercise to a computer program. One or more learning elements corresponding to the at least the part of the pedagogical exercise are generated based, at least in part on the execution of the at least the part of the pedagogical exercise by the computer program. The user's abilities are analyzed with respect to the one or more learning elements based on the user response, and aspects of the learning elements such as a learned-state, not-learned state, probabilities for transition between the states, retention time, etc., are used in quantitatively education of the user.

Quantitative education system

The embodiments herein achieve a picture based communication system. The system allows users option to select one or more pictures, and any associated attributes. The selection of one or more pictures, and any associated attributes is taken as input. The selected words and attributes are converted to a graph representation, and subsequently the graph representation is converted to a sentence in target language. The method further involves predicting new relations, words, and attributes for further selection by user.

Device and computerized method for picture based communication

Methods and systems for identifying candidates for de-duplication are disclosed herein. An example system may include: a de-duplication lister that coordinates with a kernel module to identify a unit of data for de-duplication and calculates a signature of the unit of data; a de-duplication queue that manages a de-duplication queue; a de-duplication tracker that maintains a de-duplication data structure including a plurality of entries corresponding to units of data and searches the de-duplication data structure to determine whether the signature of the identified unit of data matches the signature of at least one of the entries in the de-duplication data structure; a de-duplication maintainer that reviews the entries of the de-duplication data structure and removes obsolete entries from the de-duplication data structure; and a de-duplication engine that coordinates with the kernel module to perform de-duplication operations on the de-duplication queue.

Data de-duplication for information storage systems

Technologies are described for implementing a migration mechanism in a storage system containing multiple tiers of storage with each tier having different cost and performance parameters. Access statistics can be collected for each territory, or storage entity, within the storage system. Data that is accessed more frequently can be migrated toward higher performance storage tiers while data that is accessed less frequently can be migrated towards lower performance storage tiers. The placement of data may be governed first by the promotion of territories with higher access frequency to higher tiers. Secondly, data migration may be governed by demoting territories to lower tiers to create room for the promotion of more eligible territories from the next lower tier. In instances where space is not available on the next lower tier, further demotion may take place to an even lower tier in order to make space for the first demotion.

Data migration between multiple tiers in a storage system using age and frequency statistics

Technologies are described herein for providing networked RAID in a virtualized storage cluster. The storage capacity of a storage cluster having two or more storage nodes is organized into tiers. A portion of the available storage capacity is allocated to one tier that is organized using chained declustering. Another portion of the available storage capacity is allocated to another tier that is organized using a networked RAID configuration. The storage cluster monitors the frequency at which data in the storage cluster is accessed. Frequently used data that is stored in the network RAID-configured tier is promoted to the chained declustered-configured tier. Infrequently used data that is stored in the chained declustered-configured tier is demoted to the network RAID-configured tier.

Networked raid in a virtualized cluster

Technologies are described for implementing a migration mechanism in a data storage system containing multiple tiers of storage with each tier having different cost and performance parameters. Access statistics can be collected for each territory, or storage entity, within the storage system. Data that is accessed more frequently can be migrated toward higher performance storage tiers while data that is accessed less frequently can be migrated towards lower performance storage tiers. Each tier can be associated with a range of ILM statistics referred to as the bucket for that tier. A pivot table may be provided that relates the tiers and the buckets. Operations on the pivot table can provide counts of how many territories may be promoted or demoted between any two pairs of tiers.

Data migration between multiple tiers in a storage system using pivot tables

Technologies for eliminating duplicate data provisions within a storage system supporting boot consolidation can efficiently identify duplicate data provisions within a data storage system and eliminate duplication by remapping duplicate provisions to point to the same physical storage space. Signatures of provisions within a storage system may be calculated and compared. Matching, or collisions, within the list of provision signatures can indicate candidate provisions for de-duplication. De-duplication territories may be provided as an indirect mapping mechanism in support of the remapping of duplicated provisions. Access statistics associated with provisions within a storage system may be collected. Access statistics can support the scheduling of de-duplication processes. Data de-duplication can support substantial storage space consolidation and significantly improve caching efficiency within a data storage system.

Eliminating duplicate data in storage systems with boot consolidation

Technologies are described herein for providing file-level CDP of files stored on a remote storage system. A client module executing on a client computer monitors for modifications made at the client computer to files or folders stored on a virtual storage volume provided by the remote storage system. Upon detecting a modification of a monitored file, the client module sends a message to the remote storage system identifying the file. A server module executing in the remote storage system receives the message identifying the modified file and copies a version of the file containing the modification from the virtual storage volume to a backup volume located in the remote storage system.

Continuous data protection of files stored on a remote storage device

A system, method, apparatus, and computer-readable medium are described for providing redundancy in a storage system. According to one method, maps are generated and stored that define stripe patterns for storing data on the storage nodes of a storage cluster. The maps are defined such that when a new storage node is added to the cluster, no movement of data occurs between two storage nodes that existed in the cluster prior to the addition of the new storage node during re-striping, and such that the data stored on each storage node is mirrored on another storage node. Storage nodes may also be designated as an owner or a peer for each storage zone. Input/output operations received at an owner node are fielded directly and mirrored to the peer node, while input/output operations received at a peer node are redirected to the owner node for processing.

Providing redundancy in a storage system

Techniques for maintaining mirrored storage cluster data consistency can employ write-intent logging. The techniques can be scaled to any number of mirror nodes. The techniques can keep track of any outstanding I/Os, data in caches, and data that has gone out of sync between mirrored nodes due to link failures. The techniques can ensure that a power failure on any of the storage nodes does not result in inconsistent data among the storage nodes. The techniques may keep track of outstanding I/Os using a minimal memory foot-print and having a negligible impact on the I/O performance. Properly choosing the granularity of the system for tracking outstanding I/Os can result in a minimal amount of data requiring transfer to synchronize the mirror nodes. The capability to vary the granularity based on physical and logical parameters of the storage volumes may provide performance benefits.

Maintaining data consistency in mirrored cluster storage systems using bitmap write-intent logging

A method, system, apparatus, and computer-readable medium are described for providing distributed hot-spare storage in a redundant storage cluster. According to one method, a portion of the unutilized space on the storage cluster is utilized as a distributed hot-spare storage node. Through this mechanism, a redundant storage cluster with N storage nodes may be contracted to a redundant array with N&#x2212;1 nodes. Thin provisioning and intelligent data placement may also be utilized to implement the distributed hot-spare storage node. Through repeated application of such methods and systems, the failure of any storage node or the sequential failure of multiple storage nodes within a redundant storage cluster results in the recreation of the cluster as a redundant storage array with one fewer node, but with the same redundancy.

Distributed hot-spare storage in a storage cluster

Technologies are described herein for providing networked RAID in a virtualized storage cluster. The storage capacity of a storage cluster having two or more storage nodes is organized into tiers. A portion of the available storage capacity is allocated to one tier that is organized using chained declustering. Another portion of the available storage capacity is allocated to another tier that is organized using a networked RAID configuration. The storage cluster monitors the frequency at which data in the storage cluster is accessed. Frequently used data that is stored in the network RAID-configured tier is promoted to the chained declustered-configured tier. Infrequently used data that is stored in the chained declustered-configured tier is demoted to the network RAID-configured tier. The zone size for zones stored in the chained declustered-configured tier may be different than for zones stored in the network RAID-configured tier.

Technologies are provided for integrating a caching module into a data storage system architecture. A request to perform an I/O operation is received at the caching module from an initiator. The caching module provides a notification to a storage driver that the request will be delivered to the storage driver in the future. The storage driver then determines whether the request can be satisfied. If the storage driver determines that it will be able to satisfy the I/O request, the storage driver can optimize the allocation and placement of the I/O request before receiving the actual I/O request. When the caching module subsequently sends the actual I/O request to the storage driver, the storage driver utilizes the previously allocated space and optimized placement to perform the requested I/O operation.

Growing community of inventors

Fremont, CA, United States of America

Ajit Narayanan