From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1161401AbXDQWdV (ORCPT ); Tue, 17 Apr 2007 18:33:21 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id S1161403AbXDQWdV (ORCPT ); Tue, 17 Apr 2007 18:33:21 -0400 Received: from holomorphy.com ([66.93.40.71]:50305 "EHLO holomorphy.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1161401AbXDQWdU (ORCPT ); Tue, 17 Apr 2007 18:33:20 -0400 Date: Tue, 17 Apr 2007 15:32:56 -0700 From: William Lee Irwin III To: Matt Mackall Cc: Ingo Molnar , Davide Libenzi , Nick Piggin , Peter Williams , Mike Galbraith , Con Kolivas , ck list , Bill Huey , Linux Kernel Mailing List , Linus Torvalds , Andrew Morton , Arjan van de Ven , Thomas Gleixner Subject: Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS] Message-ID: <20070417223256.GP2986@holomorphy.com> References: <46244A52.4000403@bigpond.net.au> <20070417042954.GG25513@wotan.suse.de> <20070417060955.GO8915@holomorphy.com> <20070417061503.GC1057@wotan.suse.de> <20070417070949.GR8915@holomorphy.com> <20070417073308.GB30559@elte.hu> <20070417090538.GU8915@holomorphy.com> <20070417092422.GA19414@elte.hu> <20070417220809.GF11166@waste.org> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20070417220809.GF11166@waste.org> Organization: The Domain of Holomorphy User-Agent: Mutt/1.5.13 (2006-08-11) Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org On Tue, Apr 17, 2007 at 11:24:22AM +0200, Ingo Molnar wrote: >> yeah. If you could come up with a sane definition that also translates >> into low overhead on the algorithm side that would be great! On Tue, Apr 17, 2007 at 05:08:09PM -0500, Matt Mackall wrote: > How's this: > If you're running two identical CPU hog tasks A and B differing only by nice > level (Anice, Bnice), the ratio cputime(A)/cputime(B) should be a > constant f(Anice - Bnice). > Other definitions make things hard to analyze and probably not > well-bounded when confronted with > 2 tasks. > I -think- this implies keeping a separate scaled CPU usage counter, > where the scaling factor is a trivial exponential function of nice > level where f(0) == 1. Then you schedule based on this scaled usage > counter rather than unscaled. > I also suspect we want to keep the exponential base small so that the > maximal difference is 10x-100x. I'm already working with this as my assumed nice semantics (actually something with a specific exponential base, suggested in other emails) until others start saying they want something different and agree. -- wli