Deadline-monotonic software scheduling for the co-synthesis of parallel hard real-time systems

This paper focuses on software scheduling in hard real-time embedded systems. It uses the deadline-monotonic scheduling heuristics, where the analysis whether the hard real-time conditions are met, is done by a schedulability test. The test presented in this paper overcomes the problems of existing approaches with parallel communicating tasks. The essential of the test is, that the communication caused precedence constraints are mapped to minimum-maximum offset intervals, to deal with multiperiod systems, where fixed offset values are insufficient. By this method the deadlines and the offset intervals are computed automatically during the efficient analysis