void runAsync(Round round) { lock.lock(); try { // End of the log is this round. Once transport begins it is // reasonable to assume at least one replica will eventually get // this, and there is reasonable probability it commits. headIndex = round.acceptedNewIndex; runningRound = round; for (KetchReplica replica : voters) { replica.pushTxnAcceptedAsync(round); } for (KetchReplica replica : followers) { replica.pushTxnAcceptedAsync(round); } } finally { lock.unlock(); } }
void runAsync(Round round) { lock.lock(); try { // End of the log is this round. Once transport begins it is // reasonable to assume at least one replica will eventually get // this, and there is reasonable probability it commits. headIndex = round.acceptedNewIndex; runningRound = round; for (KetchReplica replica : voters) { replica.pushTxnAcceptedAsync(round); } for (KetchReplica replica : followers) { replica.pushTxnAcceptedAsync(round); } } finally { lock.unlock(); } }
void runAsync(Round round) { lock.lock(); try { // End of the log is this round. Once transport begins it is // reasonable to assume at least one replica will eventually get // this, and there is reasonable probability it commits. headIndex = round.acceptedNewIndex; runningRound = round; for (KetchReplica replica : voters) { replica.pushTxnAcceptedAsync(round); } for (KetchReplica replica : followers) { replica.pushTxnAcceptedAsync(round); } } finally { lock.unlock(); } }