Approximating sequential workloads on resource constrained systems

    公开(公告)号:US10089145B1

    公开(公告)日:2018-10-02

    申请号:US14980687

    申请日:2015-12-28

    Abstract: Data storage services may provide customers with access to computing resources of data storage server and throttling methods may be used manage the computing resources of the data storage service in order to ensure that the customers do not overload the data storage servers. Tokens may represent I/O operations executed by the customer of the data storage service. When I/O request are received the data storage service may determine if the I/O request is a member of a sequence and remove a reduced number for tokens from the work token bucket as a result. The data storage server may determine the I/O request is a member of a sequence based at least in part on a logical chunk of a storage volume the I/O request maps to.

    Volume-based key-value store
    2.
    发明授权

    公开(公告)号:US09971526B1

    公开(公告)日:2018-05-15

    申请号:US14754326

    申请日:2015-06-29

    CPC classification number: G06F3/0619 G06F3/064 G06F3/067 G06F17/30321

    Abstract: The current document describes a storage system that provides a storage volume with a block-data interface to one or more clients. The storage system provides a key-value store that is associated with the storage volume. The clients access the key-value store via a key-value interface that provides a number of key-value operations to read, write, list, and delete key-value records from the key-value store. In some implementations, the key-value interface provides additional key-value operations that support the use of the key-value store by more than one client at a time. An environment in which the key-value store is used by the clients to retain I/O throttling parameters is described.

Patent Agency Ranking