Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!samsung!uunet!mcsun!corton!inria!nowhere!isatis.ensmp.fr!zenith From: zenith@isatis.isatis.ensmp.fr (unknown) Newsgroups: comp.sys.transputer Subject: Re: Re producers and consumers Message-ID: Date: 8 Feb 91 09:56:12 GMT References: <1461.9101292134@prg.oxford.ac.uk> <1991Feb6.122949.8210@rodan.acs.syr.edu> Sender: news@isatis.ensmp.fr Organization: Ecole des Mines de Paris Lines: 23 In-Reply-To: greeny@wotan.top.cis.syr.edu's message of 6 Feb 91 19:24:07 GMT In article <1991Feb6.122949.8210@rodan.acs.syr.edu> greeny@wotan.top.cis.syr.edu (Jonathan Greenfield) writes: At a purely practical level, the 'copy-penalty' is probably not a real issue since any program that aspires to efficieny (when compared to sequential programs) must be coarse-grained enough so as to make the communication time negligible when compared to the computation time. When this is the case the 'copy-penalty' will obviously be negligible also. And only true when message passing is not used as the generalized paradigm (as in Occam) and you're writing topology specific code with a detailed awareness of the target machine... I agree. On the other hand ... Steven -- Steven Ericsson Zenith * Email: zenith@ensmp.fr * Fax:(1)64.69.47.09 | Francais:(1)64.69.47.08 | Office:(1)64.69.48.52 Center for Research in Computer Science - Centre de Recherche en Informatique CRI - Ecole Nationale Superieure des Mines de Paris 35 rue Saint-Honore 77305 Fontainebleau France "All see beauty as beauty only because they see ugliness" LaoTzu