Path: utzoo!utgpu!watmath!att!tut.cis.ohio-state.edu!mailrus!cornell!uw-beaver!uw-june!pardo From: pardo@june.cs.washington.edu (David Keppel) Newsgroups: comp.lang.misc Subject: Re: Coverage of multitasking Message-ID: <8972@june.cs.washington.edu> Date: 9 Aug 89 23:03:23 GMT References: <2592@aplcen.apl.jhu.edu> Reply-To: pardo@june.cs.washington.edu (David Keppel) Organization: University of Washington, Computer Science, Seattle Lines: 17 genesch@aplvax.jhuapl.edu (Eugene Schwartzman) writes: >[Teach parallelism, but not beginning, maybe sophmore.] I disagree, but I don't know the reasoning behind parallelism as one of the 11 CACM topics. Parallelism can be quite complicated. But it can also be quite simple. Consider filters in Un*x. It is pretty easy to understand what's going on in `eqn foo | tbl | troff'. I've seen (and written!) a fair number of programs where some kind of threads and pipes would have made writing the program *simpler* by removing a level of intermediate data structures. ;-D on ( Opinions move faster than light ) Pardo -- pardo@cs.washington.edu {rutgers,cornell,ucsd,ubc-cs,tektronix}!uw-beaver!june!pardo