Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!pur-ee!muttiah
From: pur-ee!muttiah@stable.ecn.purdue.edu (Ranjan S Muttiah)
Newsgroups: comp.parallel
Subject: Justifications for || processing
Message-ID: <12301@hubcap.clemson.edu>
Date: 17 Dec 90 13:55:49 GMT
Sender: fpst@hubcap.clemson.edu
Organization: Purdue University Engineering Computer Network
Lines: 5
Approved: parallel@hubcap.clemson.edu

I'm wondering how people in the application side of parallel processing
justify coding for a parallel machine.  I would be very much interested
in knowing how much complexity analysis plays a part in this.

On a related note, how prevalent are compilers that parallelize code ?