Abstract: A data storage device and method for host-initiated transactional handling for large data set atomicity across multiple memory commands are provided. In one embodiment, a data storage device is provided comprising a memory and a controller. The controller is configured to commence performance of a plurality of atomic operations; and prior to successful completion of the plurality of atomic operations: determine an available capacity of the memory, wherein memory locations storing data written by the plurality of atomic operations are considered unavailable even though the data is not yet committed to the memory locations; and inform the host of the determined available capacity of the memory. Other embodiments are possible, and each of the embodiments can be used alone or together in combination.

Abstract: A method of operating an object-based storage system, practiced by the storage system, is provided. The method includes establishing a plurality of buckets for objects, in the storage system and establishing a plurality of bucket views in the storage system, each bucket view supporting access to objects of one of the plurality of buckets. The method includes accessing an object of a bucket through one of the plurality of bucket views.

Abstract: A processing device, operatively coupled with the memory device, is configured to determine a first error rate associated a first set of pages of a plurality of pages of a data unit of a memory device, and a second error rate associated with a second set of pages of the plurality of pages of the data unit, determine a first pattern of error rate change for the data unit based on the first error rate and the second error rate, and responsive to determining that the first pattern of error rate change corresponds to a predetermined second pattern of error rate change, perform an action pertaining to defect remediation with respect to the data unit.

Abstract: A storage capacity of a cloud storage system is determined. A recipe contains instructions for reclaiming storage of the cloud storage system. The storage capacity is insufficient to perform the entire recipe. In response, one or more data objects are deleted. A portion of the recipe is executed after the deletion. In some cases, local storage can be used for garbage collection when cloud storage is insufficient to perform even the portion of the recipe. Other embodiments are described and claimed.

Abstract: A method for utilizing shared memory spaces for data lifecycle management in a conversational AI system includes receiving one or more storage requests directing conversational data to multiple nodes of a conversational data object and storing the conversational data that is directed to each different one of the multiple nodes within a different one of multiple discrete memory spaces. Each of the multiple discrete memory spaces is governed by a scope policy defining a lifetime for data stored within the memory space. The method further provides for erasing data of each node of the multiple different nodes of the conversational data object according to the lifetime defined by the scope policy governing the memory space storing the node.

Abstract: A memory system includes a nonvolatile memory including a first region and a second region, and a controller configured to manage a migration operation for a plurality of memory blocks included in the first region and the second region. The controller includes a migration module configured to perform the migration operation by selecting one or more victim blocks based on a number of valid pages of each memory block included in the first region when there is no free storage space in the first region, selecting one or more destination blocks in the second region that respectively correspond to the number of victim blocks, and swapping type information of each of the one or more victim blocks in the first region for type information of a corresponding one of the one or more destination blocks in the second region.

Abstract: Disclosed herein are techniques for forming a thin-film circuit layer on an array of light-emitting diodes (LEDs). LEDs in the array of LEDs can be singulated by various processes, such as etching and ion implantation. Singulating LEDs can be performed before or after forming the thin-film circuit layer on the array of LEDs. The array of LEDs can be bonded to a transparent or non-transparent substrate.

Abstract: Garbage collection is performed for a virtualized storage system whose virtual address space is addressed in extents. Valid data in source extents is copied via a cache into destination extents. Once all valid data in a source extent is copied into one or more destination extents, the source extent may be reused. A source extent is released for reuse only after the one or more destination extents that received the valid data copied from the source extent are determined to be full, and the valid data copied from the source extent to the destination extent via the cache is flushed out of the cache.

Abstract: Systems and methods for transferring firmware updates using an in-band interface are described. In an embodiment, an Information Handling System (IHS) may include a processor and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution, cause the IHS to: receive a firmware update package having a payload; create a namespace in a persistent memory; copy the payload to a segment of the persistent memory associated with the namespace; and write, to an Extensible Firmware Interface (EFI) variable, an Emulator Device Path (EDP) pointing to the payload.

Abstract: A first thread of a garbage collector can determine fields, in class metadata assigned to objects contained in a local memory, that are self-referencing fields. For a plurality of the objects, recursively, the first thread can determine whether the object has at least one child object, indicated by a self-referencing field of the object, that has not been assigned to a destination cache or a previously generated source cache. If so, the first thread can assign the child object to the destination cache to indicate that the child object is live. The first thread can add the destination cache to a global scan queue as a source cache. A second thread of the garbage collector can initiate object scanning on objects indicated in the first source cache. Memory locations where live objects are not located can be reclaimed.

