-
公开(公告)号:US09009524B2
公开(公告)日:2015-04-14
申请号:US13460807
申请日:2012-04-30
CPC分类号: G06F11/1076 , G06F11/0727 , G06F11/0757
摘要: A method for determining priority of recovery for a RAID implementation includes detecting a first failure of the RAID implementation; detecting a second failure of the RAID implementation; assigning a first priority to the first failure and a second priority to the second failure; and setting the priority of the recovery based on the first priority and the second priority.
摘要翻译: 确定用于RAID实现的恢复优先级的方法包括检测RAID实现的第一故障; 检测RAID实施的第二个故障; 将第一优先级分配给第一故障,并将第二优先级分配给第二故障; 并且基于第一优先级和第二优先级来设置恢复的优先级。
-
公开(公告)号:US09286339B2
公开(公告)日:2016-03-15
申请号:US13460808
申请日:2012-04-30
申请人: Eric A Anderson , Joseph A Tucek
发明人: Eric A Anderson , Joseph A Tucek
IPC分类号: G06F17/30
CPC分类号: G06F17/30327 , G06F17/30362
摘要: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during migration.
摘要翻译: 一种用于动态划分B树数据结构的方法,包括:确定B树数据结构是否需要分区; 建立B树数据结构的中点; 从B树数据结构的开始迁移到B树数据结构的中点到第一B树数据结构; 从B树数据结构的中点迁移到B树数据结构的一端到第二B树数据结构; 并允许在迁移期间对B树数据结构进行正常的操作。
-
公开(公告)号:US08959118B2
公开(公告)日:2015-02-17
申请号:US13460597
申请日:2012-04-30
申请人: Eric A Anderson , Joseph A Tucek , Jain Nitin
发明人: Eric A Anderson , Joseph A Tucek , Jain Nitin
IPC分类号: G06F17/30
CPC分类号: G06F17/30091
摘要: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.
摘要翻译: 一种用于在文件系统上实现的搜索树(B-tree)中插入文件的方法包括:(a)响应于当前节点是根节点或内部节点,确定子节点; (b)重复(a)直到检测到叶节点; (c)响应于叶节点的一级叶节点超过文件的上限或超过子目录上限的当前节点的子节点数,平衡叶节点的等级 或子节点; 和(d)将文件插入叶节点的级别。
-
-