Abstract: An archiving apparatus that realizes high-speed seek processes and the like by setting a logical object table for each container file with a predetermined size, and closing the container file under a predetermined condition is provided. A data processing section that executes control of access to a recording medium generates a logical object table for managing a container file including logical objects which are recorded data units, and records the logical object table on a memory. In a case where a prescribed condition is satisfied, for example, the container file size has become equal to or larger than a prescribed end reference value, and so on, while a process on the container file is being executed, the logical object table is read out from the memory, and recorded on the recording medium, and the container file is closed.

Abstract: A SD Card including, in one implementation, a memory array, a controller coupled to the memory array, and a bus for transferring data between the memory array and a host device in communication with the SD Card. The controller is configured to perform background maintenance operations on the memory array during execution of a read command received from the host device.

Abstract: A method for execution by a storage unit in a dispersed storage network (DSN) includes selecting a storage zone of a memory device of the storage unit based on zone allocation parameters, and designating the selected storage zone as open for writes. A data slice is received via a network for storage. The data slice is written sequentially at a memory location of the one of storage zone based on determining that the storage zone is designated as open for writes. A pointer corresponding to the data slice that indicates the storage zone and the memory location is generated. A read request is received via the network from a requesting entity that indicates the data slice. The data slice is retrieved from the memory device based on the pointer, and is transmitted to the requesting entity.

Abstract: A method for dynamically assigning memory bandwidth to multiple processor units, which are connected via a data connection to a shared memory unit. In an initialization phase, each of the multiple processor units are assigned an initial value of a usable memory bandwidth, and a permissible range for a mean usage of the memory bandwidth is determined. Subsequently, the assigned memory bandwidths are checked repeatedly and adjusted if needed, a present value of a mean usage of the memory bandwidth by the multiple processor units being determined, and, if this present value is outside the permissible range, the values of the usable memory bandwidth are adjusted for at least a part of the multiple processor units.

Abstract: Techniques for extending a storage system having a first pool involve adding, in response to a request, second storage devices, wherein the first pool is generated using first storage devices and based on a first standard. The first pool includes first stripes created using the first standard, and the number of the second storage devices equals a first stripe width associated with the first standard. Such techniques further involve creating a second pool using the second storage devices and based on a second standard, wherein a second stripe width associated with the second standard equals the first stripe width. Such techniques further involve creating second stripes in the second pool using the second storage devices and based on the second standard. Such techniques further involve storing data of at least one of the first stripes to a corresponding stripe of the second stripes according to a data shuffle rule.

Abstract: The processor system includes a processor coupled to a memory having a plurality of memory banks and a region configurable as a heap region. At least one memory bank is allocated to the heap region dependent on a predetermined memory size required for execution of at least one cryptographic operation. At least one further memory bank is allocated to the heap region. The processor system may switch between first and second operating states. The first operating state has a lower power consumption than the second operating state. The processor system switches between a first and second operating mode by setting at least one memory bank and at least one further memory bank to an active state. The processor system switches between the second and first operating mode by setting at least one memory bank to a retention state and the at least one further memory bank to a power-down state.

Abstract: Storage volumes are pre-provisioned in the operating system of a storage system before they are required to be assigned to an emulation on the storage system. Details of the previously created storage volumes are stored in a management database. If a storage volume is required, the process that needs the storage volume obtains details about a pre-provisioned storage volume from the management database, and instructs the storage system operating system to add the storage volume to a storage group for the process. By pre-provisioning storage volumes in the operating system, it is possible to greatly reduce the amount of time it takes to add storage volumes to processes. The number of storage volumes to be pre-created can be determined based on a regression between the previous storage volume usage and time, and a deterministically obtained value of a number of filesystems that will be created in an upcoming time interval.

