This report provides an introduction to the design of scheduling algorithms to cope with faults on large-scale parallel platforms. We study \emph{checkpointing} and show how to derive the optimal checkpointing period. Then we explain how to combine checkpointing with \emph{fault prediction}, and discuss how the optimal period is modified when this combination is used. Finally we follow the very same approach for the combination of checkpointing with \emph{replication}.