Abstract: A method for identifying a drive malfunction source includes receiving as input multiple drive event records each recorded by a different one of multiple storage drives in a mass storage system. Among other data, each one of the drive event records including internal tasks performed by the associated storage drive and communications transmitted between an external host and a controller of the associated storage drive. The method may further include comparing the drive event records using a processor to identify at least one discrepancy in recorded drive events indicative of the drive malfunction source.

Abstract: An apparatus may include a redundant array of independent disks (RAID) array including a plurality of solid state drives (SSDs). The apparatus may further include a RAID array controller coupled to the plurality of SSDs. The RAID array controller may be configured to determine whether one or more logical block addresses (LBAs) of a stripe of the RAID array are unmapped. The one or more LBAs may be associated with one or more SSDs of the plurality of SSDs. The RAID array controller may be configured to determine data corresponding to the stripe based on the determination of whether the one or more LBAs are unmapped. RAID operations (such has Rebuild, Exposed Mode Read, and/or Parity Resync operations) may be optimized based on the knowledge of which LBAs are mapped and unmapped.

Abstract: A method and apparatus for validating operation of a data volume on a storage medium. A data integrity component is provided which writes data blocks to the volume in a sequence, each data block storing a sequence number and also write status information specifying the sequence numbers of those preceding data blocks in the stream which are still being written to the volume at the time the data block is generated. Data validation is performed by reading back the stored data blocks from the volume and checking that the sequence numbers stored in them match those that should be present based on the sequence numbers stored in the write status information of the last-written data block found on the volume.

Abstract: A storage cartridge is provided comprising a system connector configured to be hot-pluggable with an external receiving system. The storage cartridge includes a plurality of storage receiving connectors, each of which can be configured to receive either a hot-pluggable storage drive or a storage drive that has not designed to be natively hot-pluggable. In some embodiments, each of the plurality of storage receiving connectors is configured to receive a storage drive that has not been designed to be natively hot-pluggable. In addition, electrical connections are provided between the system connector and the plurality of storage receiving connectors that enable a plurality of the not natively hot-pluggable storage drives engaged with the storage cartridge to communicate with the external receiving system via the system connector configured to be hot-pluggable.

Abstract: In a method of operating the memory system, the method includes detecting whether data of a read-out unit read from a first cell region has an error correction code (ECC) failure, in response to an external read-out request for the read-out unit, recovering and outputting the data of the read-out unit by performing Redundant Array of Inexpensive Disk (RAID) recovery by using data and RAID parity read from other cell regions, recovering a plurality of pieces of data stored in the first cell region by performing the RAID recovery using the data and RAID parity read from the other cell regions, and migrating the recovered plurality of pieces of data to a second cell region in units of cell regions.

Abstract: Components of a data object are distributed throughout a data storage system. Manifests are used to store the locations of the components of data objects in a data storage system to allow for subsequent reconstruction of the data objects. The manifests may be stored in another data storage system when cost projections indicate it being economical to do so. If a manifest for a data object becomes lost or otherwise inaccessible, clues are used to regenerate the manifest, thereby providing a continued ability to access the components of the data object to reconstruct the data object.

Abstract: The present disclosure provides a system and method for enabling cableless connections within a server system. The server system comprises a motherboard (MB) module, a power distribution board (PDB) module, power supply unit (PSU) modules, network interface controller (NIC) modules, fan modules, graphic process unit (GPU) modules, and a hyperscale GPU accelerator (HGX) platform. These components of the server system are interconnected by a plurality of circuit boards. The plurality of circuit boards includes, but is not limited to, a main board, linking boards (BDs), a PDB, a fan board, a power linking board, peripheral-component-interconnect-express (PCIe) expander boards, a plurality of NVLink bridges, and HGX base boards.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for rebuilding redundant array of independent disks (RAID). The method comprises dividing a RAID group including a disk into a plurality of stripes in response to detecting a failure of the disk, and each stripe includes a disk slice across all disks of the RAID group. The method further comprises mapping the plurality of stripes to other RAID groups respectively and rebuilding data on the plurality of stripes in other RAID groups. Embodiments of the present disclosure rebuild in parallel the stripes of the failed RAID group in other RAID groups, thereby effectively increasing the rebuilding speed for RAID and ensuring reliability of the RAID group.

