Abstract: One example method includes chunking a respective disk of each of a plurality of virtual machines (VM) to create a respective plurality of chunks associated with each of the VMs, creating, based on the chunking process, a cluster comprising one or more of the VMs, creating a VM template whose data and disk structure match respective data and disk structures of each of the VMs in the cluster, and in response to a file operation involving a first one of the VM disks, defragmenting the first VM disk so that a disk structure of the first VM disk is the same as a disk structure of the VM template.

Abstract: A computer storage device having a host interface, a controller, non-volatile storage media, and firmware. The firmware instructs the controller to: store a namespace map to map blocks of logical addresses defined in a namespace to first blocks of logical addresses defined in a capacity of the non-volatile storage media; without changing a size of the namespace, adjust the namespace map to map the blocks of the logical addresses defined in the namespace to second blocks of the logical addresses defined in the capacity of the non-volatile storage media (e.g., to consolidate blocks for performance improvement); and translate the logical addresses in the namespace to physical addresses for the non-volatile storage media using the namespace map.

Abstract: Methods, systems, and devices for plane balancing in a memory system are described. A memory system may select a memory die for writing a set of data. The memory die may include a plurality of planes each of which may include a respective plurality of blocks of memory cells. Based on selecting the memory die, the memory system may determine a first plane of the plurality of planes that has a first quantity of blocks with an availability status and a second plane of the plurality of planes that has a second quantity of blocks with the availability status. The memory system may write the set of data to the plurality of planes, excluding at least the first plane, based at least in part on the first quantity of blocks and the second quantity of blocks.

Abstract: A secure FC NVMe fabric communications system includes a host device having host WWPNs associated with each of its host NQNs, an NVMe target device having a target WWPNs associated with each of its target NQNs, and FC networking device(s) that couple the host device to the NVMe target device. The FC networking device(s) perform, for each host WWPN associated with the host NQNs, host login operations that register the host NQN for that host WWPN as an NVMe host, and perform, for each target WWPN associated with the target NQNs, target login operations that register the target NQN associated with that target WWPN as an NVMe target. The FC networking device(s) then provide, to the host for each host NQN, target NQN details for target NQN(s) zoned for communication with that host NQN to allow respective communication session(s) to be established between the host NQN and those target NQN(s).

Abstract: The present technology relates to a storage device that allows access to the storage device without accessing a main memory of a host by allocating a portion of a mapping area of a buffer memory to a cache area. The storage device includes a memory device including a plurality of memory cells, a memory controller configured to control an operation performed on the memory device, and a buffer memory including a cache area and a mapping area in which mapping data indicating a mapping relationship between a logical block address and a physical block address corresponding to the operation is stored. The buffer memory allocates a portion of the mapping area to the cache area according to an allocation request received from a host, and stores data except for the mapping data in the cache area.

Abstract: In a data storage system that includes two or more storage engines in interconnected by a channel-based fabric, highly deduplicated data is identified and promoted to a dedupe performance tier characterized by mirrors on each of the storage engines. Blocks of deduplication data are scored based on reference counts and read-miss access patterns. Promotion of blocks to the dedupe performance tier and demotion of blocks from the dedupe performance tier are calculated based on the scores. Performance is enhanced by enabling highly deduplicated blocks to be accessed from engine-local memory and engine-local storage via switches rather than the channel-based fabric.

Abstract: A device may provision two or more servers, each of the servers including a network interface. In addition, the device may enable the network interface in each of the provisioned servers, create a shared volume, assign the shared volume to each of the provisioned servers, and enable a clustering application on each of the provisioned servers to form a cluster comprising the provisioned servers, the cluster having a heartbeat via the network interfaces.

Abstract: The present disclosure provides a method and apparatus for parsing contiguous system addresses, and an electronic device. The method for parsing contiguous system addresses comprises: acquiring system level information upon receiving contiguous system addresses; acquiring logical address ranges of objects in a first level based on the contiguous system addresses and the system level information; and when successively acquiring logical address ranges of objects in a second level, . . . , or an Nth level of the system, acquiring logical address ranges of objects in a present level based on a logical address range of a previous level and the system level information, wherein N is the number of levels, and N is an integer greater than or equal to 2, and a logical address range of an object comprises a start address and an end address of the object.

