Abstract
This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).
Similar content being viewed by others
References
Cucu, L., & Sorel, Y. (2003). Schedulability condition for systems with precedence and periodicity constraints without preemption. In Proceedings of real-time and embedded systems (pp. 292–305).
Cucu, L., Kocik, R., & Sorel, Y. (2002). Real-time scheduling for systems with precedence, periodicity and latency constraints. In Proceedings of real-time and embedded systems (pp. 173–188).
Gerber, R., Pugh, W., & Saksena, M. (1997). Parametric dispatching of hard real-time tasks. IEEE Transactions on Computers, 44(3), 471–479.
Goddard, S. (2000). Constraints on data-flow. PhD thesis from University of North Carolina.
Grandpierre, T., Lavarenne, C., & Sorel, Y. (1999). Optimized rapid prototyping for real time embedded heterogeneous multiprocessors. In Proceedings of codes’99 7th international workshop on hardware/software co-design (pp. 74–78).
Jeffay, K., Stanat, D. F., & Martel, C. U. (1991). On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of IEEE symposium on real-time systems (pp. 129–139).
Kang, D.-I., & Gerber, R., Saksena, M. (1997). Performance-based design of distributed real-time systems. In Proceedings of IEEE real-time technology and applications (pp. 2–13).
Klein, M. H., Lehoczky, J. P., & Rajkumar, R. (1994). Rate-monotonic analysis for real-time industrial computing. IEEE Computer, 27(1), 24–33.
Korst, J. H. M., Aarts, E. H. L., & Lenstra, J. K. (1996). Scheduling periodic tasks. INFORMS Journal on Computing, 9(4), 351–362.
Liu, C. L., & Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1), 46–61.
Torngren, M. (1998). Fundamentals of implementing real-time control application in distributed computer systems. Journal of Real-Time Systems, 14, 219–260.
van Beek, P., & Wilken, K. D. (2001). Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. In Lecture notes in computer science (Vol. 2239, pp. 625–629). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Additional information
These results were obtained while the first author was at INRIA Rocquencourt.
Rights and permissions
About this article
Cite this article
Cucu, L., Pernet, N. & Sorel, Y. Periodic real-time scheduling: from deadline-based model to latency-based model. Ann Oper Res 159, 41–51 (2008). https://doi.org/10.1007/s10479-007-0279-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0279-9