-
公开(公告)号：US20180089244A1
公开(公告)日：2018-03-29
申请号：US15276236
申请日：2016-09-26
Applicant: VMware, Inc.
Inventor： Vijaychidambaram VELAYUDHAN PILLAI , Ittai ABRAHAM
IPC: G06F17/30
Abstract: An example computer system includes a memory storing program code and a storage system storing at least a portion of a fragmented log-structured merge (FLSM) tree implementing a key-value store. The FLSM tree includes H levels, where H is an integer greater than one. The computer system further includes a central processing unit (CPU) configured to execute the program code stored in the memory to store a plurality of key-value pairs in the FLSM tree, the key value pairs having keys defined within a key space, the key space divided by a plurality of guards for each of the H levels of the FLSM tree, each of the key-value pairs being stored a maximum of H times in the FLSM tree.
-
公开(公告)号：US20230027259A1
公开(公告)日：2023-01-26
申请号：US17382756
申请日：2021-07-22
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Hristo STAYKOV
IPC: G06F11/14
Abstract: In some embodiments, a method implements a Byzantine fault tolerant protocol. A first replica detects a condition to cause a view change procedure to move from a current view to a next view. The first replica sends a message indicating the first replica wants to leave the current view. Also, the first replica receives a set of messages from second replicas indicating a respective second replica wants to leave the current view. The first replica determines when a property is received to the leave the current view based on the set of messages from the set of second replicas. When it is determined the property is received, the first replica performs a process to leave the current view. When it is determined the property is not received, the first replica stays in the current view and participating in processing a request from a client in the current view.
-
公开(公告)号：US20210334177A1
公开(公告)日：2021-10-28
申请号：US17107630
申请日：2020-11-30
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
Abstract: 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.
-
公开(公告)号：US20220276938A1
公开(公告)日：2022-09-01
申请号：US17746066
申请日：2022-05-17
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
Abstract: 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.
-
Patent Agency Ranking
公开(公告)号：US20210226924A1
公开(公告)日：2021-07-22
申请号：US16748571
申请日：2020-01-21
Applicant: VMware, Inc.
Inventor： Avishay YANAI , Ittai ABRAHAM
Abstract: A system and method for anonymous message broadcasting uses secret shares of a first vector of size i and a second vector of size j from each client device with a message in an anonymity set of client devices. Each secret share of the first and second vectors is received at each of a plurality of message broadcasting servers to construct a matrix M of i and j dimensions, which is added to a matrix A of i and j dimensions maintained at that message broadcasting server. The matrix A at each message broadcasting server is shared with the other message broadcasting servers and a final matrix A is constructed using the shared matrices A at each message broadcasting server, wherein the final matrix A includes the messages from the client devices in the anonymity set. The messages in the final matrix A are broadcasted from the message broadcasting servers.
-
公开(公告)号：US20240012724A1
公开(公告)日：2024-01-11
申请号：US18472134
申请日：2023-09-21
Applicant: VMware, Inc.
Inventor： Ittai ABRAHAM , Dahlia MALKHI , Kartik NAYAK , Ling REN
CPC classification number: G06F11/187 , G06F11/2041 , G06F11/1425 , G06F11/182
Abstract: 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.
-
公开(公告)号：US20210160152A1
公开(公告)日：2021-05-27
申请号：US16912536
申请日：2020-06-25
Applicant: VMware, Inc.
Inventor： Alexander SPIEGELMAN , Ittai ABRAHAM , Dahlia MALKHI
Abstract: An asynchronous state machine replication solution in a system of replicas includes executing multiple instances of a consensus protocol, referred to as leader-based views (LBVs) in each replica, where each replica is a leader participant in one of the LBV instances. Each replica drives a decision based on the consensus being reached among the LBV instances, rather than relying the expiration of timers and view changes to drive progress.
-
公开(公告)号：US20230069165A1
公开(公告)日：2023-03-02
申请号：US17465830
申请日：2021-09-02
Applicant: VMware, Inc.
Inventor： Teodor PARVANOV , Ittai ABRAHAM , Kashfat Khan , Yulia SHERMAN , Yehonatan BUCHNIK
Abstract: In some embodiments, a first replica sends a message to second replicas for pre-processing of an operation. The first replica receives pre-processing results from the second replicas. A pre-processing result is generated by pre-processing the operation using a first state. The first replica analyzes the pre-processing results to determine whether an agreement on a validated pre-processing result is received. When it is determined the agreement on the validated pre-processing result is received, the first replica performs a consensus protocol stage with the second replicas to order the request in an order of execution of requests that defines when to execute the request with respect to another request at the second replicas. Information for the validated pre-processing result is provided to the set of second replicas to determine whether contention results between the first state and a second state that is based on the order of execution of requests.
-
公开(公告)号：US20210279255A1
公开(公告)日：2021-09-09
申请号：US17136376
申请日：2020-12-29
Applicant: VMware, Inc.
Inventor： Kartik Ravidas NAYAK , Ling REN , Dahlia MALKHI , Ittai ABRAHAM
Abstract: A distributed service includes replicas that communicate with each other over a network to commit a block of client requests to a log of blocks of client requests. Each replica receives from one of the replicas, designated as the leader, a proposal for committing a new block to the log, and sends a vote on the proposed block to all of the other replicas via the network. Each replica then starts a timer set to twice the maximum network delay time to transmit messages over the network. If there is no equivocation when the timer lapses or stalling condition in proposing new blocks, then each replica commits the proposed block to the log. If there is equivocation or stalling condition, then a new leader is selected, and the process re-attempts to commit the proposed block.
-
-
-
-
-
-
-
-
Search Results
9
records
(took 0.011 seconds)
