Path: utzoo!utgpu!watmath!iuvax!mailrus!shadooby!egrunix!cogswell
From: cogswell@egrunix.UUCP (Dan Cogswell)
Newsgroups: comp.sys.amiga.tech
Subject: Computing "variance of wait time"
Message-ID: <258@egrunix.UUCP>
Date: 17 Nov 89 04:04:03 GMT
Reply-To: cogswell@unix.secs.oakland.edu (Dan Cogswell)
Organization: Oakland University, Rochester, MI
Lines: 17

This is the wrong newsgroup for this, but I'm using an Amiga, and the people
here are some of the smarter on the net, so here goes:

I'm writing a simulation of a disk scheduler employing various scheduling
algorithms (First-come-first-serve,Shortest-seek-time-next, etc).

In this simulation, a parent process launches 10 child
processes, which immediately make requests for certain a "cylinder" from
a simulated disk.  The wait-time for each process can be easily computed,
as can the average wait-time, but how does one computer the "variance of
wait-time".  Our professor didn't explain this, and feels we should know
it!  

-- 
Dan Cogswell                               "Gangster Fun -- It's the beat 
(313)625-3234				      that you can wig-out to..."
INET: cogswell@unix.secs.oakland.edu
UUCP:  cogswell@egrunix.UUCP