From: kesavan@cis.ohio-state.edu (Ram Kesavan)
Newsgroups: comp.parallel
Subject: Re: Algorithm for multiple multicasting needed!
Date: 9 Sep 1998 17:19:05 GMT
Organization: Ohio State University
Approved: bigrigg@cs.cmu.edu
Message-Id: <6t6da9$sni$1@encore.ece.cmu.edu>
Originator: bigrigg@ece.cmu.edu


> I need an algorithm for: multiple multicast in mesh-connected
> parallel computers. It's a wrap-around mesh.

We have done some work in that area. There's a paper in the
International Conference on Parallel Processing (ICPP), 1996, called
"Minimizing Node Contention in Multiple Multicast on Wormhole k-ary
n-cube Networks" in Vol I of the proceedings, pages 188-195. We also
have a more complete version accepted for publication in IEEE
TPDS. That version is available on our website:
http://www.cis.ohio-state.edu/~panda/pac.html  Click on "PAC Group
Publications", followed by "Papers". 

hope that helps,
kram

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