skip to main content
research-article

Scheduling in Real-Time Mobile Systems

Authors Info & Claims
Published:28 May 2022Publication History
Skip Abstract Section

Abstract

To guarantee the safety and security of a real-time mobile system such as an intelligent transportation system, it is necessary to model and analyze its behaviors prior to actual development. In particular, the mobile objects in such systems must be isolated from each other so that they do not collide with each other. Since isolation means two or more mobile objects must not be located in the same place at the same time, a scheduling policy is required to control and coordinate the movement of such objects. However, traditional scheduling theories are based on task scheduling which is coarse-grained and cannot be directly used for fine-grained isolation controls. In this article, we first propose a fine-grained event-based formal model called a time dependency structure and use it to model and analyze real-time mobile systems. Next, an event-based schedule is defined and the composition of schedules is discussed. Then, we investigate the schedulability of isolation—that is, checking whether a given schedule ensures the isolation relationship among mobile objects or not. After that, we present an automation approach for scheduling generation to guarantee isolation controls in real-time mobile systems. Finally, case studies and simulation experiments demonstrate the usability and effectiveness of our approach.

REFERENCES

  1. [1] Abedinnia Hamid, Glock Christoph H., Grosse Eric H., and Schneider Michael. 2017. Machine scheduling problems in production: A tertiary study. Computers & Industrial Engineering 111 (2017), 403416. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Ahn Heejin and Vecchio Domitilla Del. 2016. Semi-autonomous intersection collision avoidance through job-shop scheduling. In Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, Abate Alessandro and Fainekos Georgios (Eds.). 185194. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Altisen Karine, Gößler Gregor, and Sifakis Joseph. 2002. Scheduler modeling based on the controller synthesis paradigm. Real-Time Systems 23, 1–2 (2002), 5584. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Anderson James H., Bud Vasile, and Devi UmaMaheswari C.. 2008. An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems. Real-Time Systems 38, 2 (2008), 85131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Asperti Andrea and Busi Nadia. 2009. Mobile Petri nets. Mathematical Structures in Computer Science 19, 6 (2009), 12651278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Audsley N. C., Burns A., and Wellings A. J.. 1993. Deadline monotonic scheduling theory and application. Control Engineering Practice 1, 1 (1993), 7178. Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Bambagini Mario, Marinoni Mauro, Aydin Hakan, and Buttazzo Giorgio C.. 2016. Energy-aware scheduling for real-time systems: A survey. ACM Transactions on Embedded Computing Systems 15, 1 (2016), 7:1–7:34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Bengtsson Johan and Yi Wang. 2003. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets, Advances in Petri Nets, Lecture Notes in Computer Science, Vol. 3098, Desel Jörg, Reisig Wolfgang, and Rozenberg Grzegorz (Eds.). Springer, 87124. Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] Berthomieu Bernard and Diaz Michel. 1991. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering 17, 3 (1991), 259273. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] Biondi Alessandro and Buttazzo Giorgio C.. 2018. Modeling and analysis of engine control tasks under dynamic priority scheduling. IEEE Transactions on Industrial Informatics 14, 10 (2018), 44074416. Google ScholarGoogle ScholarCross RefCross Ref
  11. [11] Boucheneb Hanifa, Gardey Guillaume, and Roux Olivier H.. 2009. TCTL model checking of time Petri nets. Journal of Logic and Computation 19, 6 (2009), 15091540. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. [12] Briscoe Bob, Brunstrom Anna, Petlund Andreas, Hayes David A., Ros David, Tsang Ing-Jyh, Gjessing Stein, Fairhurst Gorry, Griwodz Carsten, and Welzl Michael. 2016. Reducing internet latency: A survey of techniques and their merits. IEEE Communications Surveys and Tutorials 18, 3 (2016), 21492196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. [13] Bucci Giacomo and Vicario Enrico. 1995. Compositional validation of time-critical systems using communicating time Petri nets. IEEE Transactions on Software Engineering 21, 12 (1995), 969992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Cardelli Luca and Gordon Andrew D.. 1998. Mobile ambients. In Proceedings of the 1st International Conference on Foundations of Software Science and Computation Structure (FoSSaCS’98), Held as Part of the European Joint Conferences on the Theory and Practice of Software (ETAPS’98),Lecture Notes in Computer Science, Vol. 1378, Nivat Maurice (Ed.). Springer, 140155. Google ScholarGoogle ScholarCross RefCross Ref
  15. [15] Colombo Alessandro and Vecchio Domitilla Del. 2012. Efficient algorithms for collision avoidance at intersections. In Proceedings of the 15th ACM International Conference on Hybrid Systems: Computation and Control. 145154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Colombo Alessandro and Vecchio Domitilla Del. 2014. Least restrictive supervisors for intersection collision avoidance: A scheduling approach. IEEE Transactions on Automatic Control 60, 6 (2014), 15151527. Google ScholarGoogle ScholarCross RefCross Ref
  17. [17] Campos Gabriel Rodrigues de, Falcone Paolo, and Sjöberg Jonas. 2013. Autonomous cooperative driving: A velocity-based negotiation approach for intersection crossing. In Proceedings of the16th International IEEE Conference on Intelligent Transportation Systems (ITSC’13). IEEE, 14561461. Google ScholarGoogle ScholarCross RefCross Ref
  18. [18] Bergh Jorne Van den, Beliën Jeroen, Bruecker Philippe De, Demeulemeester Erik, and Boeck Liesje De. 2013. Personnel scheduling: A literature review. European Journal of Operational Research 226, 3 (2013), 367385. Google ScholarGoogle ScholarCross RefCross Ref
  19. [19] Dresner Kurt M. and Stone Peter. 2008. A multiagent approach to autonomous intersection management. Journal of Artificial Intelligence Research 31 (2008), 591656. Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Du Yuyue, Jiang Changjun, and Zhou MengChu. 2007. Modeling and analysis of real-time cooperative systems using Petri nets. IEEE Transactions on Systems, Man, and Cybernetics - Part A 37, 5 (2007), 643654. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. [21] Group CPS Steering et al. 2008. Cyber-physical systems executive summary. CPS Summit 2008.Google ScholarGoogle Scholar
  22. [22] Gruska Damas P.. 2009. Quantifying security for timed process algebras. Fundamenta Informaticae 93, 1–3 (2009), 155169. Google ScholarGoogle ScholarCross RefCross Ref
  23. [23] Guan Xudong, Yang Yiling, and You Jinyuan. 2000. Making ambients more robust. In Proceedings of the International Conference on Software: Theory and Practice. Citeseer, 377384.Google ScholarGoogle Scholar
  24. [24] Hafner Michael R., Cunningham Drew, Caminiti Lorenzo, and Vecchio Domitilla Del. 2013. Cooperative collision avoidance at intersections: Algorithms and experiments. IEEE Transactions on Intelligent Transportation Systems 14, 3 (2013), 11621175. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [25] Jahanian Farnam and Mok Aloysius K.. 1986. Safety analysis of timing properties in real-time systems. IEEE Transactions on Software Engineering 12, 9 (1986), 890904. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Jiang Jianmin, Zhang Shi, Gong Ping, and Hong Zhong. 2013. Configuring business process models. ACM SIGSOFT Software Engineering Notes 38, 4 (July 2013), 110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Jiang Jianmin, Zhu Huibiao, Li Qin, Zhang Shi, Gong Ping, and Hong Zhong. 2014. Configuration of services based on virtualization. In 2014 Theoretical Aspects of Software Engineering Conference (TASE’14). IEEE Computer Society, 177184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [28] Jiang Jianmin, Zhu Huibiao, Li Qin, Zhao Yongxin, Zhao Lin, Zhang Shi, Gong Ping, and Hong Zhong. 2015. Analyzing event-based scheduling in concurrent reactive systems. ACM Transactions on Embedded Computing Systems 14, 4 (2015), 86:1–86:27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. [29] Jiang Jianmin, Zhu Huibiao, Li Qin, Zhao Yongxin, Zhao Lin, Zhang Shi, Gong Ping, Hong Zhong, and Chen Donghuo. 2017. Event-based mobility modeling and analysis. ACM Transactions on Cyber-Physical Systems 1, 2 (2017), 9:1–9:32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. [30] Jiang Zengqiang, Jin Yang, Mingcheng E., and Li Qi. 2018. Distributed dynamic scheduling for cyber-physical production systems based on a multi-agent system. IEEE Access 6 (2018), 18551869. Google ScholarGoogle ScholarCross RefCross Ref
  31. [31] Juan Eric Y. T., Tsai Jeffrey J. P., and Murata Tadao. 1998. Compositional verification of concurrent systems using Petri-net-based condensation rules. ACM Transactions on Programming Languages and Systems 20, 5 (1998), 917979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. [32] Kim Junsung, Kim Hyoseung, Lakshmanan Karthik, and Rajkumar Ragunathan. 2013. Parallel scheduling for cyber-physical systems: Analysis and case study on a self-driving car. In Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems (with CPS Week 2013) (ICCPS’13), Lu Chenyang, Kumar P. R., and Stoleru Radu (Eds.). ACM, 3140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [33] Kim Kyoung-Dae and Kumar P. R.. 2012. Cyber-physical systems: A perspective at the centennial. Proceedings of the IEEE 100, 1 (May 2012), 12871308. Google ScholarGoogle ScholarCross RefCross Ref
  34. [34] Lampka Kai, Perathoner Simon, and Thiele Lothar. 2010. Analytic real-time analysis and timed automata: A hybrid methodology for the performance analysis of embedded real-time systems. Design Automation for Embedded Systems 14, 3 (2010), 193227. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. [35] Lee Jinkyu and Shin Kang G.. 2017. Development and use of a new task model for cyber-physical systems: A real-time scheduling perspective. Journal of Systems and Software 126 (2017), 4556. Google ScholarGoogle ScholarCross RefCross Ref
  36. [36] Levi Francesca and Sangiorgi Davide. 2003. Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25, 1 (2003), 169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. [37] Leyman Pieter and Vanhoucke Mario. 2015. A new scheduling technique for the resource constrained project scheduling problem with discounted cash flows. International Journal of Production Research 53, 9 (2015), 27712786. Google ScholarGoogle ScholarCross RefCross Ref
  38. [38] Li Qiao. 2012. Scheduling in Cyber-Physical Systems. Dissertation. Carnegie Mellon University. http://repository.cmu.edu/dissertations/91.Google ScholarGoogle Scholar
  39. [39] Li Qiao and Negi R.. 2012. Maximal scheduling in wireless ad hoc networks with hypergraph interference models. IEEE Transactions on Vehicular Technology 61, 1 (Nov. 2012), 297310. Google ScholarGoogle ScholarCross RefCross Ref
  40. [40] Liu Chung Laung and Layland James W.. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20, 1 (Nov. 1973), 4661. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. [41] Liu Kai, Lee Victor C. S., Ng Joseph Kee-Yin, Son Sang Hyuk, and Sha Edwin Hsing-Mean. 2014. Scheduling temporal data with dynamic snapshot consistency requirement in vehicular cyber-physical systems. ACM Transactions on Embedded Computing Systems 13, 5s (2014), 163:1–163:21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. [42] Luckham David C., Vera James, Bryan Doug, Augustin Larry, Belz Frank, and Augustin Larry M.. 1993. Partial orderings of event sets and their application to prototyping concurrent, timed systems. Journal of Systems and Software 21, 3 (June 1993), 253265. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. [43] Martini Daniele De, Benetti Guido, Vedova Marco L. Della, and Facchinetti Tullio. 2017. Adaptive real-time scheduling of cyber-physical energy systems. ACM Transactions on Cyber-Physical Systems 1, 4 (2017), 20:1–20:25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. [44] Merro Massimo and Hennessy Matthew. 2002. Bisimulation congruences in safe ambients. In Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Launchbury John and Mitchell John C. (Eds.). ACM, 7180. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. [45] Milner Robin. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92. Springer. Google ScholarGoogle ScholarCross RefCross Ref
  46. [46] Milner Robin, Parrow Joachim, and Walker David. 1992. A calculus of mobile processes, I. Information and Computtation 100, 1 (1992), 140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. [47] Murata Tadao. 1989. Petri nets: Properties, analysis, and applications. Proceedings of the IEEE 77, 4 (April 1989), 541580. Google ScholarGoogle ScholarCross RefCross Ref
  48. [48] Padmajothi V. and Iqbal J. L. Mazher. 2020. Adaptive neural fuzzy inference system-based scheduler for cyber-physical system. Soft Computing 24, 22 (2020), 1730917318. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. [49] Pattanayak Prabina and Kumar Preetam. 2017. Quantized feedback scheduling for MIMO-OFDM broadcast networks with subcarrier clustering. Ad Hoc Networks 65 (2017), 2637. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. [50] Riise Atle, Mannino Carlo, and Burke Edmund K.. 2016. Modelling and solving generalised operational surgery scheduling problems. Computers & Operations Research 66 (2016), 111. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. [51] Schneider Reinhard, Goswami Dip, Masrur Alejandro, Becker Martin, and Chakraborty Samarjit. 2013. Multi-layered scheduling of mixed-criticality cyber-physical systems. Journal of Systems Architecture 59, 10-D (2013), 12151230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. [52] Stankovic John A., Spuri Marco, Ramamritham Krithi, and Giorgio C.. 1999. Deadline scheduling for real-time systems: EDF and related algorithms. Computers & Mathematics with Applications 38, 11 (1999), 288. Google ScholarGoogle ScholarCross RefCross Ref
  53. [53] Tachet Remi, Santi Paolo, Sobolevsky Stanislav, Reyes-Castro Luis Ignacio, Frazzoli Emilio, Helbing Dirk, and Ratti Carlo. 2016. Revisiting street intersections using slot-based systems. PloS One 11, 3 (2016), e0149607. Google ScholarGoogle ScholarCross RefCross Ref
  54. [54] Tang Qinghui, Gupta Sandeep K. S., and Varsamopoulos Georgios. 2012. A unified methodology for scheduling in distributed cyber-physical systems. ACM Transactions on Embedded Computing Systems 11, S2 (2012), 57:1–57:25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. [55] Teller David, Zimmer Pascal, and Hirschkoff Daniel. 2002. Using ambients to control resources. In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR’02). Lecture Notes in Computer Science, Vol. 2421, Brim Lubos, Jancar Petr, Kretínský Mojmír, and Kucera Antonín (Eds.). Springer, 288303. Google ScholarGoogle ScholarCross RefCross Ref
  56. [56] Tsai Jeffrey J. P., Yang Steve Jennhwa, and Chang Yao-Hsiung. 1995. Timing constraint Petri nets and their application to schedulability analysis of real-time system specifications. IEEE Transactions on Software Engineering 21, 1 (1995), 3249. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. [57] Glabbeek Rob J. van and Plotkin Gordon D.. 1995. Configuration structures. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 199209. Google ScholarGoogle ScholarCross RefCross Ref
  58. [58] Glabbeek Rob J. van and Plotkin Gordon D.. 2009. Configuration structures, event structures and Petri nets. Theoretical Computer Science 410, 41 (Sept. 2009), 41114159.Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. [59] Wang Haifeng, Schmid Felix, Chen Lei, Roberts Clive, and Xu Tianhua. 2013. A topology-based model for railway train control systems. IEEE Transactions on Intelligent Transportation Systems 14, 2 (June 2013), 819827. Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. [60] Wang Jiacun, Deng Yi, and Xu Gang. 2000. Reachability analysis of real-time systems using time Petri nets. IEEE Transactions on Systems, Man, and Cybernetics - Part B 30, 5 (2000), 725736. Google ScholarGoogle ScholarDigital LibraryDigital Library
  61. [61] Wang Tianyi, Homsi Soamar, Niu Linwei, Ren Shaolei, Bai Ou, Quan Gang, and Qiu Meikang. 2017. Harmonicity-aware task partitioning for fixed priority scheduling of probabilistic real-time tasks on multi-core platforms. ACM Transactions on Embedded Computing Systems 16, 4 (2017), 101:1–101:21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  62. [62] Winskel Glynn and Nielsen Mogens. 1995. Models for Concurrency. Oxford Science Publications, Oxford.Google ScholarGoogle Scholar
  63. [63] Xu Dianxiangal. et2002. Compositional schedulability analysis of real-time systems using time Petri nets. IEEE Transactions on Software Engineering 28, 10 (Oct. 2002), 984996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. [64] Xu Dianxiang, Yin Jianwen, Deng Yi, and Ding Junhua. 2003. A formal architectural model for logical agent mobility. IEEE Tranactions on Software Engineering 29, 1 (2003), 3145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  65. [65] Yang Jixiang and He Qingbi. 2018. Scheduling parallel computations by work stealing: A survey. International Journal of Parallel Programming 46, 2 (2018), 173197. Google ScholarGoogle ScholarDigital LibraryDigital Library
  66. [66] Yi Na, Xu Jianjun, Yan Limei, and Huang Lin. 2020. Task optimization and scheduling of distributed cyber-physical system based on improved ant colony algorithm. Future Generation Computer Systems 109 (2020), 134148. Google ScholarGoogle ScholarCross RefCross Ref
  67. [67] Yi Wang. 1991. CCS + Time = An interleaving model for real time systems. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, (ICALP’91). Lecture Notes in Computer Science, Vol. 510, Albert Javier Leach, Monien Burkhard, and Rodríguez-Artalejo Mario (Eds.). Springer, 217228. Google ScholarGoogle ScholarCross RefCross Ref
  68. [68] Zhang Fumin, Szwaykowska Klementyna, Wolf Wayne H., and III Vincent John Mooney. 2008. Task scheduling for control oriented requirements for cyber-physical systems. In Proceedings of the 29th IEEE Real-Time Systems Symposium (RTSS’08). IEEE Computer Society, 4756. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Scheduling in Real-Time Mobile Systems

          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

          • Published in

            cover image ACM Transactions on Embedded Computing Systems
            ACM Transactions on Embedded Computing Systems  Volume 21, Issue 3
            May 2022
            365 pages
            ISSN:1539-9087
            EISSN:1558-3465
            DOI:10.1145/3530307
            • Editor:
            • Tulika Mitra
            Issue’s Table of Contents

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 28 May 2022
            • Accepted: 1 February 2022
            • Revised: 1 December 2021
            • Received: 1 May 2021
            Published in tecs Volume 21, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          Full Text

          View this article in Full Text.

          View Full Text

          HTML Format

          View this article in HTML Format .

          View HTML Format
          About Cookies On This Site

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

          Learn more

          Got it!