Abstract: Systems, methods, and computer readable storage mediums for optimizing performance in a storage system. A volume may be mapped to an anchor medium through an indirection layer. When a snapshot is taken of the volume, the allocation of a new anchor medium is delayed until a write operation targeting the volume is received. When a write operation targeting the volume is received, a new anchor medium may be allocated for only a portion of the volume corresponding to the portion of the volume which is targeted by the write operation. Also, when a snapshot is taken of the volume, read optimization operations are performed only the portions of the volume which have changed since the previous snapshot.

Abstract: A method and system for recovering data from a storage system is disclosed. The method includes predicting, by a fault tolerance device, a fault within the storage system comprising one or more disk array enclosures, wherein each of the one or more disk array enclosures comprise a plurality of disks. The method further includes identifying, by the fault tolerance device, a data block going to be affected by occurrence of the predicted fault, wherein the data block is identified within a first disk in the plurality of disks. The method includes extracting, by the fault tolerance device, data stored in the data block before occurrence of the predicted fault. The method further includes transferring, by the fault tolerance device, the data extracted from the data block to a second disk not going to be affected by occurrence of the predicted fault.

Abstract: Mapped RAID (Redundant Array of Independent Disks) technology divides individual drives into multiple drive extents, allocates the drive extents to RAID extent entries in a RAID mapping table, and performs “end of life” detection and proactive copying of data between data storage drives on a per drive extent basis. A given drive extent is determined to be “end of life” when the ratio of soft media errors to total I/O operations for the drive extent exceeds a threshold error ratio. Data stored on the drive extent is then proactively copied to a newly allocated drive extent, the RAID mapping table is modified so that the data is subsequently accessed from the newly allocated drive extent, and the drive extent is excluded from being used again to store host data. As a result, the rate at which the drives experience soft media errors is slowed, lengthening their effective life.

Abstract: A hypervisor virtual server system, including a plurality of virtual servers, a plurality of virtual disks that are read from and written to by the plurality of virtual servers, a physical disk, an I/O backend coupled with the physical disk and in communication with the plurality of virtual disks, which reads from and writes to the physical disk, a tapping driver in communication with the plurality of virtual servers, which intercepts I/O requests made by any one of said plurality of virtual servers to any one of said plurality of virtual disks, and a virtual data services appliance, in communication with the tapping driver, which receives the intercepted I/O write requests from the tapping driver, and that provides data services based thereon.

Abstract: A computer-implemented method of determining modified portions of a RAID storage array for use in resynchronizing said RAID storage array after a failure, the computer-implemented method comprising: resolving areas in the RAID storage array that represent space allocated to volumes; resolving which of said allocated volumes comprise gathered writes; and for said allocated volumes that comprise gathered writes, resolving a set of writes that potentially have incomplete parity updates at the time of the failure.

Abstract: Accessing at least two separate physical storage devices as a single logical device includes receiving data/metadata from both of the separate physical storage devices and causing the data/metadata to appear to be coming from only one of the storage devices by spoofing data/metadata from at least one of the storage devices to appear to be coming from the other of the storage devices. Spoofing data/metadata may include revising storage device identifiers. The storage device identifiers may include serial numbers and port identifiers.

Abstract: An apparatus and method are provided for transferring a plurality of data structures from memory into one or more vectors of data elements stored in a register bank. The apparatus has first interface circuitry to receive data structures retrieved from memory, where each data structure has an associated identifier and comprises N data elements. Multi-axial buffer circuitry is provided having an array of storage elements, where along a first axis the array is organized as N sets of storage elements, each set containing a plurality VL of storage elements, and where along a second axis the array is organized as groups of N storage elements, with each group containing a storage element from each of the N sets. Access control circuitry then stores the N data elements of a received data structure in one of the groups selected in dependence on the associated identifier.

Abstract: A method includes generating an entry for inclusion in a configuration queue regarding a configuration submission regarding DSN managed by a managing unit that uses a manager's configuration database stored in a first database. The method further includes updating a first version of the configuration queue stored in first database and a second version of the configuration queue stored in a manager's vault to include the entry. When the manager's configuration database requires restoring, the method further includes copying a backup version of the manager's configuration database to the first database to create an initially restored manager's configuration database and establishing an association between the managing unit and the initially restored manager's configuration database.

Abstract: Various operations, functionalities and systems are described herein for backing up one or more node to an offsite location, restoring the one or more node from the offsite location, restoring the one or more node to a point-in-time (PIT) from the offsite location, cloning the one or more node from the offsite location, and cloning the one or more node to a PIT from the offsite location. Example operating contexts include one or more cluster of nodes running a NoSQL (Not only Structured Query Language) distributed database and backup, restore and/or cloning on those one or more cluster of nodes.