Abstract: A method includes retrieving, with a masker controller job, an object and an associated object ID from a masking bucket that is defined in storage, making a copy of the object, with a masker worker microservice, masking the copy of the object to create a masked object, transmitting the masked object to an object access microservice, with the object access microservice, transmitting the masked object to a deduplication microservice, with the deduplication microservice, deduplicating the masked object, and storing the masked object in the storage.

Abstract: In one embodiment, an apparatus includes: a first queue to store requests that are guaranteed to be delivered to a persistent memory; a second queue to store requests that are not guaranteed to be delivered to the persistent memory; a control circuit to receive the requests and to direct the requests to the first queue or the second queue; and an egress circuit coupled to the first queue to deliver the requests stored in the first queue to the persistent memory even when a power failure occurs. Other embodiments are described and claimed.

Abstract: An operating method of a storage device includes detecting whether a reclaim event has occurred on a source memory area including a plurality of memory areas, setting a reclaim priority value to each of the plurality of memory areas, and performing a reclaim operation on the source memory area according to the reclaim priority value of each of the plurality of memory areas. The reclaim operation moves data stored in the source memory area to a destination memory area.

Abstract: Systems for managing thermal dissipation in multi-stacked memory dies, and methods and computer-readable storage media related thereto, are provided. The system includes memory dies including memory blocks to store data. A processing component is configured to maintain memory block states for the memory blocks. The memory block states include: an open memory block state allowing write operations, and a closed memory block state preventing write operations. The processing component is further configured to: receive a first write command to store first data, and compute first relative distances between open memory blocks in the open memory block state. The processing component is further configured to: select a set of open memory blocks for a first write operation based on the first relative distances so as to manage thermal dissipation, and initiate the first write operation on the first set of open memory blocks.

Abstract: A method for communication includes mapping transport sequence numbers in headers of data packets received from a network to respective buffers in a memory of a host computer. At least a part of the data from payloads of the received data packets is written directly to the respective buffers.

Abstract: There is provided a method for an I/O (input/output) scheduling method, the method comprises: assigning a system call identifier to each of a plurality of I/O requests derived from at least one system call requested by at least one application; sorting the plurality of I/O requests in order of the system call identifier; and transferring the sorted plurality of I/O requests to a computer-readable storage medium. Accordingly, in a mobile or desktop environment in which an application that frequently interacts with the user is executed, it is possible to minimize the read delay time increased due to file fragmentation, and moreover, it is possible to improve the user experience (UX).

Abstract: A computer device, a setting method for a memory module, and a mainboard are provided. The computer device includes a memory module, a processor, and the mainboard. A basic input output system (BIOS) of the mainboard stores a custom extreme memory profile (XMP). When the processor executes the BIOS, so that the computer device displays a user interface (UI), the BIOS displays multiple default XMPs stored in the memory module and the custom XMP through the UI. The BIOS stores one of the default XMPs and the custom XMP to the memory module according to a selecting result of the one of the default XMPs and the custom XMP displayed on the UI.

Abstract: A method for allocating resources of a field-programmable gate array (FPGA), the method comprising: deterministically estimating a maximum latency for executing a network service at the FPGA; determining that the maximum latency is less than a threshold latency value associated with the network service; outputting an acknowledgement indicating that the maximum latency is less than or equal to the threshold latency value; receiving confirmation that the FPGA has been selected to execute the network service within a threshold time period; and deterministically scheduling the resources of the FPGA for executing the network service in response to receiving the confirmation within the threshold time period.

Abstract: Disclosed herein are system, method, and computer program product embodiments for automatically failing over all services operating on a primary region to a secondary region upon detection or notification of a fault in the primary region. When a fault exists on the primary region, the method traverses each cluster containing services operating on the primary region and prepares an input file including a list of service names identifying each service operating on the primary region. Referencing the input file, the method fails over each service from the primary region to the secondary region by modifying a service weight corresponding to each service. This failover process of services may be done simultaneously with failing over any databases corresponding to the failed-over services from the primary region to the secondary region. The method may also introduce a sleep time after modifying each service weight to avoid any potential throttling issues.