Abstract: A log generated over a time period of garbage collection cycles of a microservice is reviewed. The log includes garbage collection events and pause times for each event. A determination is made that a threshold number of consecutive garbage collection events has been reached where each consecutive event had a pause time exceeding a threshold pause time. Upon the determination, a change is made to a configuration file associated with the microservice to reduce the pause times for a next time period. Once the microservice enters an idle state, a command is generated to restart the microservice for the change in the configuration file to take effect.

Abstract: An approach is described to provide a method, a computer program product, and a computer system to implement hole punching. The described approach provides an automated way to free up space without requiring manual intervention by a DBA to manually reorganize database objects to free up space.

Abstract: An apparatus comprises a processing device configured to classify an input/output pattern of a given storage object that is stored utilizing a first type of storage resources associated with a first storage tier in the clustered storage system, and to identify, for the classified input/output pattern, a performance difference between utilizing first and second types of storage resources associated with first and second storage tiers in the clustered storage system. The processing device is further configured to determine, based at least in part on the identified performance difference, whether to move the given storage object from the first type of storage resources associated with the first storage tier to the second type of storage resources associated with the second storage tier in the clustered storage system and to move, responsive to the determination, the given storage object to the second type of storage resources associated with the second storage tier.

Abstract: The present invention facilitates efficient and effective utilization of unified virtual addresses across multiple components. In one embodiment, the presented new approach or solution uses Operating System (OS) allocation on the central processing unit (CPU) combined with graphics processing unit (GPU) driver mappings to provide a unified virtual address (VA) across both GPU and CPU. The new approach helps ensure that a GPU VA pointer does not collide with a CPU pointer provided by OS CPU allocation (e.g., like one returned by “malloc” C runtime API, etc.).

Abstract: Integrated circuits that perform offset-based memory management using offset values for allocated, de-allocated, and free memory portions. An example method includes receiving a first request for allocating a first portion of a memory module coupled to an integrated circuit, and determining a first address space for allocating the first portion of the memory module based on one or more offset values.

Abstract: Methods, systems, and devices for fast mode for a memory device are described. In some examples, a memory device may be initialized during a system boot procedure. The memory device may support multiple modes of operation, including at least a first mode that includes a first set of capabilities, and a second made that includes the first set of capabilities, as well as one or more additional capabilities. The memory device may perform the initialization while operating the memory device according to the first mode, which may include delaying one or more actions associated with the one or more additional capabilities. After the system boot procedure is complete, the memory device may operate according to the second mode, which may include performing an action delayed during the system boot.

Abstract: Methods, apparatus, and processor-readable storage media for determining storage system configuration recommendations based on vertical sectors and size parameters using machine learning techniques are provided herein.

Abstract: According to one embodiment, a controller constructs a plurality of block groups. The plurality of block groups include at least a first block group configured using a first type block group and a second block group configured using a second block group. The first type block group includes a plurality of non-defective blocks obtained by selecting one or more non-defective blocks in an equal number from each of a plurality of dies or each of a plurality of planes. The second type block group includes a plurality of non-defective blocks. The number of non-defective blocks included in the second type block group is equal to the number of non-defective blocks included in the first type block.

Abstract: A method is used in managing storage space in storage systems. Storage space reserved by a storage object from a set of storage tiers is evaluated. A data storage system includes the first and second storage tiers configured such that performance characteristics associated with the first storage tier is different from the second storage tier. Based on the evaluation, storage space available and consumed in each storage tier of the set of storage tiers is determined.

Abstract: According to some embodiments, a system, method and non-transitory, computer readable medium are provided comprising a memory storing processor-executable program code; and a processing unit to cause the system to: receive a range of persistent volume disk size values from a cloud service provider; receive a value for an upper bound of a number of persistent volume disks attachable to a virtual machine per the cloud service; determine a number of persistent volume disks based on the upper bound, wherein the number is at least two; generate a plurality of configurations of the determined number of persistent volume disks, wherein a configuration is provided for each persistent volume disk size value, and each configuration divides the persistent volume disk size value between two or more persistent volume disks; and aggregate the generated plurality of configurations in a decision table. Numerous other aspects are provided.

