Patent application number | Description | Published |
20090204765 | DATA BLOCK FREQUENCY MAP DEPENDENT CACHING - A method for increasing the performance and utilization of cache memory by combining the data block frequency map generated by data de-duplication mechanism and page prefetching and eviction algorithms like Least Recently Used (LRU) policy. The data block frequency map provides weight directly proportional to the frequency count of the block in the dataset. This weight is used to influence the caching algorithms like LRU. Data blocks that have lesser frequency count in the dataset are evicted before those with higher frequencies, even though they may not have been the topmost blocks for page eviction by caching algorithms. The method effectively combines the weight of the block in the frequency map and its eviction status by caching algorithms like LRU to get an improved performance and utilization of the cache memory. | 08-13-2009 |
20110258378 | Optimizing a File System for Different Types of Applications in a Compute Cluster Using Dynamic Block Size Granularity - Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster. | 10-20-2011 |
20120137094 | SNAPSHOT BASED REPLICATION - Embodiments of the invention relate to data replication and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation. Blocks in the defined regions are allocated to support the data replication. A pipeline manager is provided to schedule population of the blocks in the allocated region(s) based upon network characteristics. | 05-31-2012 |
20120198269 | METHOD AND APPARATUS FOR APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 08-02-2012 |
20120284472 | SNAPSHOT BASED REPLICATION - Embodiments of the invention relate to data replication and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation. Blocks in the defined regions are allocated to support the data replication. A pipeline manager is provided to schedule population of the blocks in the allocated region(s) based upon network characteristics. | 11-08-2012 |
20120284558 | APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 11-08-2012 |
20130138615 | SYNCHRONIZING UPDATES ACROSS CLUSTER FILESYSTEMS - Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point. | 05-30-2013 |
20130138616 | SYNCHRONIZING UPDATES ACROSS CLUSTER FILESYSTEMS - Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point. | 05-30-2013 |
20130227379 | EFFICIENT CHECKSUMS FOR SHARED NOTHING CLUSTERED FILESYSTEMS - Embodiments of the invention relate to efficiently employing checksums for shared nothing clustered filesystems. Tools are provided to compute the checksum in response to a read transaction and to utilize the computed checksum to prevent serving corrupted data. Multiple levels of data replication are provided. The checksum computation functions within the multiple levels and addresses a specified data block that is the subject of the read transaction. | 08-29-2013 |
20140122823 | GENERALIZED STORAGE ALLOCATION FOR MULTIPLE ARCHITECTURES - Embodiments of the invention relate to storage allocation in a storage system. One embodiment includes generating a request for storage space allocation in a particular storage device by a first node. An owner node associated with the particular storage device is determined by a first allocation client associated with the first node. The request is sent by the first allocation client to a second allocation client associated with the owner node. A storage device allocation region of the particular storage device is created, the allocation region comprising a height proportional to storage devices the owner node and the second allocation client are coupled with, and a width that is inversely proportional to a number of nodes sharing the particular storage device. | 05-01-2014 |
20140173185 | Write Performance in Fault-Tolerant Clustered Storage Systems - Embodiments of the invention relate to supporting transaction data committed to a stable storage. Committed data in the cluster is stored in the persistent cache layer and replicated and stored in the cache layer of one or more secondary nodes. One copy is designated as a master copy and all other copies are designated as replica, with an exclusive write lock assigned to the master and a shared write lock extended to the replica. An acknowledgement of receiving the data is communicated following confirmation that the data has been replicated to each node designated to receive the replica. Managers and a director are provided to support management of the master copy and the replicas within the file system, including invalidation of replicas, fault tolerance associated with failure of a node holding a master copy, recovery from a failed node, recovered of the file system from a power failure, and transferring master and replica copies within the file system. | 06-19-2014 |
20140173199 | Enhancing Analytics Performance Using Distributed Multi-Tiering - Embodiments of the invention relate to cluster-centric tiered storage with a flexible tier definition to support performance of transactions. Object data is distributed in a multi-tiered shared-nothing cluster. Hierarchical tiers of data storage are assigned different roles within the hierarchy. The tiers are managed globally across the cluster and objects are placed in tiers according to a flexible tier definition. The probability of object access is computed for objects, and objects are moved to different tiers responsive to the computation to minimize system runtime. The location of an object is further optimized in response to an access request. | 06-19-2014 |
20140173326 | Write Performance in Fault-Tolerant Clustered Storage Systems - Embodiments of the invention relate to supporting transaction data committed to a stable storage. Committed data in the cluster is stored in the persistent cache layer and replicated and stored in the cache layer of one or more secondary nodes. One copy is designated as a master copy and all other copies are designated as replica, with an exclusive write lock assigned to the master and a shared write lock extended to the replica. An acknowledgement of receiving the data is communicated following confirmation that the data has been replicated to each node designated to receive the replica. Managers and a director are provided to support management of the master copy and the replicas within the file system, including invalidation of replicas, fault tolerance associated with failure of a node holding a master copy, recovery from a failed node, recovered of the file system from a power failure, and transferring master and replica copies within the file system. | 06-19-2014 |