知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

3771 records (took 0.031 seconds)

    RELIABILITY CODING WITH REDUCED NETWORK TRAFFIC
    2.
    发明公开
    RELIABILITY CODING WITH REDUCED NETWORK TRAFFIC 审中-公开

    公开(公告)号：US20240362117A1

    公开(公告)日：2024-10-31

    申请号：US18768455

    申请日：2024-07-10

    Applicant: Microsoft Technology Licensing, LLC

    Inventor： Jaishankar Menon ,  Pradeep Sindhu ,  Pratapa Reddy Vaka

    IPC: G06F11/10 ,  G06F11/20 ,  H03M13/15

    CPC classification number: G06F11/1088 ,  G06F11/2094 ,  H03M13/1515 ,  H03M13/154 ,  G06F2201/82

    Abstract: This disclosure describes techniques that include implementing network-efficient data durability or data reliability coding on a network. In one example, this disclosure describes a method that includes generating a plurality of data fragments from data to enable reconstruction of the data from a subset of the plurality of data fragments; storing, across a plurality of nodes in a network, the plurality of data fragments, wherein storing the plurality of data fragments includes storing the first fragment at a first node and the second fragment at a second node; and generating, by the first node, a plurality of secondary fragments derived from the first fragment to enable reconstruction of the first fragment from a subset of the plurality of secondary fragments; and storing the plurality of secondary fragments from the first fragment across a plurality of storage devices included within the first node.

    Implementing availability domain aware replication policies
    5.
    发明授权
    Implementing availability domain aware replication policies 有权

    公开(公告)号：US12099421B2

    公开(公告)日：2024-09-24

    申请号：US17962010

    申请日：2022-10-07

    Applicant: Nutanix, Inc.

    Inventor： Mohammad Mahmood ,  Roger Sean Liao

    IPC: G06F11/20 ,  G06F3/06

    CPC classification number: G06F11/2094 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/065 ,  G06F3/067 ,  G06F2201/805

    Abstract: Systems for distributed data storage. A method commences upon accessing a set of data items that describe computing nodes to be organized into a ring topology. The ring topology and distributed data storage policies are characterized by quantitative failure-resilient characteristics such as a replication factor. Various characteristics of the topology serve to bound two or more availability domains of the ring into which the computing nodes can be mapped. A set of quantitative values pertaining to respective quantitative failure-resilient characteristics are used for enumerating candidate ring topologies where the computing nodes are mapped into the availability domains. Using the quantitative failure-resilient characteristics, alternative candidate ring topologies are evaluated so as to determine a configuration score for candidate ring topologies. A candidate ring topology is configured based on a computed configuration score surpassing a threshold score. When a failure event is detected, the ring is reevaluated, remapped, and considered for reconfiguration.

    Method and system for repairing memory device
    10.
    发明授权
    Method and system for repairing memory device 有权

    公开(公告)号：US12026073B2

    公开(公告)日：2024-07-02

    申请号：US17404119

    申请日：2021-08-17

    Applicant: CHANGXIN MEMORY TECHNOLOGIES, INC.

    Inventor： Liang Zhang

    IPC: G06F11/00 ,  G06F3/06 ,  G06F11/20

    CPC classification number: G06F11/2094 ,  G06F3/0619 ,  G06F3/0653 ,  G06F3/0673

    Abstract: A method for repairing a memory device includes: performing error detection on memory units of the memory device; temporarily storing each of unit addresses of detected error units in registers until the number of the detected error units reaches a first preset number, where the detected error units are damaged memory units, and each of the detected error unit occupies a respective one of the registers, and each of the unit addresses comprises a row address; successively selecting one of the registers as a target register; determining whether a row addresses in the target register exists in a reference storage module, where a repaired row address or an unrepaired row address is stored in the reference storage module; and repairing error units that are not repaired through the row addresses according to a result of the determination.

Patent Agency Ranking