Ft-Isort Efficient Fault Tolerance For Introsort

Ft-Isort Efficient Fault Tolerance For Introsort



This paper proposes the first theoretically-sound, practical fault tolerant introsort with negligible overhead: FT-iSort. To tolerate comparison errors, we use minimal TMR protection via exploiting the properties of the effects of soft errors on introsort.


The state-of-the-art fault tolerant libraries/algorithms: 1. FT matrix decompositions ([3 PPoPP’19, 4 SC’18, 5 HPDC’16, 6 IPDPS’16]) 2. FT fast Fourier transfrom ([7 SC’17]) 3. FT iterative methods ([8 HPDC’16]) Sorting, as one of the most impactful algorithms, lacks e?cient fault tolerance ! Software level solutions for soft errors: ABFT, FT-iSort: efficient fault tolerance for introsort. Sihuan Li, Hongbo Li, +7 authors Z. Chen. SC. 2019. Corpus ID: 207955565. Introspective sorting is a ubiquitous sorting algorithm which underlies many large scale distributed systems. Hardware-mediated….


FT-iSort: Efficient Fault Tolerance for Introsort. Proceedings of the 31st ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, Denver, Colorado, USA, Nov 17 – 22, 2019. Acceptance Rate: 20.9% (72/344), This paper proposes the first theoretically-sound, practical fault tolerant introsort with negligible overhead: FT-iSort .


11/14/2019  · FT-iSort: Efficient Fault Tolerance for Introsort – Sihuan Li, Hongbo Li, Xin Liang, Jieyang Chen, Elisabeth Giem, Kaiming Ouyang, Kai Zhao, Sheng Di, Franck Cappello, Zizhong Chen Full-State Quantum Circuit Simulation by Using Data Compression – Xin-Chuan Wu, Sheng Di , Emma Maitreyee Dasgupta, Franck Cappello, Hal Finkel, Yuri Alexeev, Frederic T. Chong, FT-iSort: Efficient Fault Tolerance for Introsort, Proceedings of the 31st ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, Denver, Colorado, USA, Nov 17 – 22, 2019. Acceptance Rate: 20.9% (72/344). SC’19: Xin Liang, Sheng Di, Sihuan Li, Dingwen Tao, Bogdan Nicolae, Zizhong Chen, and Franck Cappello, FT-iSort: Efficient Fault Tolerance for Introsort, Proceedings of the 31st ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, Denver, Colorado, USA, Nov 17 – 22, 2019. Acceptance Rate: 20.9% (72/344). ICS’19, The technique converts any network that uses unreliable comparators to a fault – tolerant network that produces the correct output with overwhelming probability, even if each comparator is faulty …


S. Li, H. Li, X. Liang, J. Chen, E. Giem, K. Ouyang, K. Zhao, S. Di, F. Cappello, and Z. Chen, FT-iSort: Efficient Fault Tolerance for Introsort, in IEEE/ACM 30th The International Conference for High Performance computing, Networking, Storage and Analysis (IEEE/ACM SC2019), 2019.

Advertiser