%0 Journal Article %1 journals/corr/abs-1210-4290 %A Fang, Jun %A Shen, Yanning %A Li, Hongbin %D 2012 %J CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMR %K adhoc checkpointing dependency networks recovery rollback tracking %N 4 %P 1-16 %R 10.5121/iju.2015.6403 %T A Fast Iterative Algorithm for Recovery of Sparse Signals from One-Bit Quantized Measurements %U http://dblp.uni-trier.de/db/journals/corr/corr1210.html#abs-1210-4290 %V 6 %X This paper describes two-fold approach towards utilizing Triple Modular Redundancy (TMR) in Wireless Adhoc Network (AdocNet). A distributed checkpointing and recovery protocol is proposed. The protocol eliminates useless checkpoints and helps in selecting only dependent processes in the concerned checkpointing interval, to recover. A process starts recovery from its last checkpoint only if it finds that it is dependent (directly or indirectly) on the faulty process. The recovery protocol also prevents the occurrence of missing or orphan messages. In AdocNet, a set of three nodes (connected to each other) is considered to form a TMR set, being designated as main, primary and secondary. A main node in one set may serve as primary or secondary in another. Computation is not triplicated, but checkpoint by main is duplicated in its primary so that primary can continue if main fails. Checkpoint by primary is then duplicated in secondary if primary fails too.

@article{journals/corr/abs-1210-4290, abstract = {This paper describes two-fold approach towards utilizing Triple Modular Redundancy (TMR) in Wireless Adhoc Network (AdocNet). A distributed checkpointing and recovery protocol is proposed. The protocol eliminates useless checkpoints and helps in selecting only dependent processes in the concerned checkpointing interval, to recover. A process starts recovery from its last checkpoint only if it finds that it is dependent (directly or indirectly) on the faulty process. The recovery protocol also prevents the occurrence of missing or orphan messages. In AdocNet, a set of three nodes (connected to each other) is considered to form a TMR set, being designated as main, primary and secondary. A main node in one set may serve as primary or secondary in another. Computation is not triplicated, but checkpoint by main is duplicated in its primary so that primary can continue if main fails. Checkpoint by primary is then duplicated in secondary if primary fails too. }, added-at = {2018-09-14T06:09:45.000+0200}, author = {Fang, Jun and Shen, Yanning and Li, Hongbin}, biburl = {https://www.bibsonomy.org/bibtex/2f346e6f2362565d1061e1555c05121d6/sebastian09}, doi = {10.5121/iju.2015.6403}, ee = {http://arxiv.org/abs/1210.4290}, interhash = {409dd6e55fb1e8ca25a3c2595e8d126c}, intrahash = {f346e6f2362565d1061e1555c05121d6}, issn = {0976-2213}, journal = {CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMR}, keywords = {adhoc checkpointing dependency networks recovery rollback tracking}, language = {english}, month = {october 2015}, number = 4, pages = {1-16}, timestamp = {2018-09-14T06:09:45.000+0200}, title = {A Fast Iterative Algorithm for Recovery of Sparse Signals from One-Bit Quantized Measurements}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1210.html#abs-1210-4290}, volume = 6, year = 2012 }