lkml.org 
[lkml]   [2016]   [Nov]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: [RFD] sched/deadline: Support single CPU affinity
    From
    Date
    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

    \
     
     \ /
      Last update: 2016-11-10 12:04    [W:3.470 / U:1.108 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site