From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1755778AbcA1VPn (ORCPT ); Thu, 28 Jan 2016 16:15:43 -0500 Received: from mail-wm0-f54.google.com ([74.125.82.54]:35652 "EHLO mail-wm0-f54.google.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1750803AbcA1VPi (ORCPT ); Thu, 28 Jan 2016 16:15:38 -0500 Date: Thu, 28 Jan 2016 22:15:32 +0100 From: Luca Abeni To: Peter Zijlstra Cc: linux-kernel@vger.kernel.org, Ingo Molnar , Juri Lelli Subject: Re: [RFC 4/8] Improve the tracking of active utilisation Message-ID: <20160128221532.71a76bec@luca-1225C> In-Reply-To: <20160128140053.GR6356@twins.programming.kicks-ass.net> References: <1452785094-3086-1-git-send-email-luca.abeni@unitn.it> <1452785094-3086-5-git-send-email-luca.abeni@unitn.it> <20160114194323.GC6357@twins.programming.kicks-ass.net> <569E29FD.9040909@unitn.it> <20160119134739.GY6357@twins.programming.kicks-ass.net> <20160127143651.4de18ad9@luca-1225C> <20160127143946.GR6357@twins.programming.kicks-ass.net> <20160128121441.0ebde65d@utopia> <20160128122100.GD6357@twins.programming.kicks-ass.net> <20160128144129.789ca176@utopia> <20160128140053.GR6356@twins.programming.kicks-ass.net> X-Mailer: Claws Mail 3.8.0 (GTK+ 2.24.10; i686-pc-linux-gnu) Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org On Thu, 28 Jan 2016 15:00:53 +0100 Peter Zijlstra wrote: > On Thu, Jan 28, 2016 at 02:41:29PM +0100, luca abeni wrote: > > > > Some day we should fix this :-) > > > I am trying to have a better look at the code, and I think that > > implementing bandwidth inheritance (BWI) could be easy (implementing > > M-BWI, that can be analyzed on multi-processor systems, is more > > complex because it requires busy waiting or similar). > > Ah indeed, I remember now. To which I said that if busy-waiting is > 'correct' so then must not busy-waiting be, for that consumes less > cputime and would allow more actual work to be done. The issue is that when the task wakes up after blocking, the scheduler has to check if the current deadline and runtime can still be used (and if they cannot, it generates a new deadline). Of course a blocking solution can work, but the strategy used to check if deadline and runtime are still valid must be changed. I discussed this with the M-BWI authors about one year ago, but we did not arrive to a definitive conclusion. Anyway, I suspect that implementing BWI (without the "M-"), which has no busy-waiting, could be an improvement respect to the current mechanism. Thanks, Luca > > Of course, I might have missed some subtle detail, but intuition > suggests the above. > > > > Nope, but fixing this is likely to be non-trivial. > > > Ok... So, if this is acceptable for this patchset I'll try to keep > > the current PI behaviour, > > Yeah that's fine. That's decidedly outside the scope of these patches. > > > and I'll try to have a look at a better PI > > protocol after the runtime reclaiming stuff is done (that is, I > > make it acceptable for mainline, or we decide that a different > > approach is needed). > > That would be very nice indeed!