From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S2992988AbXDRSMu (ORCPT ); Wed, 18 Apr 2007 14:12:50 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id S2992989AbXDRSMu (ORCPT ); Wed, 18 Apr 2007 14:12:50 -0400 Received: from mx2.mail.elte.hu ([157.181.151.9]:46372 "EHLO mx2.mail.elte.hu" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S2992988AbXDRSMp (ORCPT ); Wed, 18 Apr 2007 14:12:45 -0400 Date: Wed, 18 Apr 2007 20:12:18 +0200 From: Ingo Molnar To: William Lee Irwin III Cc: Linus Torvalds , Matt Mackall , Nick Piggin , Peter Williams , Mike Galbraith , Con Kolivas , ck list , Bill Huey , linux-kernel@vger.kernel.org, Andrew Morton , Arjan van de Ven , Thomas Gleixner Subject: Re: [Announce] [patch] Modular Scheduler Core and Completely Fair Scheduler [CFS] Message-ID: <20070418181218.GA13628@elte.hu> References: <20070417070155.GF1057@wotan.suse.de> <20070417213954.GE11166@waste.org> <20070418031511.GA18452@wotan.suse.de> <20070418043831.GR11115@waste.org> <20070418050024.GF18452@wotan.suse.de> <20070418055525.GS11115@waste.org> <20070418152355.GU11115@waste.org> <20070418180203.GC31925@holomorphy.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20070418180203.GC31925@holomorphy.com> User-Agent: Mutt/1.4.2.2i X-ELTE-VirusStatus: clean X-ELTE-SpamScore: -2.0 X-ELTE-SpamLevel: X-ELTE-SpamCheck: no X-ELTE-SpamVersion: ELTE 2.0 X-ELTE-SpamCheck-Details: score=-2.0 required=5.9 tests=BAYES_00 autolearn=no SpamAssassin version=3.1.7 -2.0 BAYES_00 BODY: Bayesian spam probability is 0 to 1% [score: 0.0000] Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org * William Lee Irwin III wrote: > It does largely achieve the sort of fairness it set out for itself as > its design goal. One should also note that the queueing mechanism is > more than flexible enough to handle prioritization by a number of > different methods, and the large precision of its priorities is useful > there. So a rather broad variety of policies can be implemented by > changing the ->fair_key calculations. yeah. Note that i concentrated on the bit that makes the largest interactivity improvement: to implement "precise scheduling" (a'ka complete fairness) between the 100+ user tasks that do a complex scheduling dance on a typical desktop on various workloads. Ingo