skip to main content
research-article

Interactive schedulability analysis

Published:12 December 2007Publication History
Skip Abstract Section

Abstract

A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again. This iteration is repeated until a schedulable design is obtained. However, the schedulability analysis problem for most task models is intractable (usually co-NP hard) and, hence, such an iterative design process is often very expensive. To get around this problem, we introduce the concept of “interactive” schedulability analysis. It is based on the observation that if only a small number of system parameters are changed, then it is not necessary to rerun the full schedulability analysis algorithm, thereby making the iterative design process considerably faster. We refer to this analysis as being “interactive” because it is supposed to be run in an interactive mode. This concept is fairly general and can be applied to a wide variety of task models. In this paper, we have chosen the recurring real-time task model, because it can be used to represent realistic applications from the embedded systems domain (containing conditional branches and fine-grained deadline constraints). Our experimental results show that using our scheme can lead to more than 20× speedup for each invocation of the schedulability analysis algorithm, compared to the case where the full algorithm is run.

References

  1. Albers, K. and Slomka, F. 2004. An event stream driven approximation for the analysis of real-time systems. In Proceedings of the Euromicro Conference on Real-Time Systems, Catania, Italy. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., and Yi, W. 2003. TIMES: A tool for schedulability analysis and code generation of real-time systems. In International Workshop on Formal Modeling and Analysis of Timed Systems. Lecture Notes in Computer Science 2791, Marseille, France, Springer-Verlag, New York.Google ScholarGoogle Scholar
  3. Baruah, S. 1998a. Feasibility analysis of recurring branching tasks. In Proceedings of the Euromicro Workshop on Real-Time Systems, Berlin, Germany. IEEE Computer Society, Los Alamitos, CA.Google ScholarGoogle ScholarCross RefCross Ref
  4. Baruah, S. 1998b. A general model for recurring real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Baruah, S. 2003. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Systems 24, 1, 93--128. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Baruah, S., Chen, D., Gorinsky, S., and Mok, A. 1999. Generalized multiframe tasks. Real-Time Systems 17, 1, 5--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bini, E. and Natale, M. D. 2005. Optimal task rate selection in fixed priority systems. In Proceedings of the IEEE Real-Time Systems Symposium. Miami, FL. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Buttazzo, G. 1997. Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publ., Boston, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chakraborty, S., Erlebach, T., and Thiele, L. 2001. On the complexity of scheduling conditional real-time code. In Proceedings of the International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 2125. Springer, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Chakraborty, S., Erlebach, T., Künzli, S., and Thiele, L. 2002. Schedulability of event-driven code blocks in real-time embedded systems. In Proceedings of the Design Automation Conference, New Orleans, LA. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Chakraborty, S., Künzli, S., and Thiele, L. 2002. Approximate schedulability analysis. In Proceedings of the IEEE Real-Time Systems Symposium. Austin, TX. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Esser, R. and Janneck, J. W. 2001. MOSES---A tool suite for visual modeling of discrete-event systems. In IEEE International Symposium on Human-Centric Computing Languages and Environments. IEEE Computer Society, Stresa, Italy. http://www.tik.ee.ethz.ch/~moses/. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Fisher, N. and Baruah, S. 2005. A polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In Proceedings of the Euromicro Conference on Real-Time Systems, Porto, Portugal. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Hamann, A., Jersak, M., Richter, K., and Ernst, R. 2004. Design space exploration and system optimization with SymTA/S---symbolic timing analysis for systems. In IEEE Real-Time Systems Symposium, Lisbon, Portugal. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Mok, A. and Chen, D. 1997. A multiframe model for real-time tasks. IEEE Transactions on Software Engineering 23, 10, 635--645. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Takada, H. and Sakamura, K. 1997. Schedulability of generalized multiframe task sets under static priority assignment. In Proceedings of the International Workshop on Real-Time Computing Systems and Applications. Taipei, Taiwan. IEEE Computer Society, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Tokuda, H. and Kotera, M. 1988. Scheduler 1-2-3: An interactive schedulability analyzer for real-time systems. In Proceedings the IEEE International Computer Software and Applications Conference, Chicago, IL. IEEE Computer Society, Los Alamitos, CA.Google ScholarGoogle Scholar

Index Terms

  1. Interactive schedulability analysis

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!