-
公开(公告)号：US09311194B1
公开(公告)日：2016-04-12
申请号：US14229313
申请日：2014-03-28
Applicant: Google Inc.
Inventor： Robert Cypher , Healfdene Goguen , Steven Robert Schirripa , Christian Eric Schrock
CPC classification number: G06F9/5083 , G06F11/1088 , G06F11/2094 , G06F11/3433 , G06F11/3485
Abstract: A method for efficiently using resources (e.g., memory devices) in data centers of a distributed storage system includes identifying high-availability jobs and low-availability jobs that demand usage of resources of the distributed system. The method further includes allocating resource usage to the jobs, determining a first load of the jobs on resources available during a failure event, and determining a second load of the jobs on the resources lost during the failure event. The method includes determining a scaled third load of the jobs on the resources available during the failure event based on the first and second loads and reallocating resource usage assigned to the low-availability jobs to the high-availability jobs during the failure event. The reallocation is associated with the scaled third load of the jobs.
Abstract translation: 用于在分布式存储系统的数据中心中有效地使用资源（例如，存储设备）的方法包括识别需要对分布式系统的资源的使用的高可用性作业和低可用性作业。 该方法还包括将资源使用分配给作业，确定在故障事件期间可用资源上的作业的第一次加载，以及确定在故障事件期间丢失的资源上的作业的第二次加载。 该方法包括基于第一和第二负载确定在故障事件期间可用的资源上的作业的缩放的第三负载，并且在故障事件期间将分配给低可用性作业的资源使用重新分配给高可用性作业。 重新分配与缩放的第三次工作负载相关联。
-
公开(公告)号：US20150220398A1
公开(公告)日：2015-08-06
申请号：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: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：US09898360B1
公开(公告)日：2018-02-20
申请号：US14980633
申请日：2015-12-28
Applicant: Google Inc.
Inventor： Christian Eric Schrock , Robert Cypher , Steven Robert Schirripa
IPC: G06F11/07
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.
-
Patent Agency Ranking
公开(公告)号：US09535790B2
公开(公告)日：2017-01-03
申请号：US15054780
申请日：2016-02-26
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: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：US09514015B2
公开(公告)日：2016-12-06
申请号：US15079095
申请日：2016-03-24
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 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: 在分布式存储系统中分发数据的方法包括将文件接收到非暂时存储器中并将接收到的文件分割成块。 这些块是数据块和非数据块。 该方法还包括将一个或多个数据块和一组中的一个或多个非数据块分组。 该组中的一个或多个组块能够从该组的其他组块重构。 该方法还包括基于分布式存储系统的层次，将该组块分配到分布式存储系统的存储设备。 层次结构包括具有活动状态和非活动状态的维护域，每个存储设备与维护域相关联，组的块被分布在多个维护域上，以便在维护域处于非活动状态时维持重组组的块的能力 。
-
公开(公告)号：US20160203066A1
公开(公告)日：2016-07-14
申请号：US15079095
申请日：2016-03-24
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa , Lidor Carmi , Christian Eric Schrock
IPC: G06F11/20
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.
-
公开(公告)号：US20160179621A1
公开(公告)日：2016-06-23
申请号：US15054780
申请日：2016-02-26
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.
-
公开(公告)号：US09323615B2
公开(公告)日：2016-04-26
申请号：US14169322
申请日：2014-01-31
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 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.
-
-
-
-
-
-
-
Search Results
18
records
(took 0.019 seconds)
