Xref: utzoo comp.edu:2929 comp.lang.ada:3179 comp.lang.misc:3906
Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!brutus.cs.uiuc.edu!apple!amdahl!fai!kurtl
From: kurtl@fai.UUCP (Kurt Luoto)
Newsgroups: comp.edu,comp.lang.ada,comp.lang.misc
Subject: Re: Teaching Concurrency
Keywords: concurrency, tasks, race conditions, startup
Message-ID: <2680@fai.UUCP>
Date: 17 Jan 90 15:40:35 GMT
References: <7588@hubcap.clemson.edu> <602@agcsun.UUCP> <10330@june.cs.washington.edu> <5598@bd.sei.cmu.edu> <=K01QVDxds13@ficc.uu.net>
Reply-To: kurtl@fai.fai.com (Kurt Luoto)
Organization: Fujitsu America, Inc
Lines: 29

In article <=K01QVDxds13@ficc.uu.net> peter@ficc.uu.net (Peter da Silva) writes:
>I believe that the following two problems are inappropriate, because
>they are subject to race conditions related to task startup time,
>quantum sizes, and so on:
>
>> (3) veryslowsort.
>> (6) quantum mouse.
>-- 
> _--_|\  Peter da Silva. +1 713 274 5180. <peter@ficc.uu.net>.

Problems that are subject to startup problems and race conditions
make excellent material for learing about task synchronization
and coordination issues.  All the more reason to include them.

f
l
u
f
f

l
i
n
e
s
-- 

----------------
Kurt W. Luoto     kurtl@fai.com   or   ...!sun!fai!kurtl