Abstract: A system for an artificial neural network (ANN) includes a main memory including a dynamic memory cell electrically coupled to a bit line and a word line; and a memory controller configured to selectively omit a restore operation during a read operation of the dynamic memory cell. The main memory may be configured to selectively omit the restoration operation during the read operation of the dynamic memory cell by controlling a voltage applied to the word line. The memory controller may be further configured to determine whether to perform the restoration operation by determining whether data stored in the dynamic memory cell is reused. Thus, the system optimizes an ANN operation of the processor by utilizing the ANN data locality of the ANN model, which operates at a processor-memory level.

Abstract: Embodiments are directed to in-place erasure code transcoding for distributed file systems. A file system may be divided into a first partition associated with a first erasure code and a second partition second partition is associated with a second erasure code. If the second partition has sufficient storage space to store protection groups further actions may be performed, including: determining block stores in the first partition associated with the protection groups; transcoding contents of the block stores into other block stores based on the second erasure code; storing the other block stores in the second partition; deleting the block stores from the first partition; shifting another portion of the storage space from the first partition to the second partition such that the shifted other portion increases a size of the second partition to provide sufficient storage space for other protection groups; or the like.

Abstract: A system, method, and machine-readable storage medium for restoring a data object for a specified active time period are provided. In some embodiments, the method includes receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier. The method also includes determining, by the storage device, that the active time period has elapsed. The method further includes responsive to a determination that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier. Data objects that are stored on the accessible tier are accessible by the client, and data objects that are stored on the archive tier are inaccessible by the client.

Abstract: Systems and methods for verifying a firewall for a cloud provider. The method includes receiving by a timelord module configured with access to a plurality of HTTP attacks that incorporate random tokens, an updated policy ok signal that was generated by an external element. The timelord module responds by (a) loading a first HTTP attack with a first expected response that is either forbidden or accepted, the first HTTP attack including the random tokens in a form of a header key value parameter; (b) sending the first HTTP attack to the firewall; (c) comparing a response from the firewall to the first HTTP attack with the first expected response; and (d) incrementing the first HTTP attack and repeating (a)-(c) until the plurality of HTTP attacks has been sent; and deleting the random tokens after the plurality of HTTP attacks have been sent.

Abstract: A method for managing a memory associated with PCIe SSD including: generating memory pools of equal size from a predefined size of contiguous physical memory, each of the memory pools manages a memory request of different size and is associated with a respective predefined size of memory request; dividing each of the memory pools into first set of memory pages, each having a size equal to maximum size among the predefined size of the memory request associated with the respective memory pool; dividing each of the first set of memory pages into second set of memory pages, each having a size equal to the predefined size of the memory request associated with respective memory pool; and managing the contiguous physical memory by allocating a memory page from the second set of memory pages fora memory request corresponding to the size of the second set of memory pages.

Abstract: The described technology is generally directed towards data movement from data storage clusters. A data movement job can be split into data movement tasks, and the data movement tasks can be distributed among multiple nodes of a data storage cluster. In order to distribute the tasks, a data store that identifies the tasks can be split into multiple segments, and different groups of nodes can be assigned affinities to process tasks identified in the different segments. Furthermore, the nodes of each group of nodes can be assigned different start positions within their storage segment, to reduce the likelihood of contention between nodes in connection with claiming a same task. Some of the tasks can be generated in an already claimed state, which also reduces contention and allows for more efficient operation.

Abstract: A flash device includes user storage space for storing user data and over provisioning space for garbage collection within the flash device. The flash device receives an operation instruction, and then performs an operation on user data stored in the user storage space based on the operation instruction. Further, the flash device identifies a changed size of user data after performing the operation. Based on the changed size of data, a target adjustment parameter is identified. Further, the flash device adjusts the capacity of the over provisioning space according to the target adjustment parameter.

Abstract: A data storage device includes a memory device and a controller coupled to the memory device. The memory device includes at least a first super device and a second super device. Each of the super devices includes a plurality of active zones and a threshold value for a number of cold zones. The controller classifies zones as either a cold zone or hot zone depending the number of resets to the zone. If the number of resets to the zone is greater than a threshold reset value, then the zone is classified as a hot zone, otherwise the zone is classified as a cold zone. The controller is configured to determine that the number of cold zones is greater than the threshold value for a super device and move data from at least one cold zone from the super device to a zone of another super device.

