2000 character limit reached
Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance (1511.00212v1)
Published 1 Nov 2015 in cs.DC
Abstract: Communication-avoiding algorithms allow redundant computations to minimize the number of inter-process communications. In this paper, we propose to exploit this redundancy for fault-tolerance purpose. We illustrate this idea with QR factorization of tall and skinny matrices, and we evaluate the number of failures our algorithm can tolerate under different semantics.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.