Abstract: A first thread of a garbage collector can determine fields, in class metadata assigned to objects contained in a local memory, that are self-referencing fields. For a plurality of the objects, recursively, the first thread can determine whether the object has at least one child object, indicated by a self-referencing field of the object, that has not been assigned to a destination cache or a previously generated source cache. If so, the first thread can assign the child object to the destination cache to indicate that the child object is live. The first thread can add the destination cache to a global scan queue as a source cache. A second thread of the garbage collector can initiate object scanning on objects indicated in the first source cache. Memory locations where live objects are not located can be reclaimed.

Abstract: In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.

Abstract: Methods, non-transitory machine-readable media, and computing devices for transitioning tasks and interrupt service routines are provided. An example method includes processing, by a plurality of processor cores of a storage controller, tasks and interrupt service routines. A performance statistic is determined corresponding to the plurality of processor cores. Based on detecting that the performance statistic passes a threshold, a number of the plurality of processor cores that are assigned to the tasks and the interrupt service routines are reduced.

Abstract: Methods, systems, and computer program products are included for the intelligent garbage collection of containers. An example method includes providing a garbage collection data structure, the garbage collection data structure including metadata and one or more resource consumption parameters corresponding to the container. The one or more resource consumption parameters are analyzed by a machine-learning function. Based on the analyzing, the container is classified into one or more classes, the one or more classes including at least one of a suspicious container class, a malicious container class, or a normal container class. Based on the classifying, one or more garbage collection actions are performed on the container, including at least one of generating an alert corresponding to the container or reducing the resource consumption of the container.

Abstract: Processing within a computing environment is facilitated by ascertaining locality domain information of a unit of memory to processing capability within the computing environment. Once ascertained, the locality domain information of the unit of memory may be cached in a data structure to facilitate one or more subsequent lookups of the locality domain information associated with one or more affinity evaluations of the unit of memory to processing capability of the computing environment.

Abstract: Erasure coding for scaling-out of a geographically diverse data storage system is disclosed. Chunks can be stored according to a first erasure coding scheme in zones of a geographically diverse data storage system. In response to scaling-out the geographically diverse data storage system, chunks can be moved to store data in a more diverse manner. The more diverse chunk storage can facilitate changing storage from the first erasure coding scheme to a second erasure coding scheme. The second erasure coding scheme can have a lower storage overhead than the first erasure coding scheme. In an aspect, the erasure coding scheme change can occur by combining erasure coding code chunks having complementary coding matrixes. Combining erasure coding code chunks having complementary coding matrixes can consume fewer computing resources than re-encoding data chunks for the second erasure coding scheme in a conventional manner.

Abstract: Embodiments are directed towards apparatuses, methods, and systems associated with a storage reclamation manager that generates a command to reclaim storage locations to assist in management of a storage capacity of a primary storage device. In embodiments, the command is a trim command to inform the storage device of storage locations including invalid data. In embodiments, the command is generated during performance of operations associated with a write-back operation where a cache coupled with the processor stores a first portion of data and the primary storage device stores a corresponding second portion of data. In embodiments, the command is generated during or after a write-back operation of a third portion of data into the cache device. In embodiments, the command assists in reclamation of storage locations in which the second portion of data is stored, to assist in management of a storage capacity of the primary storage device. Additional embodiments may be described and claimed.

Abstract: A parent virtualization manager can create multiple nested virtualization environments on the same physical server. When nested virtualization controller code in a first nested virtualization environment needs to be updated, the parent virtualization manager creates a second nested virtualization environment, installs the updated virtualization controller code in the second nested virtualization environment, and live-migrates virtual machines from the first nested virtualization environment to the second nested virtualization environment. The amount of resources needed for the live migration within the second nested virtualization manager is the amount of resources in the largest virtual machine to be live-migrated, since resources in the first nested virtualization environment can be reclaimed by the parent virtualization manager and allocated to the second nested virtualization manager after a virtual machine has been live-migrated to the second nested virtualization environment.

Abstract: A storage device includes a non-volatile memory including a first block, a second block and a block management area that stores an initial data write time and a final data write time for each of the first block and the second block. The storage device also includes a memory controller that determines a creation time and a modification time for first data in response to a permanently delete command identifying the first data, selects at least one of the first block and the second block to be permanently deleted by comparing the initial data write time and the final data write time for each of the first block and the second block with the creation time and the modification time, and permanently deletes the selected at least one of the first block and the second block.

Abstract: A data storage device includes a memory controller and a memory device. The memory controller includes multiple memory blocks, and each memory block includes multiple pages. The memory controller is coupled to the memory device and configured to access the memory device. In an initialization procedure of the data storage device, the memory controller is configured to determine whether a sudden power-off has occurred during a first write operation to write data to a first memory block, and when a sudden power-off is determined to have occurred during the first write operation, the memory controller is configured to select a second memory block that is and write data to the second memory block in a second write operation.