Abstract: Techniques are described herein that are capable of dynamically re-allocating computing resources while maintaining network connection(s). Applications of users are run in a computing unit. Computing resources are allocated among the applications based at least in part on dynamic demands of the applications for the computing resources and resource limits associated with the respective customers. In a first example, the computing resources are dynamically re-allocated among the applications, as a result of changing the resource limit of at least one customer, while maintaining at least one network connection between a client device of each customer and at least one respective application. In a second example, the computing resources are dynamically re-allocated among the applications, as a result of changing the resource limit of at least one customer, while maintaining at least one network connection between an interface and a client device of each customer.

Abstract: A data storage device and method for detecting malware on a data storage device. The device includes a non-volatile storage medium configured to store at least one file system control block and user data block(s) to store user data. The file system control block comprises at least one reference data structure. The data storage device further comprises a buffer to temporarily store user data. The data storage device further comprises a controller to scan each write command in the user data to be transferred for protocol commands or malicious data. The controller also stops the data transfer of user data from the buffer to the non-volatile storage medium if at least one of protocol commands or malicious data is detected in at least one write command.

Abstract: A method includes receiving data objects, determining a predicted lifespan of each data object, and instantiating multiple shard files. Each shard file has an associated predicted lifespan range. The method also includes writing each data object into a corresponding shard file having the associated predicted lifespan range that includes the predicted lifespan of the respective data object and storing the shard files in a distributed system. The method also includes determining whether any stored shard files satisfy a compaction criteria based on a number of deleted data objects in each corresponding stored shard file. For each stored shard file satisfying the compaction criteria, the method also includes compacting the stored shard file by rewriting the remaining data objects of the stored shard file into a new shard file.

Abstract: The present technology includes a controller and a memory system including the same. The controller includes a descriptor manager configured to generate descriptors including logical addresses and physical addresses respectively mapped to the logical addresses, a map cache configured to store the descriptors in a linear structure and a binary tree structure, and a map search engine configured to search for a descriptor corresponding to a logical address received from an external device among the descriptors stored in the map cache by performing a linear search method, a binary search method, or both, according to a status of the map cache.

Abstract: A circular buffer architecture includes a memory coupled to a producer circuit and a consumer circuit. The memory is configured to store objects. The memory can include memory banks. The number of the memory banks is less than a number of the objects. The circular buffer can include hardware locks configured to reserve selected ones of the memory banks for use by the producer circuit or the consumer circuit. The circular buffer can include a buffer controller coupled to the memory and configured to track a plurality of positions. The positions can include a consumer bank position, a consumer object position, a producer bank position, and a producer object position. The buffer controller is configured to allocate selected ones of the objects from the memory banks to the producer circuit and to the consumer circuit according to the tracked positions and using the hardware locks.

Abstract: In a memory system in an embodiment, in a case of normal operation, a control unit returns a write completion response upon completion of reception of write data from a host, and writes the write data into nonvolatile memory in a multiple values. In a case of unordinary power-off, changeover to operation using a backup battery is conducted and the control unit writes dirty data that is not completed in writing into the nonvolatile memory, into the nonvolatile memory with two values. When next boot, the control unit reads the dirty data from the nonvolatile memory into the volatile memory, and thereafter writes the dirty data into the nonvolatile memory in a multiple values.

Abstract: A storage system determines a change in storage system geometry that affects at least one previously formed resiliency group of storage system resources. The storage system forms at least one resiliency group of storage system resources in accordance with rules that emphasize stability of formation of resiliency groups. The storage system accesses data stripes across storage system resources of resiliency groups.

Abstract: A system can identify a group of time-series telemetry data that represents performance metrics of computing devices, wherein the group of time-series telemetry data is represented according to a first number of dimensions. The system can compress the group of time-series telemetry data, wherein the compressed group of time-series telemetry data is represented according to a second number of dimensions that is less than the first number of dimensions, wherein the compressed group of time-series telemetry data is homomorphic. The system can perform a data science operation on the compressed group of time-series telemetry data to produce a first result, wherein the first result is within a predetermined threshold value of a second result of performing the data science operation on the group of time-series telemetry data.

