Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!netnews.upenn.edu!grad2.cis.upenn.edu!iyengar
From: iyengar@grad2.cis.upenn.edu (Anand Iyengar)
Newsgroups: comp.arch
Subject: Re: The Future of Buses (and Futurebus)
Message-ID: <35109@netnews.upenn.edu>
Date: 20 Dec 90 23:57:36 GMT
References: <36734@cup.portal.com> <1990Dec12.022537.17461@news.arc.nasa.gov> <1200@shakti.ncst.ernet.in>
Sender: news@netnews.upenn.edu
Reply-To: iyengar@grad1.cis.upenn.edu (Anand Iyengar)
Organization: The Lab Rats
Lines: 19

In article <1200@shakti.ncst.ernet.in> shri@ncst.ernet.in (H.Shrikumar ) writes:
>   EGPA had a cylinder of PEs and Memories, each memory multi-ported
>onto the neighbouring processors. ie. take a fabric of alternate
>PEs and MemoryElements, each PE connected to several MEs, and wrap-around
>this fabric to get a cylinder. You started your program at some
>convinient vertical cut along the cylinder, and the program
>"data-flowed" around to successive PEs (say) clockwise.

	Interesting.  If I don't mis-understand, the basic topology a mesh
(before wrapping)?  How does the program decide which nodes to propagate to
(and on a related note, is explicit message passing used, or is there global
memory addressing)?  Is a toroidal wrapping any more useful?  

						Anand.  
--
"The nearer your destination, the more you're slip-sliding away..."
iyengar@grad1.cis.upenn.edu, iyengar@eniac.seas.upenn.edu
--- Lbh guvax znlor vg'yy ybbx orggre ebg-guvegrrarg? ---
Disclaimer:  It's a forgery.