13 results about "Thin provisioning" patented technology

A storage device provides thin provisioning by presenting more logical capacity than available physical capacity. The storage device uses a dynamic random-access memory (DRAM) having a size that is proportional to the available physical capacity of the storage device. The storage device includes a memory device with a physical capacity and the DRAM. A controller on the storage device creates segments including logical block address (LBA) sets in an LBA space. The LBA sets include an LBA from each segment that are linked to enable the LBAs in a LBA set to share a mapping space in the DRAM. The controller also creates an L2P table including a LBA set entry per LBA set, with each LBA set entry including sub-entries to store physical locations on the memory device that are associated with the LBAs in the LBA set. The controller also stores the L2P table in the DRAM.

Examples described herein relate to memory thin provisioning in a memory pool of one or more dual in-line memory modules or memory devices. At any instance, any central processing unit (CPU) can request and receive a full virtual allocation of memory in an amount that exceeds the physical memory attached to the CPU (near memory). A remote pool of additional memory can be dynamically utilized to fill the gap between allocated memory and near memory. This remote pool is shared between multiple CPUs, with dynamic assignment and address re-mapping provided for the remote pool. To improve performance, the near memory can be operated as a cache of the pool memory. Inclusive or exclusive content storage configurations can be applied. An inclusive cache configuration can include an entry in a near memory cache also being stored in a memory pool whereas an exclusive cache configuration can provide an entry in either a near memory cache or in a memory pool but not both. Near memory cache management includes current data location tracking, access counting and other caching heuristics, eviction of data from near memory cache to pool memory and movement of data from pool memory to memory cache.

Large gaps in a L2P table that are disturbed by a few occupied addresses may be efficiently utilized by locating and considering the low-density of these occupied addresses in regards to the large gap (i.e., the gap free region altogether). By identifying a gap in a L2P table and then determining if the number of occupied addresses in the gap are less than a threshold value, the gap with the limited number of occupied addresses may be indicated as available RAM buffers for the system. The limited number of occupied addresses may then be marked and replaced with other addresses to evacuate a longer sequence of free addresses that can be used by the system, thereby optimizing data storage operations. In some embodiments, conventional clustering algorithms may be used to determine gap availability. In some embodiments, the stability several gaps may be tracked and used to determine storage priority.

A Solid State Disk (SSD) is disclosed. The SSD may include a flash storage medium and a controller to access a data on the flash storage medium. The SSD may be configured to advertise a physical capacity of the flash storage medium to a Virtual Storage Manager (VSM).

The invention discloses a simple volume space management method and electronic equipment, which are applied to the technical field of storage, and the method comprises the following steps: when a simple volume is created, determining a first proportion of a virtual capacity of the simple volume and a smaller value between the first proportion and a maximum initial allocation space, and allocating an initial capacity space for the simple volume; when the residual available capacity space of the simple volume is lower than a smaller value, determining the capacity expansion space applied at this time according to a rule that the capacity consumption speed of the simple volume within the latest first duration is positively correlated with the capacity expansion space applied at this time; applying for a capacity expansion space for the simple volume to perform capacity expansion of the simple volume, judging whether the residual available capacity space of the expanded simple volume is lower than a smaller value or not, and if yes, continuing capacity expansion; otherwise, the capacity expansion is ended. By applying the scheme provided by the invention, the high efficiency of the read-write efficiency of the simplified volume can be ensured, the storage utilization rate is improved, and the expansion space applied at this time can be simply and conveniently determined.

A storage device may reduce overhead associated with executing purge-related operations on a memory device. The storage device includes a memory device including blocks to store data A controller on the storage device may categorize blocks on the memory device based on a thin provisioning read zeros (TPRZ) value. The controller may separate data stored in the blocks on the memory device according to the TPRZ value. When the storage device receives a purge command from a host, the controller may condition a purge operation on a first TPRZ value and perform the purge operation on the-blocks associated with the first TPRZ value.

A solid state disk (SSD) is disclosed. The SSD may include a flash storage medium and a controller for accessing data on the flash storage medium. The SSD may be configured to advertise the physical capacity of the flash storage medium to a virtual storage manager (VSM).

A storage device provides thin provisioning by presenting more logical capacity than available physical capacity. The storage device uses a dynamic random-access memory (DRAM) having a size that is proportional to the available physical capacity of the storage device. The storage device includes a memory device with a physical capacity and the DRAM. A controller on the storage device creates segments including logical block address (LBA) sets in an LBA space. The LBA sets include an LBA from each segment that are linked to enable the LBAs in a LBA set to share a mapping space in the DRAM. The controller also creates an L2P table including a LBA set entry per LBA set, with each LBA set entry including sub-entries to store physical locations on the memory device that are associated with the LBAs in the LBA set. The controller also stores the L2P table in the DRAM.

The application relates to the technical field of cloud computing, in particular to a block storage scheduling strategy optimization method which comprises the following steps: deploying an Openstack environment; completing the butt joint of Cinder and two pools supporting thin provisioning, requiring that the two pools correspond to two volume backends but use the same volume type; beneficial effects are as follows: the block storage scheduling strategy optimization method and system 1 can schedule to a suitable storage pool under the condition that an environment butt joints multiple thin storage pools and the sizes of the storage pools are inconsistent, can guarantee that the scheduling direction can make the actual residual spaces of different storage pools of the same volume type similar, still supports the scheduling direction making the actual residual spaces of different storage pools of the same volume type similar for a storage backend which cannot set max_over_subscription_ratio as auto, and max_over_subscription_ratio can also be set as auto after using the optimization strategy, without influencing original functions.

Logical to physical (L2P) tables are implemented in solid state drives (SSDs) to hold L2P address translations. In a thin provisioning or thin storage system, the L2P table is sized to support the total amount of memory that is available to be allocated on a per client or per host basis. During thin provisioning, the total amount of memory is not typically utilized. As such, the L2P table, which is sized to accommodate full usage of the memory allocated, is not fully utilized resulting in unused portions of the L2P table. The unused portions of the L2P table can be reallocated to use as temporal buffers until needed for write commands. Due to the reallocation, less buffers are needed.

Logical to physical (L2P) tables are implemented in solid state drives (SSDs) to hold L2P address translations. In a thin provisioning or thin storage system, the L2P table is sized to support the total amount of memory that is available to be allocated on a per client or per host basis. During thin provisioning, the total amount of memory is not typically utilized. As such, the L2P table, which is sized to accommodate full usage of the memory allocated, is not fully utilized resulting in unused portions of the L2P table. The unused portions of the L2P table can be reallocated to use as temporal buffers until needed for write commands. Due to the reallocation, less buffers are needed.

System performance can be optimized by dynamically allocating temporary buffers. Once the temporary buffers are initially allocated, the system performance is measured. Based upon the measurements, a determination is made regarding whether the temporary buffers should be reallocated to improve performance. If performance will improve, then the reallocation occurs. After the reallocation, performance is again measured and, if necessary, another reallocation may occur. Measuring the performance and reallocating the temporary buffers will continue to dynamically occur in the pursuit of optimal performance.

System performance can be optimized by dynamically allocating temporary buffers. Once the temporary buffers are initially allocated, the system performance is measured. Based upon the measurements, a determination is made regarding whether the temporary buffers should be reallocated to improve performance. If performance will improve, then the reallocation occurs. After the reallocation, performance is again measured and, if necessary, another reallocation may occur. Measuring the performance and reallocating the temporary buffers will continue to dynamically occur in the pursuit of optimal performance.