Abstract: The present disclosure provides a method and apparatus for writing data in an append mode, a device and a storage medium. The present disclosure relates to the field of cloud storage technology, and can be applied to a cloud platform. The method includes: acquiring to-be-written data, and writing the to-be-written data into a magnetic disk; writing first index information of the to-be-written data in a memory; storing, in response to determining that the number of pieces of second index information is greater than a first preset threshold, the second index information into storage hardware, the second index information including the first index information; and writing first identifier information corresponding to the second index information in the memory.

Abstract: In a storage system, processing related to data replication includes associating first control information with a logical volume and a snapshot and second control information with data on a pool volume. Data of the logical volume and the snapshot is managed by associating the first control information with the second control information. A time series of the logical volume and one or more snapshots is managed using generation information associated with the first control information, for each piece of data on the pool volume. Generation information indicating a generation in which the data is created is managed in association with the second control information. Invalidation of the first and second control information asynchronously with a processing of data related to the logical volume and the snapshot is executed. Whether the invalidation is possible is determined by referring to the generation information associated with the first and second control information.

Abstract: The present disclosure relates to utilizing a buffer management system to efficiently manage and deallocate memory buffers utilized by multiple processing roles on computer hardware devices. For example, the buffer management system utilizes distributed decentralized memory buffer monitoring in connection with augmented buffer pointers to deallocate memory buffers accurately and efficiently. In this manner, the buffer management system provides an efficient approach for multiple processing roles to consume source data stored in a memory buffer and to deallocate the buffer only after all roles have finished using it.

Abstract: In a particular embodiment, a virtual namespace identifier is mapped to one or more volumes stored among a pool of storage resources, wherein at least a first storage system and a second storage system are utilized to provide the storage resources. The virtual namespace identifier is migrated among the pool of storage resources to virtualize a data path for the one or more volumes.

Abstract: A method comprising receiving a plurality of signatures representing one or more proprietary files from a vendor generated without disclosure of the proprietary files, each signature corresponding to a segment of a proprietary file. The method further comprising and validating each of the plurality of the signatures, to ensure that the signatures are the proprietary code of the vendor. The method further comprises adding the plurality of the signatures to a global database, the global database used to compare the proprietary data of the vendor to other technology data and taking various action based on the results of the comparison.

Abstract: An object compression system of a storage service may provide a user-friendly and cost-efficient solution to manage stored objects for users of the storage service. The object compression system may automatically monitor individual objects in an object-based storage system of the storage service. Based on one or more characteristics and additional features of the objects, the object compression system may generate respective determinations whether to compress the individual objects. Responsive to determinations to compress the objects, the object compression system may determine compression algorithms for individual objects. The object compression system may compress the objects according to respective compression algorithms to create compressed files. The object compression system may store the compressed files in a tier different from the objects and delete the objects from the storage service.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to reduce read-modify-write cycles for non-aligned writes. An example apparatus includes a memory that includes a plurality of memory banks, an interface configured to be coupled to a central processing unit, the interface to obtain a write operation from the central processing unit, wherein the write operation is to write a subset of the plurality of memory banks, and bank processing logic coupled to the interface and to the memory, the bank processing logic to determine the subset of the plurality of memory banks to write based on the write operation, and determine whether to cause a read operation to be performed in response to the write operation based on whether a number of addresses in the subset of the plurality of memory banks to write satisfies a threshold.

Abstract: Described are techniques for managing data locations of derived storage objects. The techniques include accessing a primary metadata tree providing a lookup path using a virtual address to locate data for a primary object in physical storage pointed to by a leaf node of the primary metadata tree and providing a sub-tree from a leaf node of the primary metadata tree associated with the primary object, the sub-tree providing lookup paths using virtual addresses for derived objects. Wherein a derived object is a view of the primary object at a specific point in time, with copy leaf nodes of the sub-tree pointing to stored data of the derived objects. The techniques further include maintaining an ancestry graph associated with the sub-tree with the ancestry graph linking derived object identifiers to provide an ancestral chain lookup to identify derived object identifiers of the closest stored physical data of a derived object.

Abstract: Examples described herein relate to migrating a virtualized execution environment from a first platform to a second platform while retaining use of namespace identifiers and permitting issuance of storage transactions by the virtualized execution environment. The first platform can include a first central processing unit or a first network interface. The second platform can include a central processing unit that is different that the first central processing unit and a network interface that is the same or different than the first network interface. The second platform can retain access permissions and target media format independent of one or more identifiers associated with the migrated virtualized execution environment at the second platform. Unperformed storage transactions can be migrated to the second platform for execution.

