Quota-based resource scheduling
    1.
    发明授权

    公开(公告)号:US09781054B1

    公开(公告)日:2017-10-03

    申请号:US14810187

    申请日:2015-07-27

    申请人: Google Inc.

    CPC分类号: H04L47/762 H04L47/821

    摘要: The present disclosure relates to dynamically scheduling resource requests in a distributed system based on usage quotas. One example method includes identifying usage information for a distributed system including atoms, each atom representing a distinct item used by users of the distributed system; determining that a usage quota associated with the distributed system has been exceeded based on the usage information, the usage quota representing an upper limit for a particular type of usage of the distributed system; receiving a first request for a particular atom requiring invocation of the particular type of usage represented by the usage quota; determining that a second request for a different type of usage of the particular atom is waiting to be processed; and processing the second request for the particular atom before processing the first request.

    STORING DATA ACROSS A PLURALITY OF STORAGE NODES
    2.
    发明申请
    STORING DATA ACROSS A PLURALITY OF STORAGE NODES 审中-公开
    存储多个存储数据的数据

    公开(公告)号:US20160132263A1

    公开(公告)日:2016-05-12

    申请号:US15000718

    申请日:2016-01-19

    申请人: Google Inc.

    IPC分类号: G06F3/06

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data on storage nodes. In one aspect, a method includes receiving a file to be stored across a plurality of storage nodes each including a cache. The is stored by storing portions of the file each on a different storage node. A first portion is written to a first storage node's cache until determining that the first storage node's cache is full. A different second storage node is selected in response to determining that the first storage node's cache is full. For each portion of the file, a location of the portion is recorded, the location indicating at least a storage node storing the portion.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的用于在存储节点上存储数据的计算机程序。 一方面,一种方法包括:接收要跨越多个存储节点存储的文件,每个存储节点包括高速缓存。 通过将文件的各部分存储在不同的存储节点上来存储。 将第一部分写入第一存储节点的高速缓存,直到确定第一存储节点的高速缓存已满。 响应于确定第一存储节点的高速缓存已满,选择不同的第二存储节点。 对于文件的每个部分,记录该部分的位置,该位置指示至少存储该部分的存储节点。

    Storing data across a plurality of storage nodes
    3.
    发明授权
    Storing data across a plurality of storage nodes 有权
    在多个存储节点之间存储数据

    公开(公告)号:US09250830B2

    公开(公告)日:2016-02-02

    申请号:US14293330

    申请日:2014-06-02

    申请人: Google Inc.

    IPC分类号: G06F12/08 G06F3/06 G06F11/10

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data on storage nodes. In one aspect, a method includes receiving a file to be stored across a plurality of storage nodes each including a cache. The is stored by storing portions of the file each on a different storage node. A first portion is written to a first storage node's cache until determining that the first storage node's cache is full. A different second storage node is selected in response to determining that the first storage node's cache is full. For each portion of the file, a location of the portion is recorded, the location indicating at least a storage node storing the portion.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的用于在存储节点上存储数据的计算机程序。 一方面,一种方法包括:接收要跨越多个存储节点存储的文件,每个存储节点包括高速缓存。 通过将文件的各部分存储在不同的存储节点上来存储。 将第一部分写入第一存储节点的高速缓存,直到确定第一存储节点的高速缓存已满。 响应于确定第一存储节点的高速缓存已满,选择不同的第二存储节点。 对于文件的每个部分,记录该部分的位置,该位置指示至少存储该部分的存储节点。

    Prioritized rate scheduler for a storage system

    公开(公告)号:US09262093B1

    公开(公告)日:2016-02-16

    申请号:US14107349

    申请日:2013-12-16

    申请人: GOOGLE INC.

    IPC分类号: G06F9/46 G06F15/173 G06F3/06

    摘要: A storage system may include a set of storage devices; a controller; and a management device. The controller may arbitrate among operations for execution by the set of storage devices, where the operations are received from users that are associated with priority levels. The controller may maintain queues, corresponding to the users, to queue operations from the users. The controller may additionally include a scoring component and a scheduler. The scoring component may maintain a score for each queue. The scheduler may choose, from the queues and based on the score of each queue, one of the operations to service. The management device may receive usage updates, from the controller, reflecting usage of the set of storage devices; calculate a maximum allowed usage levels, based on the received usage updates, for each user; and transmit the calculated maximum usage levels to the controller.

    STORING DATA ACROSS A PLURALITY OF STORAGE NODES
    5.
    发明申请
    STORING DATA ACROSS A PLURALITY OF STORAGE NODES 有权
    存储多个存储数据的数据

    公开(公告)号:US20140281233A1

    公开(公告)日:2014-09-18

    申请号:US14293330

    申请日:2014-06-02

    申请人: Google Inc.

    IPC分类号: G06F3/06 G06F11/10

    摘要: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data on storage nodes. In one aspect, a method includes receiving a file to be stored across a plurality of storage nodes each including a cache. The is stored by storing portions of the file each on a different storage node. A first portion is written to a first storage node's cache until determining that the first storage node's cache is full. A different second storage node is selected in response to determining that the first storage node's cache is full. For each portion of the file, a location of the portion is recorded, the location indicating at least a storage node storing the portion.

    摘要翻译: 方法,系统和装置,包括在计算机存储介质上编码的用于在存储节点上存储数据的计算机程序。 一方面,一种方法包括:接收要跨越多个存储节点存储的文件,每个存储节点包括高速缓存。 通过将文件的各部分存储在不同的存储节点上来存储。 将第一部分写入第一存储节点的高速缓存,直到确定第一存储节点的高速缓存已满。 响应于确定第一存储节点的高速缓存已满,选择不同的第二存储节点。 对于文件的每个部分,记录该部分的位置,该位置指示至少存储该部分的存储节点。