Xref: utzoo comp.unix.questions:31158 comp.unix.wizards:25500
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!olivea!uunet!convex!usenet
From: tchrist@convex.COM (Tom Christiansen)
Newsgroups: comp.unix.questions,comp.unix.wizards
Subject: Re: talk session
Message-ID: <1991May09.161318.12446@convex.com>
Date: 9 May 91 16:13:18 GMT
References: <1991May7.102219.25557@ssd.kodak.com> <1991May8.194940.13610@watson.ibm.com> <8662: May914:21:3891@kramden.acf.nyu.edu>
Sender: usenet@convex.com (news access account)
Reply-To: tchrist@convex.COM (Tom Christiansen)
Organization: CONVEX Software Development, Richardson, TX
Lines: 18
Nntp-Posting-Host: pixel.convex.com

From the keyboard of brnstnd@kramden.acf.nyu.edu (Dan Bernstein):
:In article <1991May8.194940.13610@watson.ibm.com> metzger@watson.ibm.com (Perry E. Metzger) writes:
:> >|> > 		for (i = 0; i < delay; i++)
:> >|> > 			;
:> Really, there is ABSOLUTELY NO EXCUSE for busy waiting on a
:> timesharing system.
:
:There would be if you had a really, really smart compiler that detected
:loops of the above form, timed 100 runs to see how long each loop took,
:and stuck in an appropriate usleep() or select() or nap() or poll() for
:that machine. :-)

Really smart compilers optimize the whole loop away anyway. :-(

--tom
--
Tom Christiansen		tchrist@convex.com	convex!tchrist
		"So much mail, so little time."