Coding techniques for fault-tolerant parallel prefix computations in Abelian groups
AuthorHadjicostis, Christoforos N.
Google Scholar check
MetadataShow full item record
This paper presents coding techniques that can be used to provide fault tolerance to a parallel prefix computation that is performed on a binary tree of processing nodes. More specifically, we discuss how a parallel prefix computation in an arbitrary Abelian group can be protected using group homomorphisms. The proposed approach is general enough to handle a variety of group operations of interest and allows for designs ranging from simple parity schemes to full replication. Error detecting and correcting mechanisms are used solely at the leaf nodes and can capture faults at any node or link within the binary tree architecture on which the parallel prefix computation is performed. Furthermore, by tracking the propagation of errors in the binary tree, our method can identify a processing node that has permanently failed based on information from simple error detecting mechanisms at the leaf nodes. © The British Computer Society; all rights reserved.
Showing items related by title, author, creator and subject.
Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets Hadjicostis, Christoforos N.; Verghese, G. C. (2002)The traditional approach to fault-tolerant computation has been via modular hardware redundancy. Although universal and simple, modular redundancy is inherently expensive and inefficient. By exploiting particular structural ...
Particle deposition in a realistic geometry of the human conducting airways: Effects of inlet velocity profile, inhalation flowrate and electrostatic charge Koullapis, P. G.; Kassinos, Stavros C.; Bivolarova, M. P.; Melikov, A. K. (2016)Understanding the multitude of factors that control pulmonary deposition is important in assessing the therapeutic or toxic effects of inhaled particles. The use of increasingly sophisticated in silico models has improved ...
Stein, J. L.; Louca, Loucas S. (1996)Previous research has developed search algorithms for deducing Proper Models (minimum complexity models with physically meaningful parameters) of dynamic systems. It has also been proposed that these Proper Models can be ...