Abstract: Methods and apparatus are disclosed for securely erasing partitions of reconfigurable logic devices such as FPGAs in a multi-tenant server environment. In one example, a method of securely erasing an FPGA includes identifying one partition of previously-programmed resources in the FPGA, erasing the identified partition by storing new values in memory or storage elements of the identified partition, and storing new values in memory or storage elements of additional external resources electrically connected to the integrated circuit and associated with the identified partition. Thus, other partitions and subsequent users of the identified partition are prevented from accessing the securely erased data. A configuration circuit, accessible by a host computer via DMA, can be programmed into the FPGA reconfigurable logic for performing the disclosed erasing operations.

Abstract: A method, computer program product, and computer system for receiving, by a computing device, a request to create a heterogeneous storage object. A first storage object of the heterogeneous storage object may be created with a first RAID type. A second storage object of the heterogeneous storage object may be created with a second RAID type. The heterogeneous storage object may be persisted to a data store.

Abstract: A memory system comprising: a plurality of memory devices; a buffer memory suitable for buffering write data inputted from a host; and a controller suitable for: classifying the write data buffered in the buffer memory into N data groups according to logical addresses corresponding to the write data, N being a natural number greater than or equal to 2, selecting at least one data group among the N data groups when a size difference between at least two of the N data groups is equal to or more than a set size, and flushing at least one piece of data of the selected data group to at least one of the plurality of memory devices.

Abstract: A computer-implemented method according to one aspect includes receiving a request to increase a size of a backup storage space for a storage volume; adding additional extents to the backup storage space in response to the request; identifying a current extent location within the backup storage space; determining whether any filled extent locations exist between the current extent location and the additional extents added to the backup storage space; and conditionally utilizing the additional extents added to the backup storage space, based on the determining.

Abstract: A storage device includes a storage and a controller. The controller receives commands from a host, and queues, in a command queue, the commands received from the host. The controller queues a first command, which is a command to request changing a security setting of a partial area of the storage, a second command, which is a command to access the partial area of the storage, and a third command, which is a command to access an area of the storage other than the partial area, after queuing the second command. The controller changes order of the commands queued in the command queue so that the third command is executed before the second command is executed.

Abstract: System and techniques for an internet-of-things device blank are described herein. An IoT blank device may be tested to determine whether it is in an initial state. In response to a determination that the IoT blank device is in the initial state, a cloud endpoint may be contacted, via a transceiver, to retrieve a package. Here, the contact includes a message with an identifier of the IoT blank device. The package may be received, the package including an application. The package may be installed. The installation including registering the application with a message queue of the IoT blank device. The application may also be run after installation. Data from the application running on the IoT blank device may be received via a message queue. The data may then be transmitted to the cloud endpoint via the transceiver of the IoT blank device.

Abstract: A method, computer program product, and computer system for identifying a bit for an allocation unit. It may be determined if data has been modified on the allocation unit while degraded. A rebuild of the allocation unit may be executed when the bit is a first value. The rebuild of the allocation unit may be skipped when the bit is a second value.

Abstract: Techniques for storage management involve determining an independent redundant disk array RAID associated with a first set of storage disks, a first portion of storage blocks corresponding to the RAID being located in the first set of storage disks; determining, from the first set of storage disks, a plurality of storage disks corresponding to the RAID; and updating a set of association degrees of the first set of storage disks to indicate data coupling between storage disk pairs in the plurality of storage disks. Accordingly, the data coupling degree between storage disks can be determined more accurately.

Abstract: A data storage system includes multiple data storage devices. A subset of the data storage devices are selected to implement log storages for the data storage system, wherein incoming read and write requests are serviced at the data storage devices implementing the log storages. Data written to a volume stored in the data storage system is initially written to the log storage and subsequently flushed to additional data storage implemented using remaining ones of the data storage devices of the data storage system. A controller monitors wear levels of the data storage devices and initiates a reorganization of which data storage devices implement the log storages and which data storage devices implement the additional storage such that discrepancies in wear between the data storage devices is reduced.

