1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579
// Copyright 2021-2022 Cargill Incorporated
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use std::marker::PhantomData;
use std::time::Duration;
use crate::algorithm::{Algorithm, Value};
use crate::error::{AlgorithmError, InvalidStateError};
use crate::process::Process;
use crate::time::TimeSource;
use super::CoordinatorAction;
use super::CoordinatorActionNotification;
use super::CoordinatorContext;
use super::CoordinatorEvent;
use super::CoordinatorMessage;
use super::CoordinatorState;
use super::TwoPhaseCommitContext;
use super::TwoPhaseCommitMessage;
// The timeout for receiving all decision acks before continuing to the next epoch.
//
// This value is not important for the overall correctness fo the algorithm. A timeout here is
// processed the same way as receiving all acks. If participants aren't ready for the next epoch,
// they will use the recovery protocol to catch up.
const ACK_TIMEOUT_SECONDS: u64 = 5;
const VOTE_TIMEOUT_SECONDS: u64 = 30;
pub struct CoordinatorAlgorithm<P, V, TS>
where
P: Process,
V: Value,
TS: TimeSource,
{
_process_phantom: PhantomData<P>,
_value_phantom: PhantomData<V>,
time_source: TS,
}
impl<P, V, TS> CoordinatorAlgorithm<P, V, TS>
where
P: Process,
V: Value,
TS: TimeSource,
{
pub fn new(time_source: TS) -> Self {
CoordinatorAlgorithm {
_process_phantom: PhantomData,
_value_phantom: PhantomData,
time_source,
}
}
// Create actions for an abort decision. This set of actions is generated whenever an abort
// occurs; an abort occurs when:
//
// - During a timeout when not all participants have voted
// - When all participants have voted but at least one voted NO
fn push_abort_actions(
&self,
mut context: TwoPhaseCommitContext<P, TS::Time, CoordinatorContext<P, TS::Time>>,
actions: &mut Vec<CoordinatorAction<P, V, TS::Time>>,
) {
// The order of actions here is important! We must update our state to `Abort` before we
// send any messages for correctness of the algorithm.
// Add an action to update the state to abort and unset the alarm.
context.set_state(CoordinatorState::Abort);
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: None,
});
// Send `Abort` to all participants which have voted yes.
for participant in context
.participants()
.iter()
.filter(|p| p.vote.unwrap_or(false))
{
actions.push(CoordinatorAction::SendMessage(
participant.process.clone(),
TwoPhaseCommitMessage::Abort(*context.epoch()),
))
}
// Notify that we've aborted.
actions.push(CoordinatorAction::Notify(
CoordinatorActionNotification::Abort(),
));
// Wait for a decision ack.
self.push_wait_for_decision_ack(&mut context, actions);
}
// Create actions for switching into WaitingForDecisionAck state. This is the state after
// a decision has been communicated to participants, before we start a new epoch.
fn push_wait_for_decision_ack(
&self,
context: &mut TwoPhaseCommitContext<P, TS::Time, CoordinatorContext<P, TS::Time>>,
actions: &mut Vec<CoordinatorAction<P, V, TS::Time>>,
) {
let ack_timeout_start = self.time_source.now();
let ack_timeout_end = ack_timeout_start + Duration::from_secs(ACK_TIMEOUT_SECONDS);
context.set_state(CoordinatorState::WaitingForDecisionAck { ack_timeout_start });
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: Some(ack_timeout_end),
});
}
// Create actions for advancing to the next epoch. This set of actions is generated whenever
// a decision has been reached, either abort or commit.
fn push_advance_epoch_actions(
&self,
context: &mut TwoPhaseCommitContext<P, TS::Time, CoordinatorContext<P, TS::Time>>,
actions: &mut Vec<CoordinatorAction<P, V, TS::Time>>,
) {
// Update the epoch and set the state to WaitingForStart. Also update the last commit epoch
// used to answer DecisionRequest messages.
if *context.state() == CoordinatorState::Commit {
context.set_last_commit_epoch(Some(*context.epoch()));
}
context.set_epoch(context.epoch() + 1);
context.set_state(CoordinatorState::WaitingForStart);
context
.participants_mut()
.iter_mut()
.for_each(|participant| {
participant.vote = None;
participant.decision_ack = false;
});
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: None,
});
// Notify that we need a new start value.
actions.push(CoordinatorAction::Notify(
CoordinatorActionNotification::RequestForStart(),
));
}
}
impl<P, V, TS> Algorithm for CoordinatorAlgorithm<P, V, TS>
where
P: Process,
V: Value,
TS: TimeSource,
{
type Event = CoordinatorEvent<P, V>;
type Action = CoordinatorAction<P, V, TS::Time>;
type Context = TwoPhaseCommitContext<P, TS::Time, CoordinatorContext<P, TS::Time>>;
fn event(
&self,
event: Self::Event,
mut context: Self::Context,
) -> Result<Vec<Self::Action>, AlgorithmError> {
match event {
// In response to a RequestForStart notification, a Start event provides the next value
// that should be considered.
//
// Steps:
// - Send VoteRequest to all participants
// - Update the state to Voting
// - Set a timeout alarm for the maximum time to wait for votes
CoordinatorEvent::Start(value) => {
let mut actions = Vec::new();
// Send a VoteRequest message to all participants
for participant in context.participants() {
actions.push(CoordinatorAction::SendMessage(
participant.process.clone(),
TwoPhaseCommitMessage::VoteRequest(*context.epoch(), value.clone()),
))
}
// A timeout will occur after VOTE_TIMEOUT_SECONDS, starting now. An alarm is set
// for the end of the timeout and the timeout is processed when an
// `CoordinatorEvent::Alarm` is received.
let vote_timeout_start = self.time_source.now();
let vote_timeout_end =
vote_timeout_start + Duration::from_secs(VOTE_TIMEOUT_SECONDS);
// Add an action to update the state to Voting and set the timeout alarm.
context.set_state(CoordinatorState::Voting { vote_timeout_start });
actions.push(CoordinatorAction::Update {
context,
alarm: Some(vote_timeout_end),
});
Ok(actions)
}
// In response to a RequestForVote notification, a Vote event provides the answer to
// whether we decide commit or abort.
CoordinatorEvent::Vote(vote) => {
// If we receive a Vote event when not in WaitingForVote, it indicates
// a programming error by the caller of the algorithm.
if !matches!(context.state(), CoordinatorState::WaitingForVote) {
return Err(AlgorithmError::InvalidState(
InvalidStateError::with_message(
"Vote event when not in WaitingForVote state".into(),
),
));
}
let mut actions = Vec::new();
// If vote is true, then we decide to commit; if vote is false, we decide to abort.
if vote {
// Add an action to update the state to commit and unset the alarm.
context.set_state(CoordinatorState::Commit);
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: None,
});
// Send `Commit` to all participants.
for participant in context.participants() {
actions.push(CoordinatorAction::SendMessage(
participant.process.clone(),
TwoPhaseCommitMessage::Commit(*context.epoch()),
))
}
// Notify that we've committed.
actions.push(CoordinatorAction::Notify(
CoordinatorActionNotification::Commit(),
));
// Wait for a decision ack.
self.push_wait_for_decision_ack(&mut context, &mut actions);
} else {
self.push_abort_actions(context, &mut actions);
}
Ok(actions)
}
// An alarm may be sent if we've previously used the `CoordinatorAction::Update` action
// to set an alarm to `Some(T)`, as is the case when we enter the `Coordinator::Voting`
// state.
CoordinatorEvent::Alarm() => match context.state() {
// A vote timeout has occurred, which means we have not received votes within
// VOTE_TIMEOUT_SECONDS.
CoordinatorState::Voting { vote_timeout_start } => {
let mut actions = Vec::new();
// Validate that the timeout has occurred. If this is false, we shouldn't have
// been woken up with an alarm; however, we can just ignore it and wait for the
// alarm to be triggered again later.
if self.time_source.now()
> *vote_timeout_start + Duration::from_secs(VOTE_TIMEOUT_SECONDS)
{
// Decide to abort. Use a function to fill in the abort actions since abort
// can occur in other situations as well.
self.push_abort_actions(context, &mut actions);
}
Ok(actions)
}
// If we receive an alarm when in the RequestforStart state, then we re-generate
// a RequestForStart notification.
//
// An alarm in this state is expected to occur during initialization; in that
// situation, this alarm is the first event to be processed. If this alarm occurs
// in other circumstances, it indicates a bug (possibly in how the caller is using
// the algorithm), but we process it anyway in hopes of recovery.
CoordinatorState::WaitingForStart => Ok(vec![
CoordinatorAction::Notify(CoordinatorActionNotification::RequestForStart()),
CoordinatorAction::Update {
context,
alarm: None,
},
]),
// If we receive an alarm an the RequestforStart state, then we re-generate
// a RequestForVote notification. Since this is unexpected, it indicates a bug
// (possibly in how the caller is using the algorithm), but we process it anyway in
// hopes of recovery.
CoordinatorState::WaitingForVote => Ok(vec![
CoordinatorAction::Notify(CoordinatorActionNotification::RequestForVote()),
CoordinatorAction::Update {
context,
alarm: None,
},
]),
// A decision ack timeout has occurred, which means we have not received all
// decision acks within the allowed timeout period.
//
// As the coordinator, we wait for decison acks to make it far less likely that
// a participant will receive the next epoch's RequestForVote before the current
// epoch's Commit or Abort. (Because, if they are received out of sequence, the
// RequestForVote will be dropped causing an Abort of that epoch by the
// participant.)
//
// After the timeout however, we are no longer concerned about the above race
// condition, so we can simply proceed to the next epoch. Any participants who have
// not responded with a decision ack either processed the commit/abort or will
// timeout and start the recovery protocol. In either case, the correct behavior
// for the coordinator is to continue with the next epoch.
CoordinatorState::WaitingForDecisionAck { ack_timeout_start } => {
let mut actions = Vec::new();
// Validate that the timeout has occurred. If this is false, we shouldn't have
// been woken up with an alarm; however, we can just ignore it and wait for the
// alarm to be triggered again later.
if self.time_source.now()
> *ack_timeout_start + Duration::from_secs(ACK_TIMEOUT_SECONDS)
{
// Move to the next epoch. This will unset the alarm.
self.push_advance_epoch_actions(&mut context, &mut actions);
}
Ok(actions)
}
// Receiving alarms in the commit state is unexpected, but try and recover by
// advancing to the next epoch.
CoordinatorState::Commit => {
let mut actions = Vec::new();
self.push_advance_epoch_actions(&mut context, &mut actions);
Ok(actions)
}
// Receiving alarms in the abort state is unexpected, but try and recover by
// advancing to the next epoch.
CoordinatorState::Abort => {
let mut actions = Vec::new();
self.push_advance_epoch_actions(&mut context, &mut actions);
Ok(actions)
}
},
// A participant has sent response to our request for a vote, record it and possibly
// decide commit or abort.
CoordinatorEvent::Deliver(process, CoordinatorMessage::VoteResponse(epoch, vote)) => {
// Pull these out of context and copy/clone them because we borrow context to get
// a mut participant prior to using these values for additional checks.
let context_epoch = *context.epoch();
let context_state = context.state().clone();
let mut participant = match context
.participants_mut()
.iter_mut()
.find(|participant| participant.process == process)
{
Some(inner) => inner,
None => {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"sender process is not a participant".into(),
),
)]);
}
};
// Ignore the message if the vote's epoch doesn't match our context epoch; this
// could happen under normal operation if a vote was processed after a timeout, and
// is therefore not an error.
if context_epoch != epoch {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"epoch is not the current epoch".into(),
),
)]);
}
// Ignore the message if we are not in the voting window. This could occur if we've
// move on to waiting for decision acks. After that, this is unlikely to occur
// because we will have advanced the epoch and the epoch is checked above; however,
// this could occur if not all Update actions were run successfully.
if !matches!(
context_state,
CoordinatorState::Voting {
vote_timeout_start: _,
}
) {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"context state is not Voting".into(),
),
)]);
}
// Ignore if this participant already voted. This should not occur in normal
// operation.
if participant.vote.is_some() {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"participant has already voted".into(),
),
)]);
}
let mut actions = Vec::new();
// Update the context to record the participant's vote
participant.vote = Some(vote);
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: None,
});
// If all the participants have voted, then either decide to abort or change state.
if context.participants().iter().all(|p| p.vote.is_some()) {
if context.participants().iter().any(|p| p.vote == Some(false)) {
// We got at least one NO vote, so decide to abort. Use a function to fill
// in the abort since abort can occur in other situations as well.
self.push_abort_actions(context, &mut actions)
} else {
// All participants voted yes, so we provide one last opportunity for the
// coordinator to vote no by waiting for the coordinators vote.
context.set_state(CoordinatorState::WaitingForVote);
actions.push(CoordinatorAction::Update {
context,
alarm: None,
});
actions.push(CoordinatorAction::Notify(
// Notify that we are requesting a coordinator vote.
CoordinatorActionNotification::RequestForVote(),
));
}
}
Ok(actions)
}
// A node which has timed out in its uncertainty period will send a `DecisionRequest`
// as part of its termination protocol. If we have the information, answer this request
// with a commit or abort message.
CoordinatorEvent::Deliver(process, CoordinatorMessage::DecisionRequest(epoch)) => {
// The sender must be a participant.
if context
.participants()
.iter()
.any(|participant| participant.process != process)
{
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"sender process is not a participant".into(),
),
)]);
}
// We record the last commit epoch in the context; if the epoch requested was the
// last commit epoch, send a commit message to the requesting process.
if Some(epoch) == *context.last_commit_epoch() {
return Ok(vec![CoordinatorAction::SendMessage(
process,
TwoPhaseCommitMessage::Commit(epoch),
)]);
}
// If the epoch is between the current epoch and the last commit epoch, we know
// that the decision must have been Abort. Thus, we send an Abort message.
if epoch < *context.epoch()
&& (Some(epoch) > *context.last_commit_epoch()
|| context.last_commit_epoch().is_none())
{
return Ok(vec![CoordinatorAction::SendMessage(
process,
TwoPhaseCommitMessage::Abort(epoch),
)]);
}
// A note on ignored messages:
//
// If the epoch is before the last commit epoch, we ignore the message as we know
// all processes decided in the last commit epoch and no process can be in an
// uncertainty period for an older epoch.
//
// If the epoch is after our current epoch, we ignore the message as we do not yet
// know what the future holds. Similarly, we do not yet have a decision for the
// current epoch or we would have advanced to the next epoch already.
Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(format!(
"decision for requested epoch {} is unknown (current epoch: {}, \
last commit epoch: {:?})",
epoch,
context.epoch(),
context.last_commit_epoch()
)),
)])
}
CoordinatorEvent::Deliver(process, CoordinatorMessage::DecisionAck(epoch)) => {
// Pull these out of context and copy/clone them because we borrow context to get
// a mut participant prior to using these values for additional checks.
let context_epoch = *context.epoch();
let context_state = context.state().clone();
let mut participant = match context
.participants_mut()
.iter_mut()
.find(|participant| participant.process == process)
{
Some(inner) => inner,
None => {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"sender process is not a participant".into(),
),
)]);
}
};
// Ignore the message if the ack's epoch doesn't match our context epoch. this
// could happen under normal operation if an ack was processed after a timeout, and
// is therefore not an error.
if context_epoch != epoch {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(format!(
"epoch {epoch} is not the current epoch {context_epoch}",
)),
)]);
}
// Ignore the message if we are not in the decision ack window. This is unlikely to
// occur in practice because we will have advanced the epoch and the epoch is
// checked above; however, this could occur if not all Update actions were run
// successfully.
if !matches!(
context_state,
CoordinatorState::WaitingForDecisionAck {
ack_timeout_start: _,
}
) {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"context state is not WaitingForDecisionAck".into(),
),
)]);
}
// Ignore if this participant already acked. This should not occur in normal
// operation.
if participant.decision_ack {
return Ok(vec![CoordinatorAction::Notify(
CoordinatorActionNotification::MessageDropped(
"participant has already sent a decision ack".into(),
),
)]);
}
let mut actions = Vec::new();
// Update the context to record the participant's ack
participant.decision_ack = true;
actions.push(CoordinatorAction::Update {
context: context.clone(),
alarm: None,
});
// If all the participants have acked, then move to the next epoch.
if context.participants().iter().all(|p| p.decision_ack) {
self.push_advance_epoch_actions(&mut context, &mut actions);
}
Ok(actions)
}
}
}
}