From: Paul Wexelblat <wex@cs.uml.edu>
Newsgroups: comp.parallel
Subject: Help wanted (looking for source material)
Date: 3 Sep 1998 20:00:08 GMT
Organization: UMass Lowell Computer Science Dept
Approved: bigrigg@cs.cmu.edu
Message-Id: <6smsg8$9oj$1@encore.ece.cmu.edu>
Originator: bigrigg@ece.cmu.edu


I am looking for a couple of examples for a presentation and would
appreciate any pointers 

First,
I am looking for a couples of simple case examples of algorithms that
are more efficient on one topology than another. (Why would you use a
hypercube vs. torus vs. butterfly to solve a given problem - if you
had a choice.)

Second,
Assuming you had a reconfigurable parallel processor, can you think of
a problem (algorithm) that could benefit. Why(when) would having a
dynamically reconfigurable multiprocessor be a win for a single
problem. 

Any help in identifying resources (examples) would be a big help.

Thanks...
    ...wex

--
Articles to bigrigg+parallel@cs.cmu.edu (Admin: bigrigg@cs.cmu.edu)
Archive: http://www.hensa.ac.uk/parallel/internet/usenet/comp.parallel