Chapter%201%20-%20Problem%20Statement

1
Chapter 1 - Problem Statement

• Given an arbitrary piece of MPI code,
• Inject application-level checkpointing into the
  code, and
• Be competitive with hand-written code

2
Chapter 2 - Codegen

• Sequential program explicit checkpoint
• Variation 1 - checkpoint everything
• "simple analysis" and code generation
• DOME, Beck's work
• Variation 2 - minimize chpt size
• Use program text to reconstruct values
• "xf(...) yg(x) zh(x,y)chpt()"
• "simple analysis" and code generation
• Jim

3
Chapter 3 - space/time optimization

• Variation 1 and 2 are two ends of a spectrum
• still Sequential program explicit checkpoint
• compiler chooses what to save and what to
  reconstruct

4
Chapter 4 - placing checkpoints

• just sequential programs
• Place checkpoints so that
• overhead of checkpointing using Chapter 3 is
  minimized.
• Checkpoints occur "frequently enough"

5
Chapter 5 - general purpose system

• arbitrary parallel (MPI) codes
• Sequential checkpointing using Chapter 4
• What checkpointing protocol to use?
• Uncoordinated
• whenever a node reaches a checkpoint
• Coordinated, Non-blocking
• Sufficient - all nodes reach a checkpoint at
  roughly the same time.
• Necessary - prove that deadlock cannot occur.

6
Chapter 5 - general purpose system

• Coordinated, Blocking
• All processes execute MPI_BARRIER, MPI_REDUCE,
  and this is a reasonable point to checkpoint.

7
Chapters 6, ... - Experiments, Related Work,
Conclusions