Abstract: Various operations, functionalities and systems are described herein for backing up one or more node to an offsite location, restoring the one or more node from the offsite location, restoring the one or more node to a point-in-time (PIT) from the offsite location, cloning the one or more node from the offsite location, and cloning the one or more node to a PIT from the offsite location. Example operating contexts include one or more cluster of nodes running a NoSQL (Not only Structured Query Language) distributed database and backup, restore and/or cloning on those one or more cluster of nodes.

Abstract: A breach resilient data storage system and method which encrypts, fragments, and stores data across a plurality of data stores, thereby requiring data being retrieved to be retrieved, recombined and decrypted before being accessible. The breach resilient data storage system and method includes, a plurality of storage containers, a client device from which data may be securely stored and securely stored data may be accessed, and a storage coordinator and a key keeper which track the encryption data and the placement and retrieval of fragmented data across the storage containers. Because the encrypted data is stored in fragmented bits, with none of the storage containers knowing what it is storing or having complete access to the complete set of data, a single compromised node in the system cannot be used to compromise the entire system or access any data.

Abstract: Provided is a RAID system that includes a memory device including a plurality of nonvolatile memories storing data chunks and first and second parity bits corresponding to the data chunks, a RAID controller configured to control a RAID operation and a rebuild operation of the memory device, and a host configured to communicate with the RAID controller at an input/output (I/O) rate. The RAID controller is configured to perform a first rebuild operation using the first parity bit and a first policy having a first rebuild rate, to perform a second rebuild operation using the first and second parity bits and a second policy having a second rebuild rate, to apply a first sub-rate as the first rebuild rate until the I/O rate reaches a predetermined value, and to apply a second sub-rate as the first rebuild rate when the I/O rate is greater than the predetermined value.

Abstract: A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device detects memory error(s) associated with a plurality of sets of memory devices of sets of storage unit(s) (SU(s)) within the DSN that distributedly store a set of encoded data slices (EDSs). The computing device facilitates detection of EDS error(s) associated with the memory error(s). For a set of memory devices, the computing device establishes a corresponding memory replacement priority level and facilitates replacement of corresponding memory device(s) associated with the EDS error(s) based on the corresponding memory replacement priority level.

Abstract: A semiconductor system may be provided. The semiconductor system may include a fail information generator and a data mapping circuit. The fail information generator may detect a data fail address of a data storage region. The data mapping circuit may change a mapping table based on the data fail address, and transmit data to be stored at the data fail address in the data storage region, to a parity storage region.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for selectively limiting the amount of data in a file system, which include: determining a reparity bit value for a write disk block range, wherein the reparity bit is configured to track a number of writes in progress to a stripe range; determining the reparity bit value; updating a threshold written disk block number as a highest disk block number of the reparity bit value; and initiating a RAID operation until it reaches the threshold written disk block number, wherein the threshold written disk block number comprises a maximum written disk block number representing the last disk block number written.

Abstract: In a job management apparatus, a reception part receives an input of definition information that defines a running sequence and a running condition of a plurality of job steps. If an abnormal end occurs in a job step included in a job run by the apparatus in accordance with the definition information, the apparatus runs a retry job including a restarting step, which is the job step in which the abnormal end has occurred, and a job step posterior to the restarting step in the running sequence defined by the definition information and satisfying the running condition defined by the definition information at the occurrence of the abnormal end in the restarting step. The apparatus stops running the restarting step and the job step posterior to the restarting step in the running sequence defined by the definition information at least until the run of the retry job is completed.

Abstract: Changes in a multi-RAID configuration to metadata of a source production volume in a source RAID are monitored since taking a most recent FC backup on the source production volume. The incremental copies of the metadata are stored on a target production volume in a target RAID. The source RAID is used to serve as a storage for the source production volume and also serve as a FC backup of the target production volume residing on the target RAID for creating a dual purpose for the multi-RAID configuration.

Abstract: A system and method of recognizing a hard disk movement, the system and method including recognizing hard disk information recorded in a hard disk in response to the hard disk being moved to a slot in a hard disk array, determining the movement type of the hard disk based on the recognized hard disk information, judging validity of the hard disk movement based on the movement type, and updating the hard disk information of the hard disk in response to the hard disk movement being judged as valid, wherein the hard disk information comprises position information of the hard disk in the hard disk array.

