Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!ub!galileo.cc.rochester.edu!rochester!pt.cs.cmu.edu!gandalf.cs.cmu.edu!lindsay
From: lindsay@gandalf.cs.cmu.edu (Donald Lindsay)
Newsgroups: comp.sys.super
Subject: Re: Parallelism
Message-ID: <13365@pt.cs.cmu.edu>
Date: 10 Jun 91 19:21:53 GMT
References: <1991Jun10.144354.695@chpc.utexas.edu>
Organization: Carnegie Mellon
Lines: 20

In article <1991Jun10.144354.695@chpc.utexas.edu> 
	gary@chpc.utexas.edu (Gary Smith) writes:
>How many problems do you know of that are that parallel?

More than you seem to think.

- areas that have been commercially important, such as sorting/retrieval.

- areas of growing commercial importance, such as ray tracing.

- areas previously thought irretrievably sequential, such as going 
	down a single linked list.

- areas that were unvectorizable (too irregular and data dependant), 
	such as verification of an integrated circuit's layout.

- areas that were never attempted before, such as numerical work in
	QCD (Quantam Chromodynamics).
-- 
Don		D.C.Lindsay 	Carnegie Mellon Robotics Institute