Abstract: Writing new data to a tape volume of a tape emulation unit includes determining if the new data is an update to data that was previously written, writing the new data to a new section of the tape emulation unit in response to the new data not updating data that was previously written, deleting the data that was previously written and writing the new data to a new section in response to the new data updating data that was previously written, the new data being larger than the data that was previously written, and the underlying file system not supporting variable size records/blocks, and overwriting the data that was previously written in response to the new data updating data that was previously written and either the new data not being larger than the data that was previously written or the underlying file system supporting variable size records/blocks.

Abstract: A distributed storage system including at least one storage node, and at least one object storage device (OSD) is deployed on the at least one storage node. At least one data processing device and at least one metadata processing device that has a mapping relationship with the at least one data processing device are deployed on the at least one OSD. A target data processing module of an input/output (IO) operation is configured to determine a target metadata processing device corresponding to the target data processing device and an identifier of an OSD in which the target metadata processing device is located, send an access operation to the target metadata processing device, and access data of the IO operation based on the IO operation. The target metadata processing device is configured to access metadata of the IO operation based on the access operation.

Abstract: In an example embodiment, a device comprises a non-volatile memory and wear leveling control circuitry. The non-volatile memory comprises logical memory sectors mapped to physical memory sectors, and a supervisory memory sector configured to store a mapping of the logical memory sectors to memory partitions with user-defined boundaries. The wear leveling control circuitry is configured to: receive and store, in the mapping, wear leveling parameters based on user input, where each memory partition is associated with a wear leveling parameter indicating whether that memory partition is excluded from wear leveling; and determine and apply, to the non-volatile memory, wear leveling characteristics based on the wear leveling parameters, where the wear leveling characteristics identify an amount of wear leveling allowed for each of the memory partitions.

Abstract: A storage system comprises mixed-capacity storage devices, including at least one or more storage devices having relatively low capacities and one or more storage devices having relatively high capacities. The storage system is configured to establish a redundant array of independent disks (RAID) arrangement comprising a plurality of stripes, with each of the plurality of stripes comprising a plurality of data blocks and one or more corresponding parity blocks, the data blocks and parity blocks being distributed across multiple ones of the storage devices. In conjunction with establishment of the RAID arrangement, the storage system is further configured to concentrate storage of the parity blocks in the one or more storage devices having the relatively high capacities. The storage devices in some embodiments comprise at least a first set of storage devices each having a first capacity and a second set of storage devices each having a second capacity higher than the first capacity.

Abstract: Techniques are provided for synchronous replication for synchronous mirror copy guarantee. A file system dependent technique for synchronous mirror copy guarantee is provided by overriding default behavior of a persistent fence so that the persistent fence is activated to block operations targeting a storage object having a synchronous replication relationship based upon the synchronous replication relationship being out of sync. The default behavior of the persistent fence is overridden to allow operations to be executed upon the storage object based upon the synchronous replication relationship being in sync. A file system independent technique for synchronous mirror copy guarantee is provided by intercepting operations before the operations are received by a file system. The operations are selectively forwarded to the file system or not based upon a state of a synchronous replication relationship.

Abstract: A system includes integrated circuit (IC) dies having memory cells and a processing device coupled to the IC dies. The processing device performs operations including storing, within a zone map data structure, zones of a logical block address (LBA) space sequentially mapped to physical address space of the IC dies. A zone map entry in the zone map data structure corresponds to a data group written to one or more of the IC dies. The operations further include storing, within a block set data structure indexed by a block set identifier of the zone map entry, a die identifier and a block identifier for each data block of multiple data blocks of the data group, and writing multiple data groups, which are sequentially mapped across the zones, sequentially across the IC dies. Each data block can correspond to a media (or erase) block of the IC dies.

Abstract: Solutions for processing a redundant array of storage drives receiving a rebuilding request of a redundant array of storage drives. The redundant array has a first storage drive to be replaced. In response to no spare storage drive being available to logically replace the first storage drive, a second storage drive is identified, which is a source storage drive of a disk balance process being performed. A rebuilding of the redundant array is initiated by reconstructing data of the first storage drive on the second storage drive during the disk balance process.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes: generating an encoded data slice from a dispersed storage encoding of a data object and determining when the encoded data slice will not be stored in local dispersed storage. When the encoded data slice will not be stored in the local dispersed storage, the encoded data slice is stored via at least one elastic slice in an elastic dispersed storage, cryptographic material and an elastic storage pointer indicating a location of the elastic slice in the elastic dispersed storage are generated, and the cryptographic material and the elastic storage pointer are stored in the local dispersed storage.