Abstract: Systems and methods for migrating stored backup data between magnetic disks (e.g., from an existing magnetic disk to another disk), such as a new or different magnetic disk in a magnetic storage library, without interrupting or otherwise affecting secondary copy operations (e.g., operations currently writing data to the storage library) utilizing the magnetic storage library, are described. In some embodiments, the systems and methods mark one or more mount paths as full when a running secondary copy operation associated with the mount path has completed a job (regardless of the actual current capacity or intended use of the mount path), and migrate each of the one or more data volumes to a second magnetic disk of the magnetic library when the mount path associated with the data volume is marked as full.

Abstract: Exemplary embodiments provide a way to manage data recovery in a distributed system having multiple data store nodes. A storage system comprises: a first node including a first processor; and a plurality of second nodes coupled to the first node, each of the plurality of second nodes including a second processor and one or more second storage devices. The first processor is configured to control to store data and replication of the data in the second storage devices of two or more second nodes. If at least one of the second nodes has failed and a storage capacity of the plurality of second nodes is below a given threshold, one of the second nodes is configured to receive a first data, which is replication of data stored in a failed second node, from another of the second nodes, and create parity data based on the received first data.

Abstract: Embodiments of the present invention provide a method of facilitating recovering a storage system, the storage system comprising a plurality of system disks for storing system information of the storage system, and at least one array associated with the plurality of system disks to manage the plurality of system disks, the method comprising: in response to failure of at least one system disk in the plurality of system disks, determining a performance deterioration degree of the at least one disk array; and in response to the performance deterioration degree of the at least one disk array being a first level, setting boot information of the one disk away to a first value, where the first value indicates skipping creation of the one disk array during a booting process of the storage system.

Abstract: Aspects include computing devices, systems, and methods for managing a first computing device component of a computing device in order to extend an operating life of the computing device component. In an aspect, a processing device may determine a condition estimator of the first computing device component, determine whether the condition estimator of the first computing device component indicates that a condition of the first computing device component is worse than the condition of a second computing device component, and assign workloads to the first and second computing device components to balance deterioration of the condition of the first and second computing device components in response to determining that the condition estimator of the first computing device component indicates that the condition of the first computing device component is worse than the condition of the second computing device component.

Abstract: An information handling system includes a memory with a cache, and a processor to execute pre-operating system (pre-OS) code before the processor executes boot loader code. The pre-OS code sets up a Memory Type Range Register (MTRR) to define a first memory type for a memory region of the memory, sets up a page attribute table (PAT) with an entry to define a second memory type for the memory region, disables the PAT, and pass execution by the processor to the boot loader code. The first memory type specifies a first cacheability setting on the processor for data from the memory region, and the second memory type specifies a second cacheability setting on the processor for data from the memory region.

Abstract: The disclosure relates data protection management (e.g. data re-protection) for distributed storage systems. Specifically, the systems (and methods) of the disclosure implement erasure coding to protect replicated data efficiently while reducing the storage capacity overhead. Traditional approaches for data re-protection that implement erasure coding often require performing a complete re-encoding to reflect changes in data (e.g. a removal of data). The disclosure provides an improved mechanism for data re-protection by implementing an efficient re-encoding (or un-encoding) process that reduces the requirements for data reads and operations, and thus, reduces the resource requirements for data re-protection.

Abstract: An apparatus or method for minimizing the total accessing cost, such as minimizing repair bandwidth, delay or the number of hops including the steps of minimizing the number of nodes to be engaged for the recovery process using a polynomial-time solution that determines the optimal number of participating nodes and the optimal set of nodes to be engaged for recovering lost data, where in a distributed database storage system, for example a dynamic system, where the accessing cost or even the number of available nodes are subject to change results in different values for the optimal number of participating nodes. An MDS code is included which can be reused when the number of participating nodes varies without having to change the entire code structure and the content of the nodes.

Abstract: Methods and apparatus for Exclusive OR (XOR) programming of a memory device include a program internal to a device calculates parity or other values using an XOR Program Rule. In some embodiments, the program generates and stores a parity result directly in the memory device itself without intervention by an external controller. A method of parity generation in a memory device comprises executing an internal self-accumulating parity program, wherein the program accumulates a parity sum by superimposing newly accumulated parity information over previously stored parity information in the auxiliary memory system. In a stand-alone device embodiment, a new command “XOR program” is received with address and input data parameters causing stored data to be read at the input address and an XOR operation of the read data and new input data is performed. The results of the computation are written into memory.