Abstract: A storage device allocates an address area of an address space to the first virtual address space in accordance with writing onto a first virtual address space. A controller manages an address area in the first virtual address space, in which address area a mapping to the real address space has been removed, as a usage prohibition area. When a use state of the first virtual address space reaches a predetermined criterion, the controller or the storage device adds new continuous address areas to the first virtual address space to expand the first virtual address space. The storage device allocates an area, in which a mapping to the first virtual address space has been removed, to the first virtual address space expanded.

Abstract: A system for updating data content including one or more computer data processors programmed and configured to generate one or more instances of data programming objects, each instance of a data programming object representing a data record and properties of the data record, at least one property corresponding to a scheduled change in the data record. The system includes an object monitor to which one or more status updates of the one or more instances of data programming objects are transmitted to, the status updates including the property corresponding to the time of the scheduled change in the data record.

Abstract: A controller includes a processor suitable for controlling a memory device to write normal map data and sequential map data; and a map data manager suitable for generating and storing a normal map table and a sequential map table, wherein the map data manager, when normal user data is sequential user data, sequentially records the normal map data in the normal map table, merges the normal map data in units, each of a size of a write segment, to generate the sequential map data when a size of the recorded normal map data is greater than the size of the write segment, and records the sequential map data in the sequential map table.

Abstract: A storage controller is provided. The storage controller includes circuitry configured to utilize a format command to change a storage volume coupled to the storage controller from a first format to a second format and memory configured to store a data structure for first and second format indications for the storage volume. The storage controller determines if a selected band is initialized to the second format, and if the selected band is not initialized to the second format, the storage controller initializes the selected band to the second format and updates the data structure to indicate the selected band is initialized to the second format.

Abstract: One embodiment provides a method, including: generating, for each of a plurality of storage volumes, an actual used storage capacity model and identifying a potential storage capacity savings using the actual used capacity model, wherein each of the plurality of storage volumes has been identified as a candidate for migration to a thin provisioned volume; generating, for each of the plurality of storage volumes, an input/output profile model and identifying a potential change in performance of an application accessing the storage volume using the input/output profile model; generating, for each of the plurality of storage volumes, a growth profile and identifying a potential change in capacity using the growth profile; and determining, using an optimization algorithm, a subset of the plurality of storage volumes to be migrated to thin provisioned volumes based upon the volume capacity model, the performance model, and the volume growth profile.

Abstract: A computer-implemented method and a system for ensuring right-to-erasure compliance during data recovery are disclosed. The method may include intercepting a request to perform a recovery process to restore backup data, automatically comparing a backup image of requested data with a record of right-to-erasure orders, and determining, based on the comparison, that the backup image includes individual data related to at least one right-to-erasure order. The record of right-to-erasure orders may include at least one of an identity of an individual, at least one creation and/or execution date of a right-to-erasure order, and/or a list of backup images associated with a right-to-erasure order. The method may further include erasing the individual data to comply with the at least one right-to-erasure order, recording the erasure of the individual data in an audit log, and completing the recovery process for the requested data.

Abstract: Disclosed herein are techniques for reducing the number of write operations performed to a storage-class memory in a virtualized environment. In one embodiment, when a memory page is de-allocated from a virtual machine, the memory page and/or the subpages of the memory page are marked as “trimmed” in a control table such that any read to the memory page or subpages is denied, and no physical memory initialization is performed to the memory page or subpages. A de-allocated memory page or subpage is only initialized when it is reallocated and is to be written to by the virtual machine to which the memory page is reallocated.

Abstract: Processing within a computing environment is facilitated by ascertaining locality domain information of a unit of memory to processing capability within the computing environment. Once ascertained, the locality domain information of the unit of memory may be cached in a data structure to facilitate one or more subsequent lookups of the locality domain information associated with one or more affinity evaluations of the unit of memory to processing capability of the computing environment.

Abstract: This application relates to the technical field of network communications, and discloses a method and an apparatus for removing redundant information of a terminal. The method includes the steps of: calculating an estimated redundancy value of at least one type of redundant information in a terminal; determining that a redundancy value of a type of redundant information reaches a threshold of the type of redundancy value; prompting a user to remove redundant information; and according to confirmation from the user, removing the type of redundant information or all redundant information. The apparatus includes a first calculating unit, a determining unit, a prompting unit and a cleanup unit.

