  We present convergence results in expectation for stochastic subspace
correction schemes and their accelerated versions to solve symmetric
positive-definite variational problems, and discuss their potential for
achieving fault tolerance in an unreliable compute network. We employ the
standard overlapping domain decomposition algorithm for PDE discretizations to
discuss the latter aspect.
