-
公开(公告)号：US09223644B1
公开(公告)日：2015-12-29
申请号：US14188965
申请日：2014-02-25
Applicant: Google Inc.
Inventor： Christian Eric Schrock , Robert Cypher , Steven Robert Schirripa
CPC classification number: G06F11/0793 , G06F11/0709 , G06F11/0757 , G06F11/079 , G06F11/1088
Abstract: A method that prevents unnecessary data recovery includes receiving, at a data processing device, a status of a resource of a distributed system. When the status of the resource indicates a resource failure, the method includes executing instructions on the data processing device to determine whether the resource failure is correlated to any other resource failures within the distributed system. When the resource failure is correlated to other resource failures within the distributed system, the method includes delaying execution on the data processing device of a remedial action associated with the resource. However, when the resource failure is uncorrelated to other resource failures within the distributed system, the method includes initiating execution on the data processing device of the remedial action associated with the resource.
Abstract translation: 防止不必要的数据恢复的方法包括在数据处理设备处接收分布式系统的资源的状态。 当资源的状态指示资源故障时，该方法包括在数据处理设备上执行指令以确定资源故障是否与分布式系统内的任何其他资源故障相关。 当资源故障与分布式系统内的其他资源故障相关联时，该方法包括延迟与资源相关联的补救动作的数据处理设备上的执行。 然而，当资源故障与分布式系统内的其他资源故障不相关时，该方法包括在数据处理设备上启动与该资源相关联的补救措施的执行。
-
公开(公告)号：US09128825B1
公开(公告)日：2015-09-08
申请号：US13897159
申请日：2013-05-17
Applicant: GOOGLE INC.
Inventor： Christoph Albrecht , Murray Stokely , Arif Merchant , Christian Eric Schrock , Xudong Shi
IPC: G06F12/02
CPC classification number: G06F12/0246 , G06F3/0608 , G06F3/061 , G06F3/0649 , G06F3/0665 , G06F3/0685 , G06F12/02 , G06F12/0253
Abstract: Systems and methods are discussed relating to allocation of memory from a fixed pool of fast memory within a data center having a data storage area equipped with that memory. Techniques include: receiving a request to write data in the storage area; identifying a file group associated with the write request; analyzing previous data activity traces associated with the file group; determining an available fast memory amount based on the total amount of fast memory in the fixed pool and a currently allocated amount of fast memory; determining a fast memory allocation for the file group based on the previous data activity traces, the available fast memory, and a fast memory constraint, the memory allocation including an allocation amount and a write probability; and providing information about the memory allocation to a file system of the data center, which writes the data based on the allocation amount and write probability.
Abstract translation: 讨论了关于在具有配备有该存储器的数据存储区域的数据中心内从快速存储器的固定池分配存储器的系统和方法。 技术包括：接收在存储区域中写入数据的请求; 识别与所述写请求相关联的文件组; 分析与文件组相关联的以前的数据活动跟踪; 基于固定池中的快速存储器的总量和当前分配的快速存储量来确定可用的快速存储器量; 基于先前的数据活动轨迹，可用的快速存储器和快速存储器约束确定文件组的快速存储器分配，存储器分配包括分配量和写入概率; 并且向数据中心的文件系统提供关于存储器分配的信息，其基于分配量和写入概率来写入数据。
-
公开(公告)号：US20170075741A1
公开(公告)日：2017-03-16
申请号：US15358637
申请日：2016-11-22
Applicant: Google Inc.
Inventor： Steven Robert Schirripa , Christian Eric Schrock , Robert Cypher , Sean Quinlan
CPC classification number: G06F11/1464 , G06F3/0619 , G06F3/064 , G06F3/0644 , G06F3/067 , G06F11/00 , G06F11/008 , G06F11/1004 , G06F11/1088 , G06F11/1092 , G06F11/1461 , G06F11/1469 , G06F11/2094 , G06F17/30215 , H03M13/1515
Abstract: A method of prioritizing data for recovery in a distributed storage system includes, for each stripe of a file having chunks, determining whether the stripe comprises high-availability chunks or low-availability chunks and determining an effective redundancy value for each stripe. The effective redundancy value is based on the chunks and any system domains associated with the corresponding stripe. The distributed storage system has a system hierarchy including system domains. Chunks of a stripe associated with a system domain in an active state are accessible, whereas chunks of a stripe associated with a system domain in an inactive state are inaccessible. The method also includes reconstructing substantially immediately inaccessible, high-availability chunks having an effective redundancy value less than a threshold effective redundancy value and reconstructing the inaccessible low-availability and other inaccessible high-availability chunks, after a threshold period of time.
Abstract translation: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：US09292389B2
公开(公告)日：2016-03-22
申请号：US14169274
申请日：2014-01-31
Applicant: Google Inc.
Inventor： Steven Robert Schirripa , Christian Eric Schrock , Robert Cypher , Sean Quinlan
IPC: G06F11/14
CPC classification number: G06F11/1464 , G06F3/0619 , G06F3/064 , G06F3/0644 , G06F3/067 , G06F11/00 , G06F11/008 , G06F11/1004 , G06F11/1088 , G06F11/1092 , G06F11/1461 , G06F11/1469 , G06F11/2094 , G06F17/30215 , H03M13/1515
Abstract: A method of prioritizing data for recovery in a distributed storage system includes, for each stripe of a file having chunks, determining whether the stripe comprises high-availability chunks or low-availability chunks and determining an effective redundancy value for each stripe. The effective redundancy value is based on the chunks and any system domains associated with the corresponding stripe. The distributed storage system has a system hierarchy including system domains. Chunks of a stripe associated with a system domain in an active state are accessible, whereas chunks of a stripe associated with a system domain in an inactive state are inaccessible. The method also includes reconstructing substantially immediately inaccessible, high-availability chunks having an effective redundancy value less than a threshold effective redundancy value and reconstructing the inaccessible low-availability and other inaccessible high-availability chunks, after a threshold period of time.
Abstract translation: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：US11080140B1
公开(公告)日：2021-08-03
申请号：US15720784
申请日：2017-09-29
Applicant: Google Inc.
Inventor： Lidor Carmi , Christian Eric Schrock , Steven Robert Schirripa
IPC: G06F11/14
Abstract: A method of operating a distributed storage system, the method includes identifying unhealthy chunks of a file. The file is divided into stripes that include data chunks and non-data chunks. The method also includes identifying healthy chunks available for reconstructing the unhealthy chunks and reconstructing unhealthy data chunks before reconstructing unhealthy non-data chunks using the available healthy chunks. When the unhealthy chunk is an unhealthy word-check chunk: reconstructing the unhealthy word-check chunk using healthy word-check chunks and healthy code-check-word-check chunks; determining whether reconstruction of the unhealthy word-check chunk is possible using only healthy word-check chunks and healthy code-check-word-check chunks; and when reconstruction of the unhealthy word-check chunk is not possible using only healthy word-check chunks and healthy code-check-word-check chunks, reconstructing the unhealthy word-check chunk using any healthy chunks.
-
Patent Agency Ranking
公开(公告)号：US09804925B1
公开(公告)日：2017-10-31
申请号：US14188773
申请日：2014-02-25
Applicant: Google Inc.
Inventor： Lidor Carmi , Christian Eric Schrock , Steven Robert Schirripa
CPC classification number: G06F11/1412
Abstract: A method of operating a distributed storage system, the method includes identifying missing chunks of a file. The file is divided into stripes that include data chunks and non-data chunks. The method also includes identifying non-missing chunks available for reconstructing the missing chunks and reconstructing missing data chunks before reconstructing missing non-data chunks using the available non-missing chunks.
-
公开(公告)号：US09747155B2
公开(公告)日：2017-08-29
申请号：US15342717
申请日：2016-11-03
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa , Lidor Carmi , Christian Eric Schrock
CPC classification number: G06F11/2094 , G06F3/0619 , G06F3/0643 , G06F3/067 , G06F11/0727 , G06F11/0793 , G06F11/1076 , G06F2201/805 , G06F2211/1028
Abstract: A method of distributing data in a distributed storage system includes receiving a file and dividing the received file into chunks. The chunks are data-chunks and non-data chunks. The method further includes grouping chunks into a group and determining a distribution of the chunks of the group among storage devices of the distributed storage system based on a maintenance hierarchy of the distributed storage system. The maintenance hierarchy includes hierarchical maintenance levels and maintenance domains. Each maintenance domain has an active state or an inactive state; and each storage device is associated with at least one maintenance domain. The method also includes distributing the chunks of the group to the storage devices based on the determined distribution. The chunks of the group are distributed across multiple maintenance domains to maintain an ability to reconstruct chunks of the group when a maintenance domain is in the inactive state.
-
公开(公告)号：US20150220429A1
公开(公告)日：2015-08-06
申请号：US14169322
申请日：2014-01-31
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa , Lidor Carmi , Christian Eric Schrock
IPC: G06F12/02
CPC classification number: G06F11/2094 , G06F3/0619 , G06F3/0643 , G06F3/067 , G06F11/0727 , G06F11/0793 , G06F11/1076 , G06F2201/805 , G06F2211/1028
Abstract: A method of distributing data in a distributed storage system includes receiving a file into non-transitory memory and dividing the received file into chunks. The chunks are data-chunks and non-data chunks. The method also includes grouping one or more of the data chunks and one or more of the non-data chunks in a group. One or more chunks of the group is capable of being reconstructed from other chunks of the group. The method also includes distributing the chunks of the group to storage devices of the distributed storage system based on a hierarchy of the distributed storage system. The hierarchy includes maintenance domains having active and inactive states, each storage device associated with a maintenance domain, the chunks of a group are distributed across multiple maintenance domains to maintain the ability to reconstruct chunks of the group when a maintenance domain is in an inactive state.
Abstract translation: 在分布式存储系统中分发数据的方法包括将文件接收到非暂时存储器中并将接收到的文件分割成块。 这些块是数据块和非数据块。 该方法还包括将一个或多个数据块和一组中的一个或多个非数据块分组。 该组中的一个或多个组块能够从该组的其他组块重构。 该方法还包括基于分布式存储系统的层次，将该组块分配到分布式存储系统的存储设备。 层次结构包括具有活动状态和非活动状态的维护域，每个存储设备与维护域相关联，组的块被分布在多个维护域上，以便在维护域处于非活动状态时维持重组组的块的能力 。
-
公开(公告)号：US09823980B2
公开(公告)日：2017-11-21
申请号：US15358637
申请日：2016-11-22
Applicant: Google Inc.
Inventor： Steven Robert Schirripa , Christian Eric Schrock , Robert Cypher , Sean Quinlan
CPC classification number: G06F11/1464 , G06F3/0619 , G06F3/064 , G06F3/0644 , G06F3/067 , G06F11/00 , G06F11/008 , G06F11/1004 , G06F11/1088 , G06F11/1092 , G06F11/1461 , G06F11/1469 , G06F11/2094 , G06F17/30215 , H03M13/1515
Abstract: A method of prioritizing data for recovery in a distributed storage system includes, for each stripe of a file having chunks, determining whether the stripe comprises high-availability chunks or low-availability chunks and determining an effective redundancy value for each stripe. The effective redundancy value is based on the chunks and any system domains associated with the corresponding stripe. The distributed storage system has a system hierarchy including system domains. Chunks of a stripe associated with a system domain in an active state are accessible, whereas chunks of a stripe associated with a system domain in an inactive state are inaccessible. The method also includes reconstructing substantially immediately inaccessible, high-availability chunks having an effective redundancy value less than a threshold effective redundancy value and reconstructing the inaccessible low-availability and other inaccessible high-availability chunks, after a threshold period of time.
-
公开(公告)号：US20170075753A1
公开(公告)日：2017-03-16
申请号：US15342717
申请日：2016-11-03
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa , Lidor Carmi , Christian Eric Schrock
CPC classification number: G06F11/2094 , G06F3/0619 , G06F3/0643 , G06F3/067 , G06F11/0727 , G06F11/0793 , G06F11/1076 , G06F2201/805 , G06F2211/1028
Abstract: A method of distributing data in a distributed storage system includes receiving a file and dividing the received file into chunks. The chunks are data-chunks and non-data chunks. The method further includes grouping chunks into a group and determining a distribution of the chunks of the group among storage devices of the distributed storage system based on a maintenance hierarchy of the distributed storage system. The maintenance hierarchy includes hierarchical maintenance levels and maintenance domains. Each maintenance domain has an active state or an inactive state; and each storage device is associated with at least one maintenance domain. The method also includes distributing the chunks of the group to the storage devices based on the determined distribution. The chunks of the group are distributed across multiple maintenance domains to maintain an ability to reconstruct chunks of the group when a maintenance domain is in the inactive state.
Abstract translation: 在分布式存储系统中分发数据的方法包括接收文件并将所接收的文件划分成块。 这些块是数据块和非数据块。 该方法还包括基于分布式存储系统的维护层次，将组块分组为组，并且确定分布式存储系统的存储设备中的组块的分布。 维护层次结构包括分层维护级别和维护域。 每个维护域具有活动状态或非活动状态; 并且每个存储设备与至少一个维护域相关联。 该方法还包括基于所确定的分布将组的块分配到存储设备。 组中的组块分布在多个维护域中，以便在维护域处于非活动状态时维持重组组的块的能力。
-
-
-
-
-
-
-
-
-
Search Results
18
records
(took 0.015 seconds)
