Abstract: Disclosed is a system comprising a memory device and a processing device, operatively coupled with the memory device, to perform operations including identifying a group of memory cells corresponding to a first range of logical block addresses (LBAs). The operations performed by the processing device further include receiving a memory access command with respect to the group of memory cells. The operations performed by the processing device further include responsive to determining that a data structure associated with the group of memory cells references a second range of LBAs, blocking the memory access command; responsive to determining that the first range of LBAs does not include each LBA of the second range of LBAs, performing, on the group of memory cells, a trim operation; and responsive to determining that the data structure indicates the completion of the trim operation, performing a memory access operation specified by the memory access command.

Abstract: A system including sensors of an advanced driver assistance system and a data recorder. The data recorder has: a volatile memory; a non-volatile memory configured with a file system region and a buffer region; and a processor configured to implement a file system mounted in the file system region. The data recorder records outputs from the sensors via the volatile memory into the buffer region in a cyclic way and, in response to an event, retrieve sensor data from the buffer region and store the sensor data into files organized under the file system mounted in the file system region.

Abstract: Memory management processes allocate and recycle pages of replication data pointer (RDP) metadata space in shared memory. When the RDP page currently allocated to an IO thread becomes full, that RDP page is released, and a new RDP page is allocated to the IO thread. The released page eventually becomes fragmented and is added to a list of RDP pages that are ranked based on partial fullness. An IO thread that needs a new RDP page is allocated a mostly empty RDP page from the ranked list, if such a page is available. Otherwise, a new completely empty RDP page is allocated to the IO thread. Use of the ranked lists reduces latency associated with allocation of new RDP pages. Contention between IO threads for RDP metadata space is reduced because each IO thread has exclusive rights to the free RDP metadata space in its currently allocated page.

Abstract: Systems and methods for implementing maintenance operations on storage devices in place of drive-based maintenance operations are disclosed. According to an aspect, a system includes a storage controller configured to receive a plurality of media scan configurations for maintenance from a plurality of storage devices. The data maintenance algorithms implemented across storage device and storage controller is also configured to tune and/or disable drive-based maintenance routines on one or more of the plurality of storage devices. Further, the BMC and/or storage controller is configured to perform controller-based maintenance operations in replacement of the drive-based maintenance routines of the one or more of the plurality of storage devices based on the received plurality of media scan configurations.

Abstract: A method for use in a storage system, comprising: identifying snapshot storage space consumption information that corresponds to a snapshot storage space; identifying a snapshot management metric that is associated with the snapshot storage space, the snapshot management metric being identified based on the snapshot storage space consumption information; and outputting an indication of the snapshot management metric for presentation to a user.

Abstract: An example system includes a processor to partition an arithmetic circuit representing a homomorphically encrypted (HE) code into a number of execution blocks. The processor can generate, for each of the number of execution blocks, manifests describing access patterns for a number of different machine environments. The processor can then dynamically execute the HE code by selecting successive blocks to execute based on an access pattern calculated for the execution block corresponding to a detected current machine environment.

Abstract: A data center for data backup and replication, including a pool of multiple storage units for storing a journal of I/O write commands issued at respective times, wherein the journal spans a history window of a pre-specified time length, and a journal manager for dynamically allocating more storage units for storing the journal as the journal size increases, and for dynamically releasing storage units as the journal size decreases.

Abstract: Systems and methods of communicating use device level throttling. Some embodiments relate to a method of communicating in a network. The systems and methods can provide a first communication associated with a device for issuance, issue the first communication if a queue depth value for the device is less than an issued communication value, and listing the first communication on a pend list for the device if a queue depth value for the device is less than the issued communication value.

