Iftikhar Ahmad1,*, Syed Zulfiqar Ali Shah1, Ambreen Shahnaz2, Sadeeq Jan1, Salma Noor2, Wajeeha Khalil1, Fazal Qudus Khan3, Muhammad Iftikhar Khan4
CMC-Computers, Materials & Continua, Vol.66, No.1, pp. 157-164, 2021, DOI:10.32604/cmc.2020.012946
Abstract Classical algorithms and data structures assume that the underlying
memory is reliable, and the data remain safe during or after processing. However,
the assumption is perilous as several studies have shown that large and inexpensive memories are vulnerable to bit flips. Thus, the correctness of output of a classical algorithm can be threatened by a few memory faults. Fault tolerant data
structures and resilient algorithms are developed to tolerate a limited number of
faults and provide a correct output based on the uncorrupted part of the data. Suf-
fix tree is one of the important data structures that has widespread… More >
Login
Register
