Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!indetech!cirrus!dhesi From: dhesi@cirrus.com (Rahul Dhesi) Newsgroups: comp.unix.wizards Subject: Re: Load Avarage graph pattern Message-ID: <1991Jun12.001851.5019@cirrus.com> Date: 12 Jun 91 00:18:51 GMT References: <2155@ccsg.tau.ac.il> <14081@dog.ee.lbl.gov> Sender: news@cirrus.com Organization: Cirrus Logic Inc. Lines: 15 In <14081@dog.ee.lbl.gov> torek@elf.ee.lbl.gov (Chris Torek) writes: >The load average is computed by iterations of the formula: > -1/k -1/k > average = average e + n (1 - e ) > t t-1 Just to give credit where it is apparently due, we should note that the concept of an exponentially-decaying measure of the number of jobs in the ready queue was probably invented in the TENEX operating system, which ran on DECsystem-10 machines. BSD seems to have borrowed the idea from there and given it a life of its own. -- Rahul Dhesi UUCP: oliveb!cirrusl!dhesi