[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <03a30c9c-eb42-c5c6-b94d-3a62048d8642@sssup.it>
Date: Thu, 10 Nov 2016 12:03:47 +0100
From: Tommaso Cucinotta <tommaso.cucinotta@...up.it>
To: luca abeni <luca.abeni@...tn.it>,
Peter Zijlstra <peterz@...radead.org>
Cc: Ingo Molnar <mingo@...nel.org>,
Thomas Gleixner <tglx@...utronix.de>,
Juri Lelli <juri.lelli@...il.com>,
Steven Rostedt <rostedt@...dmis.org>,
Claudio Scordino <claudio@...dence.eu.com>,
Daniel Bistrot de Oliveira <danielbristot@...il.com>,
Henrik Austad <henrik@...tad.us>, linux-kernel@...r.kernel.org,
"al.biondi@...up.it" <al.biondi@...up.it>
Subject: Re: [RFD] sched/deadline: Support single CPU affinity
On 10/11/2016 10:06, luca abeni wrote:
> is equivalent to the "least laxity first" (LLF) algorithm.
> Giving precedence to tasks with 0 laxity is a technique that is often
> used to improve the schedulability on multi-processor systems.
EDZL (EDF / Zero Laxity first), right? AFAICR, there's quite a lot of
analysis on EDZL for multi-cores... eg, Insik Shin et al....
http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6374195
But, before going the EDZL way, isn't it worthwhile to consider
just splitting tasks among 2 cpus
https://people.mpi-sws.org/~bbb/papers/pdf/rtss16b.pdf
? ... we're working at RETIS on simpler ways to make the AC for
these split tasks cases (cc-ing Alessandro) that doesn't need
demand-bound complex analysis...
My2c,
T.
--
Tommaso Cucinotta, Computer Engineering PhD
Associate Professor at the Real-Time Systems Laboratory (ReTiS)
Scuola Superiore Sant'Anna, Pisa, Italy
http://retis.sssup.it/people/tommaso
Powered by blists - more mailing lists