Abstract: A host and a storage system communicate with each other by using a NVMeoF protocol are provided. In some embodiments, the host accesses a logical disk of the host by using a control node in the storage system, and sends a state query command to the control node. The state query command is configured to instruct the control node to report a path state of a path corresponding to the control node. Still in those embodiments, the host receives the path state reported by the control node. When the received path state indicates that the logical disk includes an access interval, the host sends an interval query command to the control node; receives access interval information reported by the control node; and records a mapping relationship between the control node and the access interval information.

Abstract: A method, computer program product, and computer system for storing data in a bucket of a plurality of buckets. A spare bucket may be reserved in the plurality of buckets. A copy of the data may be stored in the spare bucket. A pointer to the data in the bucket and a pointer to the copy of the data in the spare bucket may be updated based upon, at least in part, storing the data in the bucket and storing the copy of the data in the spare bucket.

Abstract: A “snapshot-control media agent” (“snap-MA”) is configured on a secondary storage computing device that operates apart from client computing devices. A “forwarder” media agent operates on each client computing device that uses a storage array, yet lacks command channels to the storage array. The forwarder media agent forwards commands directed at the storage array to the snap-MA, which receives and processes commands directed at the storage array that were forwarded by the forwarder media agents. Responses from the storage array are transmitted to the respective forwarder media agent. The snap-MA pools storage-array-command devices to avoid capacity limitations in regard to communications channels at the storage array.

Abstract: Control logic within a memory control component outputs first and second memory read commands to a memory module at respective times, the memory module having memory components disposed thereon. Interface circuitry within the memory control component receives first read data concurrently from a first plurality of the memory components via a first plurality of data paths, respectively, in response to the first memory read command, and receives second read data concurrently from a second plurality of the memory components via a second plurality of data paths, respectively, in response to the second memory read command, the first plurality of the memory components including at least one memory component not included in the second plurality of the memory components and vice-versa.

Abstract: In a storage system, attributes of nodes are specified as first attribute nodes and second attribute nodes, the I/O processing in the nodes is executed as a plurality of processes including front-end I/O processing executed by any of the first attribute nodes and back-end I/O processing executed by the first and second attribute nodes having a storage device that stores data relating to the I/O processing.

Abstract: In a complex system including; one or more storage systems including a cache and a storage controller; and one or more storage boxes including a storage medium, the storage box generates redundant data from write data received from a server, and writes the write data and the redundant data to the storage medium. The storage box transmits the write data to the storage system when it is difficult to generate the redundant data or it is difficult to write the write data and the redundant data to the storage medium. The storage system stores the received write data in the cache.

Abstract: A method of controlling discard operations is performed in a system that includes a host device and a data storage device. The method includes providing a shared discard bitmap accessed commonly by the host device and data storage device. The shared discard bitmap includes discard bits in one-to-one correspondence with target sectors of a nonvolatile memory device in the data storage device. The method also includes setting bit values of the discard bits stored in the shared discard bitmap, the bit values indicating whether data stored in each of the target sectors are discardable. An asynchronous discard operation may then be performed with respect to the target sectors based on the bit values of the discard bits stored in the shared discard bitmap.

Abstract: Methods and integrated circuit devices for accelerating memory page classification are provided. Memory systems typically have a combination of faster memory devices and slower memory devices. Frequently accessed memory pages (hot pages) should be maintained in the faster memory devices while less frequently accessed memory pages (cold pages) should be maintained in the slower memory devices. Classification of memory pages as hot or cold pages may be performed by an integrated circuit device that reads counter values that count transactions to corresponding memory pages. A distribution of counter values may be determined, and memory pages may be identified as hot or cold memory pages based on thresholds applied to the distribution.