Abstract: A method for reading data in a storage device is provided. The method includes receiving a read command from a host device, wherein the read command indicates stored data in the storage device and a Logical Block Address (LBA) of the stored data; obtaining a Physical Block Number (PBN) based on the LBA and a Logical to Physical (L2P) mapping; determining whether the PBN corresponds to a volatile memory of the storage device; reading the stored data directly from the volatile memory based on the PBN corresponding to the volatile memory; incrementing a read counter associated with the PBN based on the stored data being read directly from the volatile memory; and reading the stored data from a non-volatile memory of the storage device based on the PBN not corresponding to the volatile memory.

Abstract: Methods, systems, and devices for a read operation using compressed memory are described. An apparatus may include a host system coupled with a non-volatile memory device and a volatile memory device. The host system may store, in the volatile memory device, a compressed copy of data stored in the non-volatile memory device, for example, based on a score assigned to the data. The host system may identify that the compressed copy of the data is stored in the volatile memory device and may transmit a read command to the volatile memory device that includes a logical address associated with a logical block address of the data stored in the non-volatile memory device. The host system may receive the compressed copy of the data from the volatile memory device in response to the read command and may decompress the data.

Abstract: Systems and methods for quality of service management are provided. According to one embodiment, a non-transitory computer-readable medium comprises instructions that when executed by the processing resource cause the processing resource to collect, from a plurality of volumes on a per-volume basis, one or more real-time performance metrics for one or more compute processes executing on the one or more computer systems, generate an inertial parameter for one or more volumes in the plurality of volumes, and generate an instruction that cause a processor to use the real-time performance metrics and the inertial parameter to determine whether to transfer responsibility for a compute process on a first storage server node to a second storage server node.

Abstract: A computer-implemented method comprises receiving, by a processor, search requests to search a database; receiving a reindex request to reindex information in the database based on a new ontology for the database or a new number of shards for a first index server; initiating, by the processor, generation of a second index for the database while a first index managed by the first index server continues to be used live for responding to received search requests; completing the generation of the second index during a certain period when no search request is sent to the first index server; and in response to the completing, using the second index live for responding to received search requests.

Abstract: According to an aspect, there are provided an apparatus and a method for providing an access to a memory circuit. A read enable input initializing a wait state counter configured to count a predetermined number of clock cycles is received (200) and the wait state counter output is monitored. A memory ready signal output is received (202) from the memory circuit at a synchronizer input and the output signal of the synchronizer is monitored. An ON-state data ready signal is provided (204) when either the wait state counter has elapsed, or the output signal of the synchronizer is in ON-state.

Abstract: In various embodiments, a software program uses hardware features of a parallel processor to checkpoint a context associated with an execution of a software application on the parallel processor. The software program uses a preemption feature of the parallel processor to cause the parallel processor to stop executing instructions in accordance with the context. The software program then causes the parallel processor to collect state data associated with the context. After generating a checkpoint based on the state data, the software program causes the parallel processor to resume executing instructions in accordance with the context.

Abstract: Embodiments of the invention relate to methods and systems for efficiently backing up and restoring assets such as files and folders in the form of slices and streams. In one or more embodiments, assets such as files and folders that are to be backed up are placed in appropriate network slice queues, which are then assigned to network streams. The slices/assets are assigned in such a way that each stream has a similar cost and throughput. The backup is performed, and the streams are stored in their own backup containers until a restoration is needed. Once a restoration is needed, the meta-data for the backup is used to restore the files and folders, forming the asset back to their appropriate locations in the target file-system. This results in efficient use of network resources, while minimizing the amount of work the hosts and/or clients must perform during a backup or restoration.

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 an extreme memory profile (XMP). When the processor performs the BIOS so that the computer device displays a user interface (UI), the BIOS displays an overclocking option corresponding to the XMP in a selection list of the UI. When the BIOS receives a selection request corresponding to the overclocking option of the selection list, the BIOS reads multiple memory setting parameters corresponding to the XMP, and configures the memory module according to the memory setting parameters.

