From mboxrd@z Thu Jan 1 00:00:00 1970 From: Peter Zijlstra Subject: Re: RFC for a new Scheduling policy/class in the Linux-kernel Date: Mon, 13 Jul 2009 19:25:41 +0200 Message-ID: <1247505941.7500.39.camel@twins> References: <200907102350.47124.henrik@austad.us> <1247336891.9978.32.camel@laptop> <4A594D2D.3080101@ittc.ku.edu> <1247412708.6704.105.camel@laptop> <1247499843.8107.548.camel@Palantir> Mime-Version: 1.0 Content-Type: text/plain Content-Transfer-Encoding: 7bit Cc: Douglas Niehaus , Henrik Austad , LKML , Ingo Molnar , Bill Huey , Linux RT , Fabio Checconi , "James H. Anderson" , Thomas Gleixner , Ted Baker , Dhaval Giani , Noah Watkins , KUSP Google Group , Tommaso Cucinotta , Giuseppe Lipari To: Raistlin Return-path: Received: from viefep20-int.chello.at ([62.179.121.40]:42247 "EHLO viefep20-int.chello.at" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1756389AbZGMRZu (ORCPT ); Mon, 13 Jul 2009 13:25:50 -0400 In-Reply-To: <1247499843.8107.548.camel@Palantir> Sender: linux-rt-users-owner@vger.kernel.org List-ID: On Mon, 2009-07-13 at 17:44 +0200, Raistlin wrote: > > PIP doesn't suffer this, but does suffer the pain from having to > > reimplement the full schedule function on the waitqueues, which when you > > have hierarchical scheduling means you have to replicate the full > > hierarchy per waitqueue. > > > And, further than this, at least from my point of view, if you have > server/group based scheduling, and in general some kind of budgeting or > bandwidth enforcing mechanism in place, PIP is far from being a > solution... I think you can extend PIP to include things like bandwidth inheritance too. Instead of simply propagating the priority through the waitqueue hierarchy, you can pass the actual task around, and having this task you can indeed consume its bandwidth etc.. But sure, hierarchical scheduling and things really complicate the waitqueue implementation.