Abstract: A first host system in a multipath storage system acts on behalf of a second host system when the second host system is unable to access a solid state drive (SSD). The first host system configures a bitmap table using an SSD controller of the first host system to access memory of the SSD associated with the second host system. The memory accessed on behalf of the second host system may be in a region including persistent memory, base address register memory and/or controller memory buffer of the second host system.

Abstract: A storage system includes stripes, extents included in one stripe among the stripes reside on storage devices in the storage system, respectively, and the storage system includes an address mapping between the stripe and storage devices where the extents reside. Regarding one extent, a storage device where the extent resides is determined among the storage devices based on the address mapping. The stripe is added to a rebuild list of the storage system in accordance with determining the storage device is a failed storage device, the rebuild list comprising a stripe that is to be rebuilt in the storage system. The storage system is rebuilt based on stripes in the rebuild list. Accordingly, the performance of a rebuild operation may be improved, and the time for the rebuild operation may be reduced. Further, there is provided a corresponding device and computer program product for managing a storage system.

Abstract: Example implementations relate to SATA and NVMe device determination. An example method can include determining a device type communicatively coupled to an M.2 socket of a central processing unit (CPU) based on a PEDET signal from the M.2 socket. The method can include configuring a crossbar switch to route a plurality of serial AT attachment (SATA) signals to the M.2 socket in response to a determination that the device is a SATA device type. The method can include configuring the crossbar switch and a multiplexer to route a plurality of non-volatile memory express (NVMe) signals to the M.2 socket in response to a determination that the device is an NVMe device type.

Abstract: Flexible deprovisioning of distributed storage is disclosed. For example, an orchestrator executes on a processor to measure a current storage demand factor based on a current count of service guests and a storage capacity of a plurality of storage nodes. A projected storage demand factor is calculated by (i) adjusting the current count of service guests with a timing factor resulting in a projected count, and (ii) combining the projected count with a storage class associated with the service guests. The orchestrator determines that the projected storage demand factor is lower than the current storage demand factor, and in response requests termination of a first storage node of the plurality of storage nodes based on the first storage node lacking an active communication session with the service guests. Cancel termination of the first storage node based on an association between the first storage node and a second storage node.

Abstract: A method, non-transitory computer readable medium and storage controller computing device that receives a configuration change request for a storage virtual machine, the configuration change request including a configuration change operation. A determination is made when configuration settings for the storage virtual machine are locked. The configuration change operation is applied to the configuration settings for the storage virtual machine when the determining indicates the configuration settings for the storage virtual machine are not locked. A failure message is sent in response to the configuration change request when the configuration settings for the storage virtual machine are determined to be locked.

Abstract: A storage controller is configured to communicate with a host over a first storage area network. Data controlled via the storage controller is mirrored to another storage controller over a second storage area network. The storage controller receives a request from the host to provide read diagnostic parameters of the second storage area network. In response to receiving the request, the storage controller secures the read diagnostic parameters of the second storage area network. The storage controller transmits the read diagnostic parameters of the second storage area network to the host.

Abstract: This disclosure provides techniques hierarchical address virtualization within a memory controller and configurable block device allocation. By performing address translation only at select hierarchical levels, a memory controller can be designed to have predictable I/O latency, with brief or otherwise negligible logical-to-physical address translation time. In one embodiment, address transition may be implemented entirely with logical gates and look-up tables of a memory controller integrated circuit, without requiring processor cycles. The disclosed virtualization scheme also provides for flexibility in customizing the configuration of virtual storage devices, to present nearly any desired configuration to a host or client.

Abstract: Coordinating a reclaiming of data storage space among processing nodes of a data storage system includes, by a first node in response to an event, performing local cleanup of first-node mapping data and issuing a request message to a second node, the request message identifying the data storage space to be reclaimed. The event may be a notification from a RAID component rebuilding a RAID volume. In response to the request message, the second node performs local cleanup of second-node mapping data and issues a completion message to the first node indicating that the second node has completed its part of the reclaiming of the data storage space. The first node responds to the completion message by marking the data storage space as being reclaimed and signaling to a source of the event that the data storage space is available for new use.