Abstract: Memory access circuitry enforces ownership rights for memory regions. A given memory region is associated with an owner realm specified from multiple realms, each realm corresponding to a portion of at least one software process executed by processing circuitry. A realm management unit (RMU) is provided to perform realm management operations for managing the realms. The memory access circuitry controls access to a given memory region in dependence on at least one status attribute specifying whether the given memory region is an RMU-private memory region reserved for exclusive access by the RMU.

Abstract: The system determines a first and a second snapshot of memory usage by processes in a computing system based on a predetermined time interval, wherein a respective snapshot indicates, for a respective process, memory usage corresponding to memory types including private memory and shared memory. The system computes, for processes common to the first and the second snapshots, a likelihood of memory leak for a process and memory type based on: an increase in an amount of heap memory and private memory; an increase in an amount of shared memory; and an increase in a total amount of private and shared memory. The system compares the computed likelihood for the process with a predetermined threshold. Responsive to determining that the computed likelihood for the process exceeds the predetermined threshold, the system performs a corrective action to address memory leak associated with the process.

Abstract: A storage system includes a first node mounting two controllers. The two controllers of the first node are subjected to setting of redundancy such that the two controllers belong to differing redundancy groups, respectively. When a configuration change is requested due to addition of a second node mounting one controller to the storage system, the second node sets the controller of the second node belongs to a redundancy group to which either of the two controllers of the first node belongs, and the first node changes the setting of redundancy such that setting information on the redundancy group of either of the two controllers of the first node does not change; and deactivates a controller of the first node for which the setting information on the redundancy group changes as a result of a change in the setting of redundancy.

Abstract: The memory sub-systems of the present disclosure selects, for memory scans, a memory block which has a highest page fill ratio. In one embodiment, the memory sub-system identifies a number of block stripes located on a logical unit (LU) identified by a logical unit number (LUN), where the LU is one of a plurality of LUs of a memory device. The sub-system determines a fill ratio for each of the plurality of block stripes. The sub-system selects, among the block stripes, a block stripe with a highest fill ratio. The sub-system identifies, from the selected block stripe, a memory block of the LU. The sub-system performs a memory scan operation on the memory block of the memory device.

Abstract: A method is used in managing storage operations in storage systems. Based on a set of criteria, an amount of storage resources required to perform a storage operation is determined. The storage operation is directed to fault tolerant storage devices. The amount of storage resources is allocated prior to start performing the storage operation. The storage operation is performed by using the allocated storage resources.

Abstract: A method, performed by an electronic device, includes: based on a target event associated with an application being initiated, transmitting initiation of the target event to a runtime environment of the application, and after transmitting the initiation of the target event to the runtime environment, based on a memory value allocated to the application exceeding a threshold value for determining whether to initiate a garbage collection, skipping performing the garbage collection and updating a bound memory value, defined in the garbage collection, and the threshold value.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed for allocation in a victim cache system. An example apparatus includes a first cache storage, a second cache storage, a cache controller coupled to the first cache storage and the second cache storage and operable to receive a memory operation that specifies an address, determine, based on the address, that the memory operation evicts a first set of data from the first cache storage, determine that the first set of data is unmodified relative to an extended memory, and cause the first set of data to be stored in the second cache storage.

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.

Abstract: Disclosed is a system that comprises a memory device and a processing device, operatively coupled with the memory device, to perform operations that include receiving, by the processing device, a trim command on the memory device, wherein the trim command references a range of logical block addresses (LBAs). The operations performed by the processing device further include identifying a group of memory cells corresponding to the range of LBAs, wherein the group of memory cells comprises one or more management units (MUs). The operations performed by the processing device further include updating a data structure associated with the group of memory cells to reference the request; receiving a memory access command with respect to the group of memory cells.

