Samsung Electronics Co., Ltd.

Ilgu Hong

Yang Seok Ki

Heekwon Park

Ho Bin Lee

Changho Choi

A method includes receiving, at a controller of a computational storage (CS) device, a request to allocate computational storage to an application of a host device. The request includes a resource set ID associated with the application. The method further includes identifying a memory range within a memory region of the CS device. The method further includes storing, in a data structure associated with the resource set ID, an association between a memory range identifier (ID) of the memory range, the memory region, and an offset within the memory region. The method further includes sending the memory range ID to the host device.

Resource isolation in computational storage devices

A method for scheduling input/output (I/O) commands is described. The method includes receiving, by an I/O scheduler, an I/O command from an application; generating, by the I/O controller, an I/O resource requirement based on the I/O command; determining, by a traffic controller, that an amount of available resources satisfies a criteria based on the I/O resource requirement; and sending, by the traffic controller, the I/O command to a queue in response to the criteria being satisfied.

Systems and methods for I/O command scheduling based on multiple resource parameters

A system for scheduling input/output (I/O) requests from virtual machines includes a storage device including storage device resources for processing I/O requests to access a non-volatile memory of the storage device, a first virtual machine configured to send an I/O request to the storage device, a resource manager configured to calculate a first amount of the storage device resources and assign the first amount to the first virtual machine, and a traffic controller associated with the first virtual machine, the traffic controller being configured to reschedule the I/O request from the first virtual machine based on an availability of the first amount.

Mechanism for distributed resource-based I/O scheduling over storage device

Provided is a method of adjusting prefetching operations, the method including setting a prefetching distance, accessing a prefetching-trigger key, determining a target key is outside of the prefetching distance from the prefetching-trigger key, increasing the prefetching distance, and successfully fetching a subsequent target key of a subsequent prefetching-trigger key from a prefetching read-ahead buffer.

Prefetching operations in storage devices

A system and method for scheduling commands for processing by a storage device. A command is received from an application and stored in a first queue. Information is obtained on a first set of resources managed by the storage device. A second set of resources is synchronized based on the information on the first set of resources. The second set of resources is allocated into a first pool and a second pool. A condition of the second set of resources in the first pool is determined. One of the second set of resources in the first pool is allocated to the command based on a first determination of the condition, and one of the second set of resources in the second pool is allocated to the command based on a second determination of the condition.

Systems and methods for resource-based scheduling of commands

Provided is a method of linking multiple KV blocks in a KV chain to ensure data consistency, the method including allocating an internal key to both a first KV block and a recovery begin internal key, allocating a next internal key that is different from the internal key and that corresponds to a next KV block, and encapsulating respective user key values in the first KV block and in the next KV block, wherein the first KV block is accessed by reading the recovery begin internal key, and wherein the next KV block is accessed by reading the next internal key of the first KV block.

Reliable key-value store with write-ahead-log-less mechanism

A Key-Value (KV) storage device is disclosed. The KV storage device may include storage for objects, each object including data associated with a key. A host interface layer may receive requests to read data associated with a key from the storage, to write data associated with a key to the storage, and a boot request to get boot data from the storage. A boot request processor may process the boot request using the storage.

Bootable key value solid state drive (KV-SSD) device with host interface layer arranged to received and returns boot requests from host processor using storage for objects

Provided is a system and method for searching for a target key in a database, the method including populating a hash-offset table of a sorted key table with hash-offset table entries, the hash-offset table entries having a hash-value corresponding to a respective key, and a hash offset, sorting the hash-offset table entries based on the hash-values, searching for a target hash-value of the hash-values corresponding to a target key in the hash-offset table, locating a target key-value pair corresponding to the target key based on the target hash-value, and saving a location of the target key-value pair.

Internal key hash directory in table

Provided is a method of data storage, the method including receiving a write request including a user key, determining the user key exists in a cache, generating or updating metadata corresponding to the user key, writing data corresponding to the write request to a storage device, converting the metadata to a device format corresponding to the storage device, and storing the metadata on the storage device.

Key-value store architecture for key-value devices

Provided is a method of data storage, the method including identifying a plurality of transactions in a pending queue, the transactions having one or more key value updates respectively corresponding to a plurality of keys, identifying a commonly associated key of the plurality of keys associated with commonly associated key value updates of the key value updates belonging to different ones of the transactions, respectively assigning transaction group IDs to the transactions based on respective transaction IDs assigned to the transaction group IDs, grouping the transactions into a respective transaction group of a plurality of transaction groups based on the assigned transaction group ID, and merging conflicting data writes corresponding to the commonly associated key value updates of the commonly associated key for grouped transactions of the transactions that are in a same one of the transaction groups.

Transaction grouping for overwrite merge

A Key-Value (KV) storage device is disclosed. The KV storage device may include storage for a first object and a second object. Each object may include data associated with a key. A KV translation layer may translate a key to a physical address in the storage where the data is stored. A KV interface may receive a KV request involving an object, and a block interface may receive a block request involving an object. A block emulator may generate a KV request including a key generated from the block request.

Growing community of inventors

Santa Clara, CA, United States of America

Ilgu Hong