Patent application number | Description | Published |
20090063420 | Grid based file system - A method and apparatus for interfacing a drive with a tree-structured cluster as a library for a data grid storage system is described. In one embodiment, the tree-structured cluster of cache nodes is provided for storing data. The cluster is mounted as a drive or file system based on data stored in the cache nodes transparent to anyone using the drive or file system. A file system interface interfaces with the tree-structure cluster of cache nodes to presents data stored in the cache nodes. | 03-05-2009 |
20090063588 | Data gravitation - A method and apparatus for obtaining data of a cache node in a tree-structured cluster is described. In one embodiment, a query for data in the cache node of the tree-structured cluster is received. A determination of whether the data is stored in the queried cache node is made. An inquiry of other cache nodes in the cluster for the data is performed. An instance of the data from a cache node storing the data is replicated to the cache node receiving the query. | 03-05-2009 |
20090063653 | Grid computing space - A method and apparatus for using a tree-structured cluster as a library for a computing grid. In one embodiment, a request for computation is received at a cache node of the cluster. The computation requires data from an other cache node of the cluster, and not present in the cache node receiving the request. The other cache nodes of the cluster are polled for the required data. An instance of the required data stored in the other cache node of the cluster is replicated to the cache node receiving the computation request. | 03-05-2009 |
20090063796 | Buddy replication - A method and apparatus for replicating instances of cache nodes in a cluster is described. In one embodiment, the number of available cache nodes in the cluster is determined. Available cache nodes from the cluster are selected based on a parameter. An instance of a cache node is replicated to only one of the selected cache nodes in the cluster. | 03-05-2009 |
20090132535 | Multiversion concurrency control in in-memory tree-based data structures - A method and apparatus for providing concurrent access to a cache node of a tree-based data structure. Readers concurrently read access the cache node. A copy of the cache node is created for a write access of a writer. Only one copy of the cache node is allowed at any one time. The writer operates on the copy of the cache node while concurrent read access of the cache node are provided to the readers. | 05-21-2009 |
20090132614 | Data gravitation in a distributed-tree structure - A method and apparatus for obtaining data from a cluster of cache nodes in a tree-based structure is disclosed. A querying cache node outside a partition group queries data of a cache node of the partition group. The partition group is made of one or more cache nodes of the cluster, where an instance of a cache node in the partition group is copied to each cache node in the partition group. The instance of the data of the cache nodes of the partition group is copied to the querying cache node. The partition group is adjusted to include the querying cache node as a member of the partition group. | 05-21-2009 |
20090132657 | Dynamic data partitioning of data across a cluster in a distributed-tree structure - A method and apparatus for dynamically partitioning data across a cluster in a tree-based structure is disclosed. In one embodiment, cache nodes in the cluster are detected. A partition group is formed with members including one or more cache nodes of the cluster. An instance of a cache node in the partition group is copied to each cache node in the partition group. The membership of the partition group is adjusted based on a participation of data in the partition group. | 05-21-2009 |
20090132695 | Calculation of the degree of participation of a server in a cluster using half-life decay - A method and apparatus for calculating a degree of participation of a server in a group of servers is disclosed. In one embodiment, a memory stores timestamps for each access to the server. A processor weights the timestamps to treat more recent accesses as more important than older accesses, wherein older accesses decay in importance exponentially using a half-life constant. | 05-21-2009 |