Skip to main content
SpringerLink
Log in

An improved formalization analysis approach to determine schedulability of global multiprocessor scheduling based on symbolic safety analysis and statistical model checking in smartphone systems

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Modern smart phones are typically equipped with multicore processors. In this paper, we address the problem of determining schedulability of a real-time periodic taskset with fixed release offsets and possible release jitters on a multicore processor with global Fixed-Priority (FP) or EDF (Earliest Deadline First) scheduling algorithms, using the model-checker UPPAAL for Timed Automata. In addition to yes/no schedulability analysis for hard real-time systems, we also apply statistical model checking to estimate the probability of unschedulability for soft real-time systems, described with two statistical parameters (confidence and accuracy).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Davis, R.I., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43(4), 35 (2011)

    Google Scholar 

  2. Tindell, K.: Adding time-offsets to schedulability analysis. Technical report, University of York (1994)

  3. Yomsi, P.M., Bertrand, D., Navet, N., Davis, R.L.: Controller area network (CAN): response time analysis with offsets. In: WFCS, pp. 43–52 (2012)

  4. Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Wang, Y.: Times: a tool for schedulability analysis and code generation of real-time systems. In: Larsen, K.G., Niebert, P. (eds.) FORMATS. Lecture Notes in Computer Science, vol. 2791, pp. 60–72. Springer (2003)

  5. Fersman, E., Mokrushin, L., Petersson, P., Wang, Y.: Schedulability analysis of fixed-priority systems using timed automata. Theor. Comput. Sci. 354(2), 301–317

  6. Waszniowski, L., Hanzalek, Z.: Formal verification of multitasking applications based on timed automata model. Real-Time Syst. 38(1), 39–65 (2008)

    Google Scholar 

  7. UPPAAL HELP. http://www.uppaal.org/ (2016)

  8. Cicirelli, F., Furfaro, A., Nigro, L., Pupo, F.: Development of a schedulability analysis framework based on ptpn and uppaal with stopwatches. In: Boukerche, A., Cahill, V., El-Saddik, A., Theodoropoulos, G.K., Walshe, R. (eds.) DS-RT:57-64. IEEE Computer Society (2012)

  9. Aske Wiid, B., Hansen, M.R., Madsen, J.: Models and formal verification of multiprocessor system-on-chips. J. Log. Algebraic Program. 77(1–2), 1–19 (2008)

    Google Scholar 

  10. David, A., Illum, J., Larsen, K.G., Skou, A.: Model-based framework for schedulability analysis using uppaal 4.1. In: Model-based Design for Embedded Systems, pp. 93–119 (2010)

  11. Baker, T.P., Cirinei, M.: Brute-force determination of multiprocessor schedulability for sets of sopradic hard-deadline tasks. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS, vol. 4878, pp. 62–75. Springer (2007)

  12. Cordovilla, M., Boniol, F., Noulard, E., Pagetti, C.: Multiprocessor schedulability analyser. In: Chu, W.C., Wong, E.W., Palakal, M.J., Hung, C.-C. (eds.) SAC, pp. 735–741. ACM (2011)

  13. Boudjadar, A., David, A., Kim, J.H., Kim, L.G., Mikucionis, M., Nyman, U., Skou, A.: Hierarchical scheduling framework based on compositional analysis using UPPAAL. In: Fiadeiro, J.L. (ed.) Proceedings of the Formal Aspects of Component Software, pp. 61–78. Springer (2014)

  14. David, A., Larsen, K.G., Legay, A., Mikucionis, M.: Schedulability of Herschel-Planck revisited using statistical model checking. In: Margaria, T. (ed.) Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies, pp. 293–307. Springer (2012)

  15. Oguzcan, O., Broenink, J.F., Mader, A.: Schedulability analysis of timed CSP models using the pat model checker. In: Communicating Process Architectures. Open Channel Publishing Ltd (2012)

  16. Carnevali, L., Pinzuti, A., Vicario, E.: Compositional verification for hierarchical scheduling of real-time systems. IEEE Trans. Softw. Eng. 39(5), 638–657 (2013)

    Google Scholar 

  17. Ericsson, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: Proceedings of Nordic Workshop on Programming Theory (1998)

  18. Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processed: schedulability and decidability. In: Proceedings of TACAS02. LNCS, vol. 2280, pp. 67–82 (2002)

  19. Schmitz, M.T., Al-Hashimi, B.M., Eles, P.: System-Level Design Techniques for Energy-Efficient Embedded Systems. Springer (2004). https://doi.org/10.1007/b106642

  20. Clarke, EM., Zuliani, P.: Statistical model checking for cyber-physical systems. In: Proceedings of the 9th International Conference on Automated Technology for Verification and Analysis (ATVA’11), pp. 1–12. Taipei, Taiwan, 11–14 Oct 2011

  21. David, A., Larsen, K.G., Legay, A., Mikucionis, M.: Schedulability of Herschel revisited using statistical model checking. Int. J. Softw. Tools Technol. Transf. 17(2), 187–199 (2015)

    Google Scholar 

  22. Christensen, S., Kristensen, L., Mailund, T.: A sweep-line method for state space exploration. In: TACAS, pp. 450–464 (2001)

  23. Cassez, F., Larsen, K.G.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR. Lecture Notes in Computer Science, vol. 1877, pp. 138–152 (2000)

Download references

Acknowledgements

This research is supported by NSFC Project Grants Nos. 61672240 and 61402198.

Author information

Authors and Affiliations

  1. MoE Engineering Center for Software/Hardware Co-Design Technology and Application, East China Normal University, Shanghai, 200062, China

    Haibin Cai

  2. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Hao Wu

Authors
  1. Haibin Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hao Wu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cai, H., Wu, H. An improved formalization analysis approach to determine schedulability of global multiprocessor scheduling based on symbolic safety analysis and statistical model checking in smartphone systems. Cluster Comput 22 (Suppl 2), 2543–2554 (2019). https://doi.org/10.1007/s10586-017-1319-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1319-0

Keywords

Search

Navigation