Abstract: A method, computer program product, and computing system for receiving a first set of input/output (IO) requests for one or more storage objects. One or more IO properties may be extracted from the first set of IO requests. Metadata may be associated with the one or more storage objects using one or more machine learning models based upon, at least in part, the one or more IO properties extracted from the first set of IO requests, thus defining storage object metadata. One or more IO processing rules may be enabled based upon, at least in part, the storage object metadata. A subsequent set of IO requests may be received. Processing of the subsequent set of IO requests on the one or more storage objects may be optimized based upon, at least in part, the storage object metadata and the one or more IO processing rules associated with the one or more storage objects.

Abstract: An application-level memory control group of a first application may be created when the first application is opened. An anonymous page of the first application is added to a least recently used linked list of the application-level memory control group, and a file page of the first application is added to a global least recently used linked list. An application-level memory control group is created in a dimension of an application, and an anonymous page of the application is managed in a refined manner. In addition, a file page of the application-level memory control group may be managed based on a global least recently used linked list.

Abstract: Described herein are techniques for improving transfer of metadata from a metadata database to a database stored in a data system, such as a data warehouse. The metadata may be written into the metadata database with a version stamp, which is monotonic increasing register value, and a partition identifier, which can be generated using attribute values of the metadata. A plurality of readers can scan the metadata database based on version stamp and partition identifier values to export the metadata to a cloud storage location. From the cloud storage location, the exported data can be auto ingested into the database, which includes a journal and snapshot table.

Abstract: Apparatuses, systems, and methods for using defrag levels to reduce data loss are provided herein. In a number of embodiments of the present disclosure, a method can include setting a first defrag level for a memory device, determining if a buffer is full while performing defrag operations on the memory device according to the first defrag level, setting a second defrag level for the memory device in response to determining the buffer is full while performing defrag operations according to the first defrag level.

Abstract: An integrated circuit includes a plurality of control circuits and a resource controller. Each of the control circuits is configured to send a work request, execute a work procedure according to an authorization code corresponding to the work procedure, and generate a completion signal after the work procedure is completed. The resource controller includes a storage circuit stores a plurality of index values; a processor circuit updates, according to each of the completion signals, a status of the index value associated with the authorization code corresponding to the work procedure; and a conversion circuit configured to, in response to each of the work requests, output, when a status of at least one of the index values is resource-available, an authorization code associated with one index value whose status is resource-available.

Abstract: A computer-implemented data structure for a singly linked list for data exchange between a write process and at least one read process. The data structure includes a first pointer data structure and a second pointer data structure, wherein the first pointer data structure points to the oldest element in the list, and the second pointer data structure points to the next writable element in the list. The data structure also includes a third pointer data structure, a fourth pointer data structure, and a fifth pointer data structure, wherein the third pointer data structure has a corresponding first counter, the fourth pointer data structure has a corresponding second counter, and the fifth pointer data structure has a corresponding counter.

Abstract: A storage system includes a storage device, a processor, and a storage unit. The processor provides a volume configured on the storage device to a mainframe server. The processor manages data handled by an open-architecture server, using a first slot having a first slot length as a unit, in the volume, and manages data handled by the mainframe server, using a second slot having a second slot length shorter than the first slot length as a unit, the first slot storing therein a predetermined number of the second slots, in the volume. The processor performs a process using one of the first slot and the second slot as a unit, depending on the type of the process.

Abstract: A storage system with storage drives and a processing device establishes resiliency groups of storage system resources. The storage system determines an explicit trade-off between data survivability over resource failures and data capacity efficiency, for the resiliency groups. Responsive to adding at least one storage drive, the storage system establishes re-formed resiliency groups according to the explicit trade-off, without decreasing data survivability. The storage system may bias to have more and narrower resiliency groups to increase mean time to data loss.

Abstract: A data storage device processes a mixed workload including a plurality of superblocks to be written to and read from a plurality of memory dies, where each of the plurality of superblocks to be apportioned among the plurality of memory dies. The data storage device writes a first data stripe associated with a first superblock to the plurality of memory dies according to a sequential write pattern, and reads the first data stripe associated with the first superblock from the plurality of memory dies according to a sequential read pattern. The sequential write pattern causes the controller to write to the plurality of memory dies in a first order of memory dies. The sequential read pattern causes the controller to read from the plurality of memory dies in a second order of memory dies different from the first order of memory dies, thereby reducing read collisions.