Abstract: Methods, devices and systems are provided for making a shingled magnetic recording (SMR) hard disk drive operate with similar random access characteristics of a conventional hard drive despite the SMR disk having strict sequential write requirements. A virtual space manager manages a virtual address space, which is visible to a host system, and maps virtual addresses to logical addresses on the SMR disk. A logical space manager controls the placement of data on the SMR disk and ensures that writes to the disk comply with the sequential write requirements. The disk is subdivided into a plurality of stripes each comprising one or more blocks. When a block located within a stripe is to be rewritten with new data, the entire stripe is read from the SMR disk into a memory of the system, the stripe is modified in the memory to replace the previous data stored in the block with the new data, and the modified stripe is written to a new, next available stripe on the disk.

Abstract: A method, computer program, and apparatus are described for finding the logical equivalence between register transfer level (RTL) wires and post synthesis nets in a netlist. In some example embodiments, the method includes minimizing nets in a netlist and matching each RTL wire to a netlist net. In some example embodiments, the method also includes determining if an RTL wire is logically equivalent to a netlist net. In some example embodiments, the method also includes determining a new candidate for a net if the RTL wire and associated netlist net are not logically equivalent.

Abstract: A method for recovering a failed storage drive in a redundant array of independent disks (RAID) includes storing, on a first distributed spare of the RAID, a first parity subset for a first set of drives in the RAID. The method further stores, on a second distributed spare of the RAID, a second parity subset for a second set of drives in the RAID. In the event a storage drive in the RAID fails, the method determines whether the storage drive belongs to the first set or second set. In the event the failed storage drive belongs to the first set, the method uses the first parity subset on the first set of drives in the RAID to recover the failed storage drive. In the event the failed storage drive belongs to the second set, the method uses the second parity subset on the second set of drives in the RAID to recover the failed storage drive. A corresponding system and computer program product are also disclosed.

Abstract: Systems and methods for migrating stored backup data between magnetic disks (e.g., from an existing magnetic disk to another disk), such as a new or different magnetic disk in a magnetic storage library, without interrupting or otherwise affecting secondary copy operations (e.g., operations currently writing data to the storage library) utilizing the magnetic storage library, are described. In some embodiments, the systems and methods mark one or more mount paths as full when a running secondary copy operation associated with the mount path has completed a job (regardless of the actual current capacity or intended use of the mount path), and migrate each of the one or more data volumes to a second magnetic disk of the magnetic library when the mount path associated with the data volume is marked as full.

Abstract: An example embodiment includes a method for creating a family of related intellectual asset (IA) records. The method may include obtaining IA data for a current filing. The method may include creating an IA record for the current filing. The method may include obtaining IA data for one or more related filings. The current filing and the one or more related filings belong to a family of intellectual assets. The method may also include preparing for creation of a plurality of IA records for the one or more related filings based on the IA data for the current filing and the IA data for the one or more related filings. The method may further include creating a plurality of new IA records for the one or more related filings.

Abstract: The present invention makes it possible to process a plurality of commands included in a series of communication processes in a shared manner by a plurality of circuit parts, thereby improving reliability and processing performance. A semiconductor integrated circuit for communication (212) includes: a plurality of first circuit parts (2121) that are responsible for communicating with a higher-level apparatus (4); a plurality of second circuit parts (2122), which analyze a command included in a series of communication processes, and which share the processing of a plurality of commands included in the series of processes with another second circuit part; a common connector (2123) for connecting the first circuit parts to the second circuit parts; and a failure management part (2124), which, when a failure has occurred in any circuit part, causes the stoppage of processing by a stop-target circuit part that must stop processing.

Abstract: Aspects of the present disclosure involve systems and methods for removes and/or adding log and/or cache devices to storage pools of a storage appliance. Users, via a graphical-user interface, identify the log and/or cache devices for removal or addition. Subsequently, the log and/or cache devices are moved, according to a data profile corresponding to the devices, from a first storage appliance to a second storage appliance.