Abstract: An apparatus includes a memory that stores information managing whether a writing access to a storing region of a first storing device is present or absent for each of second-sized partial regions obtained by dividing a first-sized storing region by a given value; and a processor configured to: in response to an instruction to migrate first-sized target data from the first storing device to a second storing device having an access speed lower than that of the first storing device, when a number of accessed partial regions in a storing region of the target data is larger than a threshold, migrating the target data in a unit of the first size; otherwise migrating data in the accessed partial regions in a unit of the second size; calculating a first/second migration time periods that the migrations of the first/second size takes; and changing the threshold based on the calculating.

Abstract: A tiering service enables a client to custom specify service level agreements for data items to be tiered and automatically promotes and demotes the data items amongst a warm tier, a plurality of intermediate tiers, and a cold tier to ensure the service level agreement commitments are met. In some embodiments, a client specifies segmentation criteria for defining multiple segments of data items included in a data scope or table and assigns latency targets to the segments in order to define the service level agreement. Also, in some embodiments, a plurality of intermediate tiers are implemented on common underlying hardware by varying metadata management to implement intermediate tiers that have progressively increasing latencies.

Abstract: A system and method stores a database file into Flash memory or other write-constrained storage.

Abstract: The invention introduces a method for programming data of page groups into flash units to include steps for: obtaining, by a host interface (I/F) controller, user data of a page group from a host side, wherein the page group comprises multiple pages; storing, by the host I/F controller, the user data on the pages in a random access memory (RAM) through a bus architecture, outputting the user data on the pages to an engine via an I/F, and enabling the engine to calculate a parity of the page group according to the user data on the pages; obtaining, by a direct memory access (DMA) controller, the parity of the page group from the engine and storing the parity of the page group in the RAM through the bus architecture; and obtaining, by a flash I/F controller, the user data on the pages and the parity of the page group from the RAM through the bus architecture, and programming the user data on the pages and the parity of the page group into a flash module.

Abstract: A host device is configured to communicate over a network with a storage system. The host device comprises a multi-path input-output (MPIO) driver configured to control delivery of input-output (IO) operations from the host device to the storage system over selected ones of a plurality of paths through the network. The MPIO driver is further configured to identify a plurality of partitions of a storage device of the storage system, the storage device being used for booting a server. The MPIO driver is also configured to monitor an amount of consumed space of each partition, to transmit to the storage system data corresponding to the amount of consumed space of each partition, to process data from the storage system indicating that a size of the storage device has been increased, and to increase a size of one or more of the partitions.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Each computing device is operable to access one or more memory blocks within the storage devices and maintain a registry over the same one or more memory blocks. The registry may be adaptively resized according to the access of the one or more memory blocks.

Abstract: Disclosed in some examples are systems, methods, memory devices, and machine readable mediums for a fast secure data destruction for NAND memory devices that renders data in a memory cell unreadable. Instead of going through all the erase phases, the memory device may remove sensitive data by performing only the pre-programming phase of the erase process. Thus, the NAND doesn't perform the second and third phases of the erase process. This is much faster and results in data that cannot be reconstructed. In some examples, because the erase pulse is not actually applied and because this is simply a programming operation, data may be rendered unreadable at a per-page level rather than a per-block level as in traditional erases.

Abstract: A technique involves: in response to receiving a first request for adjusting a first width of a disk array to a second width, obtaining, based on source identification information of a source stripe group in the disk array in the first request, source block identification information of a source block associated with the source stripe group. The technique further involves: determining destination identification information of a destination stripe group associated with the second width for storing data. The technique further involves: storing, based on the source identification information and the destination identification information, source data and metadata for the source data from the source block into a destination block of the destination stripe group, the metadata including node identification information for accessing nodes of the source block. The technique further involves: adjusting the node to access the destination block based on the node identification information.

Abstract: Techniques are provided for inline deduplication based on a number of physical blocks having common fingerprints among multiple entries of a buffer cache. One method comprises storing input/output operations in a first cache comprising a plurality of entries each corresponding to a physical storage entity comprising a plurality of physical blocks. A given entry is maintained in the first cache based on a first number of physical blocks of the given entry having a duplicate fingerprint with at least one physical block of another entry in the first cache. A second number can be determined of the physical blocks of each entry having a fingerprint in a second cache, and a first ratio is determined for two entries in the first cache using the second number and the first number. A comparison of the first ratios can be performed to sort and possibly evict entries in the first cache based on the comparison.

