Messages in this thread |  | | Date | Thu, 13 Jun 1996 04:28:30 -0400 (EDT) | From | Kevin M Bealer <> | Subject | Re: 2.0, loggings, cpu quotas, 2.1 issues, etc. |
| |
One (too) simple choice might be to charge for kernel time .. CPU spent swapping for a process is added to CPU load from that process. If CPU % is then quotad it will keep their process from causing more than it's percent of system load.
While this falls out of the fairness test in many ways, it does provide the incentives all lined up in the right direction: towards non-peak times, low memory consumption and sharing of resources. (run a script that watches the atime on the library you want :) )
I assume any CPU dividing is ignored when only one process is ready-to-run?
Also this would cut up a lot of denial-of-service attacks.
For example a program which allocated (physical memory)+1 bytes and then poked around at random would mostly cripple itself by queueing up swapping time on the counter -- but then you would have to divide up the "idle" time the kernel spends while all the processes are blocked waiting for the swap drive.
Ok so I didn't say it would be fair. (shrug)
__kmb203@psu.edu_________________________Debian__1.1___Linux__2.0.0___ You have new mail in /dev/null
|  |