Abstract This article is concerned with the discretisation of Stokes equations on time-dependent domains in an Eulerian coordinate framework. Our work can be seen as extension a recent paper by Lehrenfeld and Olshanskii (ESAIM: M2AN 53(2):585–614, 2019), where BDF-type time-stepping schemes are studied for parabolic equation moving domains. For space discretisation, geometrically unfitted finit...

We describe the design and implementation of a tool for applying rate monotonic scheduling (RMS) technology in distributed environments that serve real-time applications. Our tool, DRMS, enables users to deene sets of real-time tasks and the processors to which the tasks will be allocated. The tool nds allocations such that real-time constraints of the tasks are guaranteed. Several feasibility ...

Rate Monotonic Scheduling (RMS) policy is a widely accepted scheduling strategy for real-time systems due to strong theoretical foundations and features attractive to practical uses. For a periodic task set of n tasks with deadlines at the end of task periods, it guarantees a feasible schedule on a single processor as long as the utilization factor of the task set is below n(2 1=n 1) which conv...

Optimal scheduling of real-time tasks on multiprocessor systems is known to be computationally intractable for large task sets. Any practical scheduling algorithm for assigning realtime tasks to a multiprocessor system presents a trade-off between its computational complexity and its performance. In this study, new schedulability conditions are presented for homogeneous multiprocessor systems w...