Abstract: Techniques are described herein for prediction of an buffer pool size (BPS). Before performing BPS prediction, gathered data are used to determine whether a target workload is in a steady state. Historical utilization data gathered while the workload is in a steady state are used to predict object-specific BPS components for database objects, accessed by the target workload, that are identified for BPS analysis based on shares of the total disk I/O requests, for the workload, that are attributed to the respective objects. Preference of analysis is given to objects that are associated with larger shares of disk I/O activity. An object-specific BPS component is determined based on a coverage function that returns a percentage of the database object size (on disk) that should be available in the buffer pool for that database object. The percentage is determined using either a heuristic-based or a machine learning-based approach.

Abstract: A storage system includes a management node and multiple storage nodes. Each storage node includes a first storage device of a first type (e.g., DRAM) and a second storage device of a second type (e.g., SCM), and a performance level of the first storage device is higher than the second storage device. The management node creates a globe cache including 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 of the globe cache.

Abstract: Methods and apparatus for rebuilding and storing data in a storage network that includes a plurality of storage units. In an embodiment, a processing module(s) of storage network identifies a storage error associated with a data object stored in a first storage unit of a set of storage units. In response, the processing module obtains storage network configuration information associated with the data object, and rebuilds the data object to produce a rebuilt data object. The processing module further identifies, based on the storage network configuration information, a candidate storage unit(s) for storage of the rebuilt data object and determines an available storage capacity level of the candidate storage unit. In response to determining that the available storage capacity level of the candidate storage unit is sufficient to store the rebuilt data object, the processing module facilitates storage of the rebuilt data object in the candidate storage unit.

Abstract: A processing system of a storage network operates by: receiving a write request to store a data object; selecting a selected memory type of a plurality of memory types to store the data object, based on object parameters associated with the data object; selecting a selected memory to store the data object, the selected memory having the selected memory type of the plurality of memory types; and facilitating storage of the data object in the selected memory having the selected memory type of the plurality of memory types, wherein the data object is dispersed error encoded and stored as a plurality of encoded data slices.

Abstract: Techniques are provided for data management across a persistent memory tier and a file system tier. A block within a persistent memory tier of a node is determined to have up-to-date data compared to a corresponding block within a file system tier of the node. The corresponding block may be marked as a dirty block within the file system tier. Location information of a location of the block within the persistent memory tier is encoded into a container associated with the corresponding block. In response to receiving a read operation, the location information is obtained from the container. The up-to-date data is retrieved from the block within the persistent memory tier using the location information for processing the read operation.

Abstract: A method, computer program product, and computer system for maintaining a back pointer from a physical layer block (PLB) to a virtual layer block (VLB) in a multi-level hierarchical file system. A generation number may be maintained in the VLB, wherein the generation number may indicate when data is moved from the PLB to another PLB. An object may be reconstructed in the multi-level hierarchical file system based upon, at least in part, at least one of the back pointer and the generation number.

Abstract: Examples described herein relate to prioritizing read input/output (IO) queues in non-volatile memory express (NVME) storage devices. An NVME controller includes a host port, which may be associated with a host and communicate with NVME storage devices. A utilization time of the host port is determined. In response to determining that the utilization time of the host port is below a host port utilization threshold, the NVME controller may create a candidate list of NVME storage devices based on utilizations, throughputs, busy time periods, and IO request completions of the NVME storage devices. For each NVME storage device included in the candidate list, a number of read requests in a read IO queue at the NVME storage device may be determined. A priority rank may be assigned to the read IO queue at each NVME storage device based on the number of read requests in that read IO queue.