Abstract: Embodiments described herein are directed to a file system driven RAID rebuild technique. A layered file system may organize storage of data as segments spanning one or more sets of storage devices, such as solid state drives (SSDs), of a storage array, wherein each set of SSDs may form a RAID group configured to provide data redundancy for a segment. The file system may then drive (i.e., initiate) rebuild of a RAID configuration of the SSDs on a segment-by-segment basis in response to cleaning of the segment (i.e., segment cleaning). Each segment may include one or more RAID stripes that provide a level of data redundancy (e.g., single parity RAID 5 or double parity RAID 6) as well as RAID organization (i.e., distribution of data and parity) for the segment. Notably, the level of data redundancy and RAID organization may differ among the segments of the array.

Abstract: Systems and methods utilizing available storage space within a storage system (e.g., as “supplemental” storage) and/or implement less physical storage space in the storage system (e.g., reduced storage overhead) through operation of fragment pre-storage techniques are disclosed. Such fragment pre-storage utilization of the aforementioned available storage space may provide operation emulating larger storage overhead than is actually provided in the storage system, facilitate improved repair rates, and/or facilitate reduced repair bandwidth in the storage system according to embodiments. A fragment pre-storage repair policy may implement source object repair whereby additional fragments for the source object are pre-generated and pre-stored in the storage system as transient fragments, whereby the transient fragments are moved to corresponding storage nodes when those storage nodes become physically present in the storage system.

Abstract: Embodiments of the invention provide a neurosynaptic network circuit comprising multiple neurosynaptic devices including a plurality of neurosynaptic core circuits for processing one or more data packets. The neurosynaptic devices further include a routing system for routing the data packets between the core circuits. At least one of the neurosynaptic devices is faulty. The routing system is configured for selectively bypassing each faulty neurosynaptic device when processing and routing the data packets.

Abstract: A method including: receiving one or more first transactions at the computer replay system from one or more data sources; storing the one or more first transactions in a transactional database; updating a current state of one or more first records in a historical database based on the one or more first transactions; receiving a request from a first user for a replay of the data starting at a first moment; determining a state of the one or more first records in the historical database at the first moment; providing the state of the one or more first records at the first moment to the first user; determining one or more second transactions in the transactional database that occurred after the first moment; and providing sequentially the one or more second transactions to the first user. Other embodiments are provided.

Abstract: Variable width error correction is described. A memory controller can determine, from a memory address, what type of error correction is to be applied for the address region of that memory address and can generate commands for the memory device. An amount of error correction metadata associated with that address region may vary depending on the spatial location of the address region. In some cases, two translations may be performed: one by a processor using information set up by an operating system and another by the memory controller (or the memory device). In other cases, a single translation may be performed, for example by a processor using information set up by the operating system, which can determine the variable error correction during translation of a virtual address region to a real physical address region.

Abstract: Embodiments of the present disclosure relate to a method, computer program product and a system for enabling non-volatile random access to data where in response to receiving data from a client, causing the data to be written into a memory of a primary virtual machine and a memory of a mirror virtual machine; and in response to the primary virtual machine losing the data, recovering the data based on data in the memory of the mirror virtual machine.

Abstract: A solution for maintaining the operation of a server and allowing the transfer of data from client devices to a database without locking the database during an audit and pack process is realized that reduces the amount of time lost due to backup file storage transfer. When a file is backed up to a first storage trail through the audit process, the trail may eventually become filled to capacity. Upon the first storage trail filling to capacity, a pack process is initiated, and a backup storage trail is created to store the data during this process. Upon completion of the pack process, the data from the backup storage trail is transferred to another active storage trail.

Abstract: Systems and methods for generating random address mapping in non-volatile memories using local and global interleaving are provided. One such method for generating a random address mapping for a non-volatile memory (NVM) involves identifying a number of bits (N) in a physical address space of the NVM, selecting G bit(s) of the N bits to be used for global interleaving, where G is less than N, determining a number of bits (N?G) to be used for local interleaving, mapping the G bit(s) using a mapping function for global interleaving, interleaving (N?G) bits using an interleaving function for local interleaving, and generating a combined mapping comprising the mapped G bit(s) and the interleaved (N?G) bits.

Abstract: Methods and apparatus related to utilization of counter(s) for locating faulty die in a distributed codeword storage system are described. In one embodiment, first logic determines a plurality of values. Each of the plurality of values corresponds to a number of zeros or a number of ones in bits read from a portion of each of a plurality of memory dies. Second logic determines one or more candidates as a faulty die amongst the plurality of memory dies based at least in part on a comparison of the plurality of values for the plurality of memory dies. Other embodiments are also disclosed and claimed.