luiz@cs.utexas.edu (Luiz Augusto Fontes Laranjeira) (03/13/91)
Dear fellows, I am working on fault-tolerant parallel algorithms. The approach I am utilizing is to explore embedded problem redundancy in order to achieve fault-tolerance. Could someone give me some references on redundant properties of algorithms, or invariant properties of algorithms? The redundancy I am looking for is related to the problem itself. I am not concerned with processor redundancy (processor replication) or time redundancy (recomputation). This is why I am looking into algorithmic properties in order to detect embedded redundancy. Anything related to how to identify or detect properties of algorithms would be welcome. Anything about redundant properites of algorithms would also be welcome. Thanks for your time. Regards, Luiz A. Laranjeira -- =========================== MODERATOR ============================== Steve Stevenson {steve,fpst}@hubcap.clemson.edu Department of Computer Science, comp.parallel Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell