This session addresses the problem of real-time scheduling in embedded systems.  The first paper proposes a new utilisation-based schedulability bound for Deadline-Monotonic scheduling that supercedes existing bounds, thus reducing their level of pessimism.  The second paper includes distance constraints in fixed priorities scheduling arising from tasks that are triggered by messages scheduled non-preemptively on a bus.  As a consequence, the pessimism of the computed upper bounds for the worst-case response times is reduced.  The third paper addresses embedded systems composed of several reconfigurable units.  In such case, the reconfiguration overhead must be considered in the tasks scheduling.  The paper proposes taking into account the specific overhead associated to each transition and thus allows improving the schedulability levels when compared to when the maximum fixed transition overhead is considered.