Abstract: Systems and methods for enhanced read recovery based on write time information are described. In one embodiment, the systems and methods include opening a block of flash memory cells for programming, tracking a block open time, and performing a read operation of a programmed page from the block based at least in part on the block open time. In some embodiments, the block includes a plurality of pages, each page including a plurality of flash memory cells. In some cases, the block open time includes an amount of time between the block opening for programming to a time the block closes for programming.

Abstract: A method disclosed herein includes operating a processor of a system on a chip in a configuration mode until completion of a set of tasks, and operating the processor in a normal operation mode after completion of the set of tasks. During the configuration mode, the method includes performing steps of sending by the processor of configuration information to a configuration programming block, sending by the configuration programming block of the configuration information to one or more electronic components to thereby complete a first subset of the set of tasks, while permitting the processor to complete a second subset of the set of tasks, and sending by the configuration programming block of a notification to the processor after completing the first subset of the set of tasks.

Abstract: A marking capability is used to provide an indication of whether a block of memory is being used by a guest control program to back an address translation structure. The marking capability includes setting an indicator in one or more locations associated with the block of memory. In a further aspect, the marking capability includes resetting the one or more indicators to indicate that the block of memory is no longer being used by the guest control program to back the address translation structure.

Abstract: A technique processes input/output (I/O) requests from a set of host computers. The technique utilizes data storage equipment which includes a set of physical storage drives and storage processing circuitry which accesses the set of physical storage drives. The technique involves storing, by the storage processing circuitry, a set of storage drive objects in main memory. The set of storage drive objects includes a set of zeroed chunk tables. Each storage drive object (i) represents a physical storage drive and (ii) includes a zeroed chunk table which identifies storage chunks of that physical storage drive that have been initialized to zero. The technique further involves receiving, by the storage processing circuitry, I/O requests from the set of host computers, and performing, by the storage processing circuitry, I/O tasks in response to the I/O requests. The I/O tasks include zero on demand operations based on the set of zeroed chunk tables.

Abstract: Optimizations are provided for frame management operations, including a clear operation and/or a set storage key operation, requested by pageable guests. The operations are performed, absent host intervention, on frames not resident in host memory. The operations may be specified in an instruction issued by the pageable guests.

Abstract: A method of providing a file system for an electronic device includes organizing a plurality of Non-Volatile Dual In-Line Memory Module-Ps (NVDIMM-Ps) of a memory device of the electronic device into a plurality of groups based on location information of the NVDIMM-Ps, and creating a single File System Instance (FSI) for each group included in the plurality of groups.

Abstract: A microcontroller includes a processor, a memory, a working space management unit and a memory monitor. The memory has at least a working space, wherein the working space includes a plurality of blocks . The working space management unit is implemented by software, and is arranged for managing the working space of the first memory. The memory monitor is implemented by hardware circuit, and is arranged for monitoring the blocks, and recording monitoring results corresponding to the blocks of the first memory, wherein the recorded monitoring results comprise information about whether data of the blocks is modified or not.

Abstract: Technical solutions for reducing page invalidation broadcasts in virtual storage management are described. One general aspect includes a method including allocating, by a storage manager, a virtual memory page to a memory buffer that is used by an application being executed by a multiprocessor system, the virtual memory page being allocated from an address space of the application. The method also includes recording, by a memory management unit, a mapping between the virtual memory page and a physical location in a memory. The method also includes in response to a request, from the application, to deallocate the memory buffer, delaying invalidation of the mapping between the virtual memory page and the physical location in a memory, based on a count of free frames in the address space of the application.

Abstract: The present invention relates to a computer implemented method and database management system for storing data on a storage device. A plurality of empty files at the storage device is pre-allocated in a processor of the database management system. Each of the empty files has a pre-determined file size. The empty files are overwritten sequentially with a plurality of data blocks. Each of the data blocks having a pre-determined size. The present invention relates to a database management system (DBMS) that coordinates both the physical and the logical components of data management.

Abstract: A system includes memory and a hardware processor. The memory includes a load-monitored region register (LMRR) and a sampled data address register (SDAR). The hardware processor is configured to perform a garbage collection process that reclaims unused objects of the memory. The hardware processor further executes a performance monitoring process that provides information indicating a utilization of an instruction performed by the hardware processor. The SDAR is configured to store first data generated according to the garbage process and second data generated according to the performance monitoring process.

Abstract: A computer system is configured to perform a garbage collection process within a computing environment. The computer system includes a memory having a load-monitored region managed by a runtime environment. A computer processor is configured to perform operations including executing an instruction to load a doubleword, where the instruction includes a destination register. The operations further include loading into the destination register a pointer address of a pointer when the pointer indicated by the instruction points to a first location located in the load-monitored region. The operations further include invoking a garbage collection event-based branch (EBB) in response to reading the pointer address from the destination register. In response to invoking the garbage collection EBB, an object indicated by the pointer address is moved via a handler from the first location in memory to a second location in memory that is located outside of the load-monitored region.