Abstract: The technologies described herein are generally directed toward retrieving data from streaming storage. In an embodiment, a method can include receiving an application data request that identifies application data to be retrieved from a sequence of stored data chunks that correspond to a stored stream of data. The method can further include, based on the application data request, estimating a first estimated location of the application data, with the first estimated location including an identified chunk of a sequence of chunks. Further, the method can include, based on the application data request and a characteristic of the identified chunk, retrieving, by the system, a first data block that is estimated to comprise the application data, resulting in a first retrieved data block.

Abstract: Persistent storage may contain a list of discovery commands, the discovery commands respectively associated with lists of network addresses. A discovery validation application, when executed by one or more processors, may be configured to: read, from the persistent storage, the list of discovery commands and the lists of network addresses; for each discovery command in the list of discovery commands, transmit, by way of one or more proxy servers deployed external to the system, the discovery command to each network address in the respectively associated list of network addresses; receive, by way of the one or more proxy servers, discovery results respectively corresponding to each of the discovery commands that were transmitted, wherein the discovery results either indicate success or failure of the discovery commands; and write, to the persistent storage, the discovery results.

Abstract: The present disclosure relates to a communication scheme and system for combining an IoT technology with a 5G communication system for supporting a higher data transfer rate beyond a 4G system. The present disclosure may be applied to intelligent services (e.g. smart home, smart building, smart city, smart car or connected car, health care, digital education, retail, and security and safety services) on the basis of a 5G communication technology and an IoT-related technology. The present disclosure provides a method and an apparatus for supporting compression and decompression of an Ethernet header.

Abstract: An apparatus in an illustrative embodiment comprises at least one processing device, with the processing device being configured to receive in a storage system from a host device an indication of a data size utilized in a multi-path layer of the host device to select paths for delivery of input-output operations to different storage controllers of the storage system, to determine in the storage system a prefetch data size based at least in part on the data size indication received from the host device, and responsive to detection in the storage system of sequential data reads in input-output operations received from the host device, to prefetch from one or more backend storage devices of the storage system, into a memory associated with a particular one of the storage controllers of the storage system, an amount of data that is determined based at least in part on the prefetch data size.

Abstract: A resilient software Redundant Array of Independent Disk (RAID)/management communication system includes a chassis housing a software RAID subsystem coupled to a plurality of storage devices that are also coupled to a management subsystem. The software RAID subsystem designates a first storage device in the plurality of storage devices as a primary storage device and a second storage device in the plurality of storage devices as a secondary storage device, and uses the respective storage device memory subsystem in the first storage device to transmit first management communications with the management subsystem. If the software RAID subsystem determines that the first storage device is unavailable, it uses the respective storage device memory subsystem in the second storage device to transmit second management communications with the management subsystem.

Abstract: An illustrative distributed storage system detects a request to resize an online volume that provides persistent storage for a containerized application running in a container system, wherein the online volume is backed by a virtual block device created in device namespace using a device mapper virtualization of data blocks of one or more storage devices. The distributed storage system performs, in response to the request, a resize process to resize the online volume. The resizing of the online volume includes resizing the virtual block device. In some examples, a file system implemented on the virtual block device is also resized while the online volume is online. The storage system may manage inflight IOs over the virtual block device and the online volume such that the resize process is performed without error.

Abstract: Systems and methods for the meta-estimation of data structures representing identifiers are disclosed. The system maintain one or more data records comprising one or more identifiers and one or more attributes. Using the data records, the system can generate a first data structure, such as a probabilistic data structure, that represents the plurality of data records. The first data structure can have a plurality of registers. The system can identify a subset of the plurality of registers that are equal to a predetermined value, and generate a second data structure that represents the subset of the plurality of registers. The system can then store the second data structure as a meta-estimation of the first, and can utilize the second data structure in further processing operations.

