Date: Tue, 13 Dec 2016 11:21:35 +0100
From: Peter Zijlstra <peterz@infradead.org>
To: Tommaso Cucinotta <tommaso.cucinotta@sssup.it>
Cc: Ingo Molnar <mingo@kernel.org>, Thomas Gleixner <tglx@linutronix.de>,
        Juri Lelli <juri.lelli@gmail.com>, Luca Abeni <luca.abeni@unitn.it>,
        Steven Rostedt <rostedt@goodmis.org>,
        Claudio Scordino <claudio@evidence.eu.com>,
        Daniel Bistrot de Oliveira <danielbristot@gmail.com>,
        Henrik Austad <henrik@austad.us>, linux-kernel@vger.kernel.org
Subject: Re: [RFD] sched/deadline: Support single CPU affinity
Message-ID: <20161213102135.GJ3124@twins.programming.kicks-ass.net>
References: <20161110080807.GD11311@worktop.programming.kicks-ass.net>
 <91d96936-7504-1578-d4e8-1f2f8d8dc113@sssup.it>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <91d96936-7504-1578-d4e8-1f2f8d8dc113@sssup.it>
User-Agent: Mutt/1.5.23.1 (2014-03-12)
Sender: linux-kernel-owner@vger.kernel.org
Content-Length: 639
Lines: 22

On Thu, Nov 10, 2016 at 11:01:59AM +0100, Tommaso Cucinotta wrote:
> 
> Just a note: if you want to recover arbitrary task affinities, you can re-cast your above test like this:
> 
> for_each_processor(cpu)
>   \sum U[t]/A[t] \leq 1 (or U_max), for each task t on cpu, with utilization U[t] and A[t] tasks overall in its affinity mask
> 

Do I read it correct when I interpret A[t] as the number of CPUs in its
affinity mask?

For A[t] == 1, that reduces to the UP case:

	\Sum U[t] \leq 1

and A[t] = N that reduces to the G-EDF case:

	\Sum U[t] \leq N


Also, does recoverable mean a bound tardiness, or is that something
weaker still?