Abstract: A method, computer program product, and computing system for processing a snapshot structure of a storage system, wherein the snapshot structure includes one or more temporal indicators and defines a plurality of elements including one or more snapshots, wherein the one or more temporal indicators are incremented to indicate the point at which a data entry was initially added to the snapshot structure. A snapshot matrix is generated based, at least in part, upon the snapshot structure, wherein the snapshot matrix defines the storage space used by one or more eclipsed elements and associated eclipsing elements.

Abstract: A storage system comprises a plurality of enclosures and a storage controller. Each enclosure comprises at least one processing device and a plurality of drives configured in accordance with a redundant array of independent disks (RAID) arrangement. The storage controller obtains data pages associated with an input-output request, provides the data pages to a processing device of a given enclosure, and issues a command to the processing device to perform at least one operation based at least in part on the data pages. The processing device of the given enclosure receives the data pages from the storage controller, generates compressed data pages based at least in part on the received data pages, stores one or more of the compressed data pages on the plurality of drives according to the RAID arrangement and returns information associated with the storage of the compressed data pages to the storage controller.

Abstract: A computer-implemented method includes fetching, by a controller, data using a plurality of memory channels of a memory system. The method further includes detecting, by the controller, that a first memory channel of the plurality of memory channels has not returned data. The method further includes marking, by the controller, the first memory channel from the plurality of memory channels as unavailable. The method further includes, in response to a fetch, reconstructing, by the controller, fetch data based on data received from all memory channels other than the first memory channel.

Abstract: Systems and methods for recovering corrupted data or missing data from a cache are provided. When a data corruption is discovered in a storage system, the cache may be searched to determine if a valid copy of the corrupted data can be recovered from the cache.

Abstract: A method and system for binding and verifying between a storage device and hosts are provided. The method includes: sharing system parameters in advance with the hosts by the storage device, where the hosts are to be bound to the storage device; using a programmable read-only memory as the storage device, dividing the programmable read-only memory into m regions, completing the binding between each region and one corresponding host to be bound using the pre-shared system parameters, where m is a positive integer; verifying an identity of a bound host in accordance with the pre-shared system parameters through a zero-knowledge proof method by the storage device; if the verification is successful, starting the storage device and serving the bound host; if the verification is unsuccessful, terminating the starting of the storage device and refusing to serve the bound host.

Abstract: The present invention proposes an information processing system and a volume allocation method making it feasible to reduce overall system operation cost. A replication group to carry out replication is comprised of one or multiple nodes. A storage node classifies respective storage devices mounted thereon into plural storage hierarchies according to the drive type of each of the storage devices for management of the storage devices. A controller node allocates, to each node of the nodes constituting the replication group, a volume for which a storage device of a storage hierarchy suitable for a type of middleware that the node uses and a node type of the node acting in the replication group provides a storage area.

Abstract: Example implementations described herein are directed to management of a first storage system for an on-premise system and a second storage system for a public cloud system. Such example implementations can involve, responsive to an update to one or more of a plurality of snapshot volumes in the first storage system, updating first shared page information stored in the first storage system according to the update to the one or more snapshot volumes, the first shared page information indicative of pages shared between the plurality of snapshot volumes in the first storage system; transmitting instructions to the second storage system to copy the updates to the one or more snapshot volumes from the first shared page information to a second shared page information stored in the second storage system; and executing read or write operations made to the second storage system based on the second shared page information.

Abstract: A storage device includes an application container containing applications, each of which runs in one or more namespaces; flash memory to store data; a host interface to manage communications between the storage device and a host machine; a flash translation layer to translate a first address received from the host machine into a second address in the flash memory; a flash interface to access the data from the second address in the flash memory; and a polymorphic device kernel including an in-storage monitoring engine. The polymorphic device kernel receives a plurality of packets to an application running on the storage device and provides the flash interface based on a namespace associated with the plurality of packets. The in-storage monitoring engine determines a dynamic characteristic of the storage device at run-time based on a matching of a profiling command received from the host machine in a performance table.