-
公开(公告)号：US20160299815A1
公开(公告)日：2016-10-13
申请号：US15180896
申请日：2016-06-13
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa
CPC classification number: G06F11/1435 , G06F17/30156 , G06F17/30194 , G06F17/30584
Abstract: A method of distributing data in a distributed storage system includes receiving a file, dividing the received file into chunks, and determining a distribution of the chunks among storage devices of the distributed storage system based on a maintenance hierarchy of the distributed storage system. The maintenance hierarchy includes maintenance levels, and each maintenance level includes one or more maintenance units. Each maintenance unit has an active state and an inactive state. Moreover, each storage device is associated with a maintenance unit. The determining of the distribution of the chunks includes identifying a random selection of the storage devices matching a number of chunks of the file and being capable of maintaining accessibility of the file when one or more maintenance units are in an inactive state. The method also includes distributing the chunks to storage devices of the distributed storage system according to the determined distribution.
Abstract translation: 在分布式存储系统中分发数据的方法包括接收文件，将接收到的文件划分成块，以及基于分布式存储系统的维护层次来确定分布式存储系统的存储设备中的块的分布。 维护层次结构包括维护级别，每个维护级别包括一个或多个维护单元。 每个维护单元都具有活动状态和非活动状态。 此外，每个存储设备与维护单元相关联。 确定块的分布包括识别与文件的多个块匹配的存储设备的随机选择，并且当一个或多个维护单元处于非活动状态时能够保持文件的可访问性。 该方法还包括根据确定的分布将块分配到分布式存储系统的存储设备。
-
公开(公告)号：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: 防止不必要的数据恢复的方法包括在数据处理设备处接收分布式系统的资源的状态。 当资源的状态指示资源故障时，该方法包括在数据处理设备上执行指令以确定资源故障是否与分布式系统内的任何其他资源故障相关。 当资源故障与分布式系统内的其他资源故障相关联时，该方法包括延迟与资源相关联的补救动作的数据处理设备上的执行。 然而，当资源故障与分布式系统内的其他资源故障不相关时，该方法包括在数据处理设备上启动与该资源相关联的补救措施的执行。
-
公开(公告)号：US20150220363A1
公开(公告)日：2015-08-06
申请号：US14169357
申请日：2014-01-31
Applicant: Google Inc.
Inventor： Robert Cypher , Peter Dahl , Steven Robert Schirripa
CPC classification number: G06F9/5011 , G06F9/4881 , G06F9/50 , G06F9/5061 , G06F9/5088 , G06F2209/503
Abstract: A method includes identifying high-availability jobs and low-availability jobs that demand usage of resources of a distributed system. The method includes determining a first quota of the resources available to low-availability jobs as a quantity of the resources available during normal operations, and determining a second quota of the resources available to high-availability jobs as a quantity of the resources available during normal operations minus a quantity of the resources lost due to a tolerated event. The method includes executing the jobs on the distributed system and constraining a total usage of the resources by both the high-availability jobs and the low-availability jobs to the quantity of the resources available during normal operations.
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: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
Patent Agency Ranking
公开(公告)号：US20150161163A1
公开(公告)日：2015-06-11
申请号：US14097380
申请日：2013-12-05
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa
IPC: G06F17/30
CPC classification number: G06F11/1435 , G06F17/30156 , G06F17/30194 , G06F17/30584
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 using a computer processor in communication with the non-transitory memory. The method also includes distributing chunks to storage devices of the distributed storage system based on a maintenance hierarchy of the distributed storage system. The maintenance hierarchy includes maintenance units each having active and inactive states. Moreover, each storage device is associated with a maintenance unit. The chunks are distributed across multiple maintenance units to maintain accessibility of the file when a maintenance unit 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: 在分布式存储系统中分发数据的方法包括接收文件并将所接收的文件划分成块。 这些块是数据块和非数据块。 该方法还包括基于分布式存储系统的维护层次，将组块分组为组，并且确定分布式存储系统的存储设备中的组块的分布。 维护层次结构包括分层维护级别和维护域。 每个维护域具有活动状态或非活动状态; 并且每个存储设备与至少一个维护域相关联。 该方法还包括基于所确定的分布将组的块分配到存储设备。 组中的组块分布在多个维护域中，以便在维护域处于非活动状态时维持重组组的块的能力。
-
公开(公告)号：US09367562B2
公开(公告)日：2016-06-14
申请号：US14097380
申请日：2013-12-05
Applicant: Google Inc.
Inventor： Robert Cypher , Sean Quinlan , Steven Robert Schirripa
IPC: G06F17/30
CPC classification number: G06F11/1435 , G06F17/30156 , G06F17/30194 , G06F17/30584
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 using a computer processor in communication with the non-transitory memory. The method also includes distributing chunks to storage devices of the distributed storage system based on a maintenance hierarchy of the distributed storage system. The maintenance hierarchy includes maintenance units each having active and inactive states. Moreover, each storage device is associated with a maintenance unit. The chunks are distributed across multiple maintenance units to maintain accessibility of the file when a maintenance unit is in an inactive state.
Abstract translation: 在分布式存储系统中分发数据的方法包括：将文件接收到非暂时存储器中，并使用与非暂时性存储器通信的计算机处理器将接收到的文件分割成块。 该方法还包括基于分布式存储系统的维护层级将块分发到分布式存储系统的存储设备。 维护层次结构包括维护单元，每个维护单元都具有活动状态和非活动状态。 此外，每个存储设备与维护单元相关联。 这些块分布在多个维护单元中，以便在维护单元处于非活动状态时保持文件的可访问性。
-
公开(公告)号：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: 用于在分布式存储系统的数据中心中有效地使用资源（例如，存储设备）的方法包括识别需要对分布式系统的资源的使用的高可用性作业和低可用性作业。 该方法还包括将资源使用分配给作业，确定在故障事件期间可用资源上的作业的第一次加载，以及确定在故障事件期间丢失的资源上的作业的第二次加载。 该方法包括基于第一和第二负载确定在故障事件期间可用的资源上的作业的缩放的第三负载，并且在故障事件期间将分配给低可用性作业的资源使用重新分配给高可用性作业。 重新分配与缩放的第三次工作负载相关联。
-
-
-
-
-
-
-
-
-
Search Results
24
records
(took 0.024 seconds)
