Optimized log storage for asynchronous log updates
    6.
    发明授权
    Optimized log storage for asynchronous log updates 有权
    优化的日志存储用于异步日志更新

    公开(公告)号:US09223843B1

    公开(公告)日:2015-12-29

    申请号:US14094154

    申请日:2013-12-02

    CPC classification number: G06F17/30371 G06F17/30368 G06F17/30578

    Abstract: A log-structured data store may implement optimized log storage for asynchronous log updates. In some embodiments, log records may be received indicating updates to data stored for a storage client and indicating positions in a log record sequence. The log records themselves may not be guaranteed to be received according to the log record sequence. Received log records may be stored in a hot log portion of a block-based storage device according to an order in which they are received. Log records in the hot log portion may then be identified to be moved to a cold log portion of the block-based storage device in order to complete a next portion of the log record sequence. Log records may be modified, such as compressed, or coalesced, before being stored together in a data block of the cold log portion according to the log record sequence.

    Abstract translation: 日志结构化数据存储可以实现用于异步日志更新的优化日志存储。 在一些实施例中,可以接收指示对存储用于存储客户端的数据的更新并指示日志记录序列中的位置的日志记录。 可能无法保证根据日志记录顺序接收日志记录。 接收到的日志记录可以根据它们被接收的顺序存储在基于块的存储设备的热日志部分中。 然后可以将热日志部分中的日志记录识别为移动到基于块的存储设备的冷日志部分,以便完成日志记录序列的下一部分。 可以根据日志记录序列将日志记录修改,例如压缩或合并,然后一起存储在冷日志部分的数据块中。

    System and method for allocating resources for heterogeneous service requests

    公开(公告)号:US09385963B1

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

    申请号:US13958660

    申请日:2013-08-05

    CPC classification number: H04L47/70 H04L12/4641 H04L67/02 H04L67/32

    Abstract: A system for allocating constrained resources (e.g., downstream services, execution threads, database connections, input/output channels, computational resources, and/or memory) to requested services that are dependent on those resources may include multiple resource queues, each of which maintains a queue of requests for a respective constrained resource, and multiple service request queues, from which requests may be subsequently serviced. As each request reaches the head of a resource queue, it may receive a resource token for a respective constrained resource. Once the request has collected resource tokens for each of the constrained resources on which it depends, the request may be passed to a service request queue that maintains a queue of requests of a particular type. Requests in the multiple service request queues may be serviced on a round-robin or weighted round-robin basis. The number of tokens available for each constrained resource may be modified based on observed system performance.

Patent Agency Ranking