Abstract: The technique relates to a method and apparatus for dynamic destruction of data in a remote data storage platform. This involves receiving a first set of data records with random values and then updating the random values associated with the subsets of the first set of data records into actual values through one or more update operations. After sequential steps of updates, a second set of data records with actual values are obtained. After working of this data for a period of time the owner of the data again begins updating the actual values associated with the subset of the second set of data records into random values. When all the data records are updated to random values the owner of the data successfully ends the Service Level Agreement period.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for virtual block storage. In one aspect, a method includes receiving a request to initialize a virtual machine, the virtual machine having an associated virtual block device; accessing a file map comprising a plurality of file map entries; determining file map entries corresponding to blocks of data allocated to the virtual block device and one or more files in which the blocks of data allocated to the virtual block device are stored; determining that a particular one of the blocks allocated to the virtual block device has been written to a new position not associated with the particular block in the file map; and updating the position associated with the particular block to the new position.

Abstract: A computer-implemented method includes performing, by each of a plurality of crawlers, a random walk of a plurality of objects in a heap, where the plurality of objects are memory objects allocated for execution of an application. A timestamp of each object of the plurality of objects is updated, when the object is visited by a crawler of the plurality of crawlers. Garbage is identified, by a computer processor, based at least in part on the timestamp of each object of the plurality of objects. The garbage is reclaimed.

Abstract: A method for frame choosing in a computing system during a storage constraint condition is provided. The method includes calculating, with a processor, a use-grouped-threshold, comparing a number of available grouped frames to the calculated use-grouped-threshold, returning a decision to use a grouped frame in an event that the number of the available grouped frames exceeds the calculated use-grouped-threshold and returning a decision to use an above-the-bar frame in an event that the number of the available grouped frames is less than or equal to the calculated use-grouped-threshold.

Abstract: A method for frame choosing in a computing system during a storage constraint condition is provided. The method includes calculating, with a processor, a use-grouped-threshold, comparing a number of available grouped frames to the calculated use-grouped-threshold, returning a decision to use a grouped frame in an event that the number of the available grouped frames exceeds the calculated use-grouped-threshold and returning a decision to use an above-the-bar frame in an event that the number of the available grouped frames is less than or equal to the calculated use-grouped-threshold.

Abstract: An apparatus and method are described for asynchronous tile-based rendering control. In one embodiment of the invention, there is a delay between when the graphics driver queues the GPU commands for rendering and when the GPU begins executing. During this delay, the graphics driver receives additional information or data about whether cache evictions may be inhibited. As such, it allows the graphics driver to defer the cache eviction control of its render cache until it has this extra information. By doing so, it reduces the memory bandwidth required for rendering 3D graphics applications and in turn reduces the power consumption of the GPU.

Abstract: A computer program product for eliminating access to data within a writable storage media cartridge includes a computer readable medium having program instructions embodied therewith. The program instructions are executable by a processing circuit to cause the processing circuit to determine whether a first portion of data on the writable storage media cartridge is encrypted, and determine whether key shredding is enabled. In response to determining that key shredding is not enabled, the processing circuit causes performance of a long erase on at least the encrypted first portion of data, and causes shredding of an encryption key related to said encrypted first portion of data.

Abstract: Systems and methods for sanitizing physical storage in cloud computing and virtual environments. When logical storage is decommissioned in a virtual environment, the underlying physical storage is logically disassociated. However, the underlying physical data blocks remain intact until they are overwritten. Since there is no control over when, or even if, the physical data is ever overwritten, the remaining data is susceptible to compromise. The present disclosure provides a secure erase application that securely erases physical storage associated with to-be deleted resources, such as virtual data stores, virtual images, snapshots and raw virtual disks.

Abstract: Processing a metric of a component of a SDN can include registering a unique identifier associated with the metric in storage of the SDN.

Abstract: A method and system for fast file initialization is provided. An initialization request to create or extend a file is received. The initialization request comprises or identifies file template metadata. A set of allocation units are allocated, the set of allocation units comprising at least one allocation unit for the file on a primary storage medium without initializing at least a portion of the file on the primary storage medium. The file template metadata is stored in a cache. The cache resides in at least one of volatile memory and persistent flash storage. A second request is received corresponding to a particular allocation unit of the set of allocation units. Particular file template metadata associated with the particular allocation unit is obtained. In response to the second request, at least a portion of a new allocation unit is generated.