Flexible byzantine fault tolerance

    公开(公告)号:US12130714B2

    公开(公告)日:2024-10-29

    申请号:US18472134

    申请日:2023-09-21

    申请人: VMware, Inc.

    摘要: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.

    Distributed transaction control system and distributed transaction control method

    公开(公告)号:US12105603B2

    公开(公告)日:2024-10-01

    申请号:US17950589

    申请日:2022-09-22

    申请人: Hitachi, Ltd.

    摘要: A distributed transaction control system includes redundant coordinator apparatuses, wherein determination part replaces input votes to votes of preparation failure when input votes from the participant apparatus time out, makes a determination of commit when all input votes are votes of preparation success, makes a determination of rollback when the input votes include at least one vote of preparation failure, and inputs a content of the determination into the distributed consensus processing part, the distributed consensus processing part decides on one of the contents of the determination that are inputs from the determination parts, by distributed consensus, and settlement part notifies an output of the distributed consensus processing part to the participant apparatuses as a settlement result.

    FLEXIBLE BYZANTINE FAULT TOLERANCE
    5.
    发明公开

    公开(公告)号:US20240012724A1

    公开(公告)日:2024-01-11

    申请号:US18472134

    申请日:2023-09-21

    申请人: VMware, Inc.

    IPC分类号: G06F11/18 G06F11/20 G06F11/14

    摘要: A method and system for performing a flexible Byzantine fault tolerant (BFT) protocol. The method includes sending, from a client device, a proposed value to a plurality of replica devices and receiving, from at least one of the plurality of replica devices, a safe vote on the proposed value. The replica device sends the safe vote, based on a first quorum being reached, to the client device and each of the other replica devices of the plurality of replica devices. The method further includes determining that a number of received safe votes for the proposed value meets or exceeds a second quorum threshold, selecting the proposed value based on the determination, and setting a period of time within which to receive additional votes. The method further includes, based on the period of time elapsing without receiving the additional votes, committing the selected value for the single view.

    HIGH-RELIABILITY NON-VOLATILE MEMORY USING A VOTING MECHANISM

    公开(公告)号:US20240012723A1

    公开(公告)日:2024-01-11

    申请号:US18352744

    申请日:2023-07-14

    发明人: Gil Golov

    摘要: A memory system includes a processing device (e.g., a controller implemented using a CPU, FPGA, and/or logic circuitry) and memory regions (e.g., in a flash memory or other non-volatile memory) storing data. The processing device receives an access request from a host system that is requesting to read the stored data. In one approach, the memory system is configured to: receive, from the host system over a bus, a read command to access data associated with an address in a non-volatile memory; in response to receiving the read command, access, by the processing device, multiple copies of data stored in at least one memory region of the non-volatile memory; match, by the processing device, data from the copies with each other; select, based on matching data from the copies with each other, first data from a first copy of the copies; and provide, to the host system over the bus, the first data as output data.

    Updating counters distributed across a plurality of nodes

    公开(公告)号:US11868198B2

    公开(公告)日:2024-01-09

    申请号:US17356244

    申请日:2021-06-23

    申请人: PayPal, Inc.

    发明人: Eric Leu

    IPC分类号: G06F11/00 G06F11/07 G06F11/18

    摘要: Techniques are disclosed relating to methods that include initializing, by a computer in a computer system, an event counter that includes a plurality of sub-counter groups, each plurality of sub-counter groups including at least two sub-counters located on different nodes of a plurality of nodes in the computer system. In response to an occurrence of an event associated with the event counter, the method may include the computer selecting a particular sub-counter group of the plurality of sub-counter groups to update, and sending, to sub-counters corresponding to the particular sub-counter group, a request to update a sub-counter value for the particular sub-counter group. In response to a request for a current count value of the event counter, the method may include outputting, by the computer, a sum of the sub-counter values for the plurality of sub-counter groups as the current count value.