Abstract: The invention introduces a method, an apparatus and a non-transitory computer program product for storing data in flash memory. The method is performed by a processing unit when loading and executing program code of a flash translation layer to include: dividing storage space of a flash module into a first region and a second region; programming data belonging to a first partition type received from a host side into first physical blocks of the first region only; and programming data belonging to a second partition type received from the host side into the first physical blocks of the first region and the second physical blocks of the second region. With the region division and the policy for writing data into the regions in terms of data characteristics of different partition types, storage space of the flash module would be used more effective.

Abstract: In a memory component programmed to operate in a first operating mode and having a page buffer and a fixed-width data interface, N bits of a command/address value are decoded to access one of 2N columns of data within the page-buffer, with that column of data output via the fixed-width data interface over a first burst interval. If programmed to operate in a second operating mode, M bits of the command/address value are decoded to access a larger column of data—one of 2M columns of data within the page buffer, where M<N—with that larger column of data output via the fixed-width data interface over a second burst interval longer than the first burst interval.

Abstract: Improving the runtime and discovery recovery performance for cloud-based logical volume management systems when performing mirror write operations. A mirror write consistency check (MWCC) policy that incorporates aspects of Active MWCC policies and Passive MWCC policies are utilized to more efficiently ensure that data is properly mirrored from a first copy of a logical volume to the second copy of a logical volume (as well as to potentially multiple other copies of the logical volume).

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: A data storage device includes a memory device and a controller coupled to the memory device. The controller is configured to receive key value (KV) pair data from a host device, where the KV pair data includes a key and a value, determine whether the KV pair data corresponds to a first tier or a second tier, where the second tier has a lower performance requirement than the first tier, and program the value of the KV pair data as padding data when the KV pair data corresponds to the second tier. The determining is based on a received hint of the KV pair data, a relative performance of the KV pair data, and a length of the KV pair data. The controller is configured reclassify the KV pair data based on a read frequency of the KV pair data.

Abstract: An initialization data memory space allocation system includes a memory system having a memory space that includes an initialization data bucket that reserves a contiguous subset of the memory space for initialization data. Each initialization engine that is coupled to the memory system is configured during initialization operations to allocate, for that initialization engine, a portion of the contiguous subset of the memory space reserved by the initialization data bucket, and then store initialization data in that portion of the contiguous subset of the memory space reserved by the initialization data bucket. A runtime engine that is coupled to the memory system is configured, during runtime operations, to claim the contiguous subset of the memory space reserved for initialization data by the initialization data bucket for runtime data, and store runtime data in at least a portion of the contiguous subset of the memory space.

Abstract: A data protection system configured to backup a time series database is provided. The data protection system may be integrated with or have access to consolidation policies of the time series database. The backup policy and backup retention policy are set by monitoring the consolidation policy and adjusting the backup policy to ensure that the data in the time series database is protected prior to being downscaled, discarded or otherwise consolidated.

Abstract: A method including, responsive to receiving a request identifying a volume and indicating a command to take a snapshot of the volume, mapping a second logical grouping of data to reference the first logical grouping of data, and remapping the first volume to map to the second logical grouping of data instead of the first logical grouping of data such that the first volume remains addressable with similar access permissions before and after creating the snapshot. The method also includes, in response to receiving a write request targeting the second logical grouping, splitting the second logical grouping into a plurality of ranges including a first range and a second range; wherein the first range of the second logical grouping maps to the first logical grouping, and the write request is performed on the second range of the second logical grouping.

Abstract: A method, computer program product, and computing system for receiving data for storage in a storage system. The data may be written to a head entry of a log buffer, wherein the log buffer includes a plurality of data entries for flushing to the storage system. At least a portion of the plurality of data entries of the log buffer may be flushed, via a plurality of threads, to the storage system based upon, at least in part, a tail entry of the log buffer. A queue of committed data entries may be updated, via each thread of the plurality of threads, with one or more data entries of the log buffer flushed to the storage system by each thread. A new tail entry of the log buffer may be determined, via a thread of the plurality of threads, based upon, at least in part, the queue of committed data entries.