Effects of simultaneous stimulation on the event stream densities of fixed-priority systems

In this paper we present an approach to calculate the maximum density of events in a distributed hard real-time system having tree-shaped dependencies. Thereby we will show that the density of events can be relaxed when taking scheduling dependencies into account. This relaxation has a direct impact on successive tasks and leads to tighter bounds for real-time analysis. We will also provide the real-time analysis for systems with static priorities.