Scheduling algorithm for aperiodic groups of tasks in distributed real-time systems and its holistic analysis

This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to be included, together with a set of aperiodic servers to deal with the processor utilization and the network bandwidth local to the system nodes, in a distributed aperiodic server, and ii) an extensive analysis of the behaviour of the proposed scheduling algorithm by applying an holistic approach. The sensitivity of the response time of the algorithm to the parameters involved is also studied.