Abstract: An illustrative method includes receiving a request to create a storage volume; identifying, based on the request and on a configuration file propagated among a plurality of storage nodes in a cluster, status indicators of the storage nodes; identifying, based on the request, a size of the storage volume; identifying, based on the request, a replication factor representing a number of storage nodes that are to be replicated within a cluster for the storage volume; identifying, based on one or more characteristics associated with the storage volume, a traffic priority for the storage volume, the traffic priority representing a hierarchy that determines and prioritizes which traffic is allocated to available hardware and network resources in a particular order; creating, based on the status indicators, the size, the replication factor, and the traffic priority, the storage volume on one or more of the plurality of storage nodes.

Abstract: A system for storing multiple petabytes of raw log data from cloud-based source data buckets into internal partitioned data storage in a data lake is provided. The system is configured to: deploy a log partitioner cluster comprising a plurality of log partitioner service instances for storing the raw log data in a partitioned manner; associate one or more of the source data buckets to each of a plurality of deployed log partitioner service instances by providing associated configuration metadata from a configuration service; fetch, via the log partitioner cluster, raw log data from associated source data buckets based on the associated configuration metadata, wherein the associated configuration metadata provides instructions for use by a log partitioner service instance to onboard raw log data; and place fetched raw log data, via the log partitioner cluster, in the internal partitioned log storage in accordance with the associated configuration metadata.

Abstract: System, method, and circuitry for generating content for a programmable computing device based on user-selected memory regions. Contiguous regions that share memory access attributes are merged, interleaved contiguous regions that share at least one nested attribute are defined into combined regions, and remaining regions are defined as separate independent regions. A memory protection unit (MPU) region size closest to a size of each defined region is identified. If the start address of each region aligns with the address structure of the MPU region size, then those regions are assigned to MPU regions having the MPU region size; otherwise, another MPU size that aligns with the size of the regions is selected and those regions are assigned to MPU regions having that size. Content is generated to configure settings of MPU regions of the programmable computing device for the merged contiguous regions, the combined region, and the independent regions.

Abstract: A method for recovering files from a filesystem stored across sparse files in a cloud environment is described. According to the method, a data management system may receive a request to read the files. The data management system may identify one or more target address ranges corresponding to the files indicated via the request. The data management system may read index information for the sparse files in the cloud environment. The index information may indicate respective address ranges for data blocks within the sparse files. The data management system may identify one or more data blocks within one or more sparse files as corresponding to address ranges that overlap with the one or more target address ranges based on the index information. The data management system may transmit, to the cloud environment, one or more read requests for the identified one or more data blocks.

Abstract: A read-disturb-based read temperature adjustment system includes a read temperature adjustment subsystem that is coupled to the storage device. The read temperature adjustment subsystem identifies data that is stored in a block in the storage device and that is associated with a read temperature that is based on read disturb information associated with the block, determines a read temperature adjustment level for the data based on one or more data characteristics of the data and, based on the read temperature adjustment level, transmits a read temperature adjustment instruction to the storage device that causes the storage device to adjust the read temperature associated with the data.

Abstract: A read-disturb-based logical storage read temperature information maintenance system includes a global read temperature identification subsystem coupled to storage device(s). Each storage device identifies, from a physical block in that storage device, current read disturb information associated with a row provided by the physical block in that storage device, and maps the current read disturb information to logical storage element(s) included in a logical-to-physical storage element mapping for that storage device along with previous read disturb information that was previously mapped to those logical storage element(s) included in the logical-to-physical storage element mapping for that storage device.

Abstract: A first type memory and a second type memory may be identified in a computing system. The second type memory is slower than the first type memory while having a greater storage capacity compared to the first type memory. An application process executing in the computing system may be identified. A region of the first type memory may be provided as a cache of the second type memory for the application process.

Abstract: Adjusting storage capacity in a computing system that includes a computing device configured to send access requests to a storage device characterized by a first storage capacity, including: reducing data; determining, in dependence upon an amount of storage capacity saved by reducing the data, an updated storage capacity for the storage device; and exporting an updated storage capacity to the computing device.