Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance

Name: Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance
Creator: Camille Coti
Keywords: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), 02 engineering and technology, 0101 mathematics, 01 natural sciences

Camille Coti

Found an issue? Give us feedback

http://arxiv.org/pdf...arrow_drop_down

http://arxiv.org/pdf/1511.0021...

Article

Data sources: UnpayWall

arXiv.org e-Print Archive

Preprint . 2015

Data sources: arXiv.org e-Print Archive

https://doi.org/10.1109/bigdat...

Article . 2016 . Peer-reviewed

Data sources: Crossref

https://dx.doi.org/10.48550/ar...

Article . 2015

License: arXiv Non-Exclusive Distribution

Data sources: Datacite

DBLP

Article

Data sources: DBLP

DBLP

Conference object

Data sources: DBLP

https://dx.doi.org/10.1109/big...

Article

Data sources: Microsoft Academic Graph

Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object 01 Apr 2016Embargo end date: 01 Jan 2015Publisher:IEEEJournal:2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS)

Authors: Camille Coti;

doi: 10.1109/bigdatasecurity-hpsc-ids.2016.59 , 10.48550/arxiv.1511.00212

arXiv: 1511.00212

Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance

- Summary
- Subjects
- Metrics

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.

Related Organizations

French National Centre for Scientific Research
France

Keywords

FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	5
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

5

Average

Green

Fields of Science (4) View all

Fields of Science