Abstract: A Universal Serial Bus (USB) device configured to build a program, in a host machine, on an alternative CPU architecture. The USB device comprises a USB interface adapted to be communicatively coupled to the host machine. The USB device further comprises a memory module configured to store a package to build on, in the host machine, the alternative CPU architecture. The USB device further comprises a System-on-a-Chip (SoC) configured to access the stored package from the memory module. The SoC is further configured to, when a connection between the USB interface and the host machine is established, automatically run the stored package in the host machine.

Abstract: A processor includes a memory subunit that includes a status register and an execution engine unit to: randomly select a load operation to monitor; determine a re-order buffer identifier of the load operation; and transmit the re-order buffer identifier to the memory subsystem. Responsive to receipt of the re-order buffer identifier, the first memory subunit is to store a piece of information, related to a status of the load operation, in the status register. The processor also includes logic to, responsive to detection of retirement of the load operation, store memory information in memory-related fields of a record of a memory buffer. The memory information includes auxiliary information (AUX) and access latency information, wherein one of the auxiliary information or the access latency information includes the piece of information, from the status register, stored in a particular field of the memory-related fields.

Abstract: A non-volatile memory device includes a meta area having a first region storing first initial data, and second regions storing second initial data, different from each other; a user area configured to store user data; an initialization register configured to store the first initial data or update the second initial data in whole or in part; and control logic configured to perform a read operation, a program operation, or an erase operation using the initial data stored in the initialization register.

Abstract: A redundant array of independent disks (raid) array can include one or more virtual disks representing a raid configuration of the raid array. Each of the one or more virtual disks includes a number of physical extents (PEs), where a first PE and a second PE of the PEs have a same size. The first PE is located at a first storage disk of a first storage node of a cluster and the second PE is located at a second storage disk of a second storage node of the cluster.

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: A storage system includes multiple storage nodes. Each storage node includes a first storage device of a first type and a second storage device of a second type, and a performance level of the first storage device is higher than the second storage device. The globe cache includes a first tier comprising the first storage device in each storage node, and a second tier comprising the second storage device in each storage node. The first tier is for storing data with a high access frequency, and the second tier is for storing data with a low access frequency. The management node monitors an access frequency of target data stored in the first tier. When the access frequency of the target data is lower than a threshold, the management node instructs the first storage node to migrate the target data from the first tier to the second tier.

Abstract: An apparatus comprises a memory having a data cache stored therein and a control circuit operably coupled thereto. The control circuit is configured to update that data cache in accordance with a scheduled update time. In the latter regards, by one approach, the control circuit computes selected entries for the data cache prior to the scheduled update time pursuant to a prioritization scheme to provide a substitute data cache. At the scheduled update time, the control circuit switches the substitute data cache for the data cache such that data queries made subsequent to the scheduled update time access the substitute data cache and not the data cache.

Abstract: Occupancy data over time is received for each of several spaces within a building from occupancy sensors that are disposed within each of the spaces. An occupancy value is determined for each of at least some of the several spaces based on the received occupancy data, each occupancy value representative of a percent of time that the respective space was occupied over an identified period of time. The space that had a highest occupancy value over the identified period of time is identified. A utilization value is determined for each of the spaces, wherein the utilization value is representative of a ratio of the occupancy value of the respective space and the highest occupancy value. An operation of the building is changed based at least in part on the utilization value of at least one of the plurality of spaces.

Abstract: A first set of instructions, which is provided access to a first address space, is scheduled for execution at a first hardware thread of a processor. Prior to executing an instruction of a second set of instructions, which accesses a second address space, at the first hardware thread, a determination is made that the second address space is accessible from a second hardware thread of the processor.

