Path: utzoo!news-server.csri.toronto.edu!rutgers!ucsd!mvb.saic.com!ncr-sd!ncrcae!hubcap!fpst
From: luiz@cs.utexas.edu (Luiz Augusto Fontes Laranjeira)
Newsgroups: comp.parallel
Subject: Requesting references about algorithmic redundancy
Message-ID: <1991Mar12.201203.24300@hubcap.clemson.edu>
Date: 12 Mar 91 19:50:10 GMT
Sender: fpst@hubcap.clemson.edu (Steve Stevenson)
Organization: U. Texas CS Dept., Austin, Texas
Lines: 30
Approved: parallel@hubcap.clemson.edu

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