-
公开(公告)号：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: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：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: 在分布式存储系统中分发数据的方法包括接收文件并将所接收的文件划分成块。 这些块是数据块和非数据块。 该方法还包括基于分布式存储系统的维护层次，将组块分组为组，并且确定分布式存储系统的存储设备中的组块的分布。 维护层次结构包括分层维护级别和维护域。 每个维护域具有活动状态或非活动状态; 并且每个存储设备与至少一个维护域相关联。 该方法还包括基于所确定的分布将组的块分配到存储设备。 组中的组块分布在多个维护域中，以便在维护域处于非活动状态时维持重组组的块的能力。
-
Patent Agency Ranking
公开(公告)号：US09569253B1
公开(公告)日：2017-02-14
申请号：US13905637
申请日：2013-05-30
Applicant: Google Inc.
Inventor： Wilson Cheng-Yi Hsieh , Alexander Lloyd , Peter Hochschild , Michael James Boyer Epstein , Sean Quinlan
CPC classification number: G06F17/30377 , G06F9/466 , G06F17/30551
Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.
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: 在分布式存储系统中分发数据的方法包括：将文件接收到非暂时存储器中，并使用与非暂时性存储器通信的计算机处理器将接收到的文件分割成块。 该方法还包括基于分布式存储系统的维护层级将块分发到分布式存储系统的存储设备。 维护层次结构包括维护单元，每个维护单元都具有活动状态和非活动状态。 此外，每个存储设备与维护单元相关联。 这些块分布在多个维护单元中，以便在维护单元处于非活动状态时保持文件的可访问性。
-
公开(公告)号：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: 对于分布式存储系统中用于恢复的数据进行优先排序的方法包括：对于具有块的文件的每个条带，确定条带是否包括高可用性块或低可用性块，并确定每个条带的有效冗余值。 有效的冗余值基于与相应条带相关联的块和任何系统域。 分布式存储系统具有系统层次结构，包括系统域。 与处于活动状态的系统域相关联的条带的块可访问，而与处于非活动状态的系统域相关联的条带的块不可访问。 该方法还包括在阈值时间段之后重建具有小于阈值有效冗余度值的有效冗余度的基本上立即不可访问的高可用性块并且重建不可访问的低可用性和其他不可访问的高可用性块。
-
公开(公告)号：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: 在分布式存储系统中分发数据的方法包括将文件接收到非暂时存储器中并将接收到的文件分割成块。 这些块是数据块和非数据块。 该方法还包括将一个或多个数据块和一组中的一个或多个非数据块分组。 该组中的一个或多个组块能够从该组的其他组块重构。 该方法还包括基于分布式存储系统的层次，将该组块分配到分布式存储系统的存储设备。 层次结构包括具有活动状态和非活动状态的维护域，每个存储设备与维护域相关联，组的块被分布在多个维护域上，以便在维护域处于非活动状态时维持重组组的块的能力 。
-
-
-
-
-
-
-
-
-
Search Results
21
records
(took 0.026 seconds)