Abstract: An embodiment of an integrated circuit may comprise circuitry communicatively coupled to two or more sub-non-uniform memory access clusters (SNCs) to allocate a specified memory space in the two or more SNCs in accordance with a SNC memory allocation policy indicated from a request to initialize the specified memory space. An embodiment of an apparatus may comprise decode circuitry to decode a single instruction, the single instruction to include a field for an opcode, and execution circuitry to execute the decoded instruction according to the opcode to provide an indicated SNC memory allocation policy (e.g., a SNC policy hint). Other embodiments are disclosed and claimed.

Abstract: An apparatus includes a memory controller that includes logic to receive a first memory request having a first request type and a second memory request having a second request type. The apparatus also includes a scheduling unit that includes logic to schedule an order of the first and second memory requests for execution based upon a first parameter value and a second parameter value. The first parameter value corresponds to a utility and energy cost for the first memory request and the second parameter value corresponds to a utility and energy cost for the second memory request.

Abstract: A buffer/interface device of a memory node reads a block of data (e.g., page). As each unit of data (e.g., cache line sized) of the block is read, it is compared against one or more predefined patterns (e.g., all 0's, all 1's, etc.). If the block (page) is only storing one of the predefined patterns, a flag in the page table entry for the block is set to indicate the block is only storing one of the predefined patterns. The physical memory the block was occupying may then be deallocated so other data may be stored using those physical memory addresses.

Abstract: Methods of performing updates to a software image that is disposed in a one time programmable (OTP) memory device are disclosed. The method includes writing an invalid opcode at the beginning of a function that has been modified. This invalid opcode causes an exception. The exception handler determines the address where the invalid opcode was located and searches a random access memory (RAM) dictionary. This RAM dictionary contains entries that each have an original address in the OTP Memory and the patch address in a volatile memory. The exception handler then causes the processing unit to jump to the patch address, where a modified function is located.

Abstract: A method to obtain a cache miss ratio curve where a memory blocks of a cache have variable block sizes. By stacking sets of counters, each set being for a different block size, a stack distance for variable block sizes can be obtained and used to determine a miss ratio curve. Such curve can then be used to select a cache size that is appropriate for an application without requiring excessive memory. Methods can be used for batches of request, can apply limits to block sizes, and rounding for intermediary block sizes, they can be used with pruning, and their space complexity can be held constant.

Abstract: Techniques for incremental stack walking are disclosed, including: performing a stack walk of a runtime stack, at least by traversing the runtime stack from a current frame to a root frame, to obtain a set of stack walking results; storing a cache of the set of stack walking results; and installing, on the runtime stack, a marker frame that marks a boundary of stack frames represented by the set of stack walking results.

Abstract: In solid state memory devices, garbage collection can be a bottleneck in meeting stringent performance requirements of certain hosts that generate a relatively-large amount of data (e.g., hosts that generate video data). With such hosts, the performance drop caused by background garbage collection can result in video recording failures. The memory device and method presented herein performs background operations in such a way as to enhance sustained performance. In general, a counter is maintained that reflects an amount of memory written to by a host, as well as an amount of memory freed by garbage collection operations. Each step of a garbage collection operation can be performed in response to a value of the counter being greater than a threshold for the step such that there is a balance between memory written and memory freed.

Abstract: Disclosed herein are an apparatus and method for an adaptive checkpoint in intermittent computing. The apparatus for an adaptive checkpoint in intermittent computing includes memory in which at least one program is recorded and a processor for executing the program. The program may perform statically setting locations at which checkpoints are to be performed at compile time of program code and dynamically determining whether to perform the checkpoints depending on energy-harvesting conditions at runtime of the program code.

Abstract: Disclosed are various embodiments for optimizing the migration of pages of memory servers in cluster memory systems. To begin, a computing device can mark in a page table of the computing device that a page stored on a first memory host is not present. Then, the computing device can flush a translation lookaside buffer of the computing device. Next, the computing device can copy the page from the first memory host to a second memory host. Moving on, the computing device can update a page mapping table to reflect that the page is stored in the second memory host. Then, the computing device can mark in the page table of the computing device that the page stored in the second memory host is present. Subsequently, the computing device can discard the page stored on the first memory host.

Abstract: A physical layer (PHY) is coupled to a serial, differential link that is to include a number of lanes. The PHY includes a transmitter and a receiver to be coupled to each lane of the number of lanes. The transmitter coupled to each lane is configured to embed a clock with data to be transmitted over the lane, and the PHY periodically issues a blocking link state (BLS) request to cause an agent to enter a BLS to hold off link layer flit transmission for a duration. The PHY utilizes the serial, differential link during the duration for a PHY associated task selected from a group including an in-band reset, an entry into low power state, and an entry into partial width state.

Abstract: Embodiments described herein can reduce a burden associated with analyzing EGM segments obtained from an IMD that monitors for arrhythmic episodes. Respective EGM data and respective classification data is obtained for each arrhythmic episode detected by the IMD during a period of time. A representative R-R interval or HR for each of the arrhythmic episodes is also obtained, wherein a manner for determining the representative R-R interval or HR depends on the type of the arrhythmic episode, such that for at least two different types of arrhythmic episodes the manners differ. One or more arrhythmic episodes is/are selected for which corresponding EGM segments are to be displayed for each type of arrhythmic episode, wherein the selecting is performed based on the representative R-R intervals or HRs that are determined for the plurality of arrhythmic episodes. Additional and alternative embodiments are also described herein.

Abstract: A processor may identify that a new data entry is being generated. The processor may identify that the new data entry is associated with a replica data entry threshold. The replica data entry threshold may indicate a minimum amount of replica data entries to generate. The replica data entries may be substantially similar to the new data entry. The processor may generate an amount of replica data entries. The processor may store the new data entry and the amount of replica data entries in a repository.

Abstract: A data storage method and apparatus. The embodiments include receiving first data and a latency level identifier of the first data, where the latency level identifier of the first data is for indicating a requirement level of the first data for access latency; determining, based on the latency level identifier of the first data and correspondences between memory pages of different types and latency level identifiers, that a memory page corresponding to the first data is a first memory page of storage device, where the storage device includes the first memory page and a second memory page, the first memory page and the second memory page are of different types, memory pages of different types have different access latency; and storing the first data on the first memory page.

Abstract: Host agents running on host servers provide current and historic host application awareness information to a storage array. The storage array uses the historic host application awareness information to train a host application-specific model of IO characteristics. The current host application awareness information and observed IO characteristics are used as inputs to the model to detect malicious activity. The current and historic host application awareness information includes host application roles such as normal operation, creation of a remote backup, cloning of the storage object, snapping of the storage object, restoring the storage object from a snapshot, scanning a database in the storage object, and scanning the storage object.

Abstract: A near-memory processing unit is configured to compress a page present in a normal memory space of a memory when receiving a swap-out command from a host, allocate a memory area in which the compressed page is to be stored in a compressed memory space which is a memory area previously allocated by the host, copy the compressed page into the allocated memory area, generate an entry corresponding to the compressed page, and insert the generated entry into an entry tree.

Abstract: A degree of fragmentation is determined based on a number of holes present in a storage system layout or a portion of a layout. Edges between the holes and used portions of the storage system are tabulated by scanning a storage space. The occurrences of a pattern of used/available allocation units and/or the occurrences of another pattern available/used allocation units are recognized. A fragmentation value is calculated based on occurrences of the patterns in view of the total storage space. The present fragmentation measurement system utilizes the number of occurrences of the holes in assessing fragmentation.

Abstract: A system includes test control circuitry and a memory. The memory includes a memory array, a pre-decode circuit, and a plurality of address latches. Each address latch of the plurality of address latches is configured to operate in a scan chain of a plurality of scan chains for scan testing. A first set of the plurality of address latches each has a data input coupled to a corresponding address pin of the first memory and each has an output coupled to the pre-decode circuit. A second set of the plurality of address latches, mutually exclusive of the first set, each has a data input coupled to a data input of at least one latch in the first set of the plurality of latches and each is configured to not provide any input to the pre-decode circuit.