A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets

Walid Karamti, Adel Mahfoudhi, Yessine Hadj Kacem, Mohamed Abid

2012

Abstract

In order to examine whether the timing constraints of a Real-Time application are met, we propose an extension of Time Petri Nets model that takes into account the scheduling of a set of tasks distributed over a multiprocessor architecture. This paper is concerned with dynamic Priority-driven scheduling, whose policy is known to be supported by a new formalism called dynamic Priority Time Petri Nets (dPTPN). Its ultimate objective is to show how to deal with the Least Laxity First Scheduling policy with a set of periodic independent tasks. Besides, the use of dynamic priorities gives a determinism aspect to the model in which a crossing of concurrent transitions exists. Therefore, the execution of the model is accelerated and the number of accessible states is decreased.

References

  1. Antti, V. (1989). Stubborn sets for reduced state space generation. In Applications and Theory of Petri Nets, pages 491-515.
  2. Antti, V. (1989). Stubborn sets for reduced state space generation. In Applications and Theory of Petri Nets, pages 491-515.
  3. Berthomieu, B. and Diaz, M. (1991). Modeling and verification of time dependent systems using time petri nets. IEEE Trans. Softw. Eng., 17(3):259-273.
  4. Berthomieu, B. and Diaz, M. (1991). Modeling and verification of time dependent systems using time petri nets. IEEE Trans. Softw. Eng., 17(3):259-273.
  5. Berthomieu, B., Peres, F., and Vernadat, F. (2006). Bridging the gap between timed automata and bounded time petri nets. In FORMATS, pages 82-97.
  6. Berthomieu, B., Peres, F., and Vernadat, F. (2006). Bridging the gap between timed automata and bounded time petri nets. In FORMATS, pages 82-97.
  7. Buy, U. and Sloan, R. (1994). Analysis of real-time programs with simple time petri nets. In ISSTA 7894: Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, pages 228-239, New York, NY, USA. ACM.
  8. Buy, U. and Sloan, R. (1994). Analysis of real-time programs with simple time petri nets. In ISSTA 7894: Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis, pages 228-239, New York, NY, USA. ACM.
  9. Kacem, Y. H., Karamti, W., Mahfoudhi, A., and Abid, M. (2010). A petri net extension for schedulability analysis of real time embedded systems. In PDPTA, pages 304-314.
  10. Kacem, Y. H., Karamti, W., Mahfoudhi, A., and Abid, M. (2010). A petri net extension for schedulability analysis of real time embedded systems. In PDPTA, pages 304-314.
  11. Kimmo, V. (1994). On combining the stubborn set method with the sleep set method. In Valette, R., editor, Application and Theory of Petri Nets 1994: 15th International Conference, Zaragoza, Spain, June 20-24, 1994, Proceedings, volume 815 of Lecture Notes in Computer Science, pages 548-567. Springer-Verlag, Berlin, Germany. Springer-Verlag Berlin Heidelberg 1994.
  12. Kimmo, V. (1994). On combining the stubborn set method with the sleep set method. In Valette, R., editor, Application and Theory of Petri Nets 1994: 15th International Conference, Zaragoza, Spain, June 20-24, 1994, Proceedings, volume 815 of Lecture Notes in Computer Science, pages 548-567. Springer-Verlag, Berlin, Germany. Springer-Verlag Berlin Heidelberg 1994.
  13. Kwang, S. H. and Leung, J.-T. (1988). On-line scheduling of real-time tasks. In IEEE Real-Time Systems Symposium, pages 244-250.
  14. Kwang, S. H. and Leung, J.-T. (1988). On-line scheduling of real-time tasks. In IEEE Real-Time Systems Symposium, pages 244-250.
  15. Lime, D. and Roux, O. (2004). A translation based method for the timed analysis of scheduling extended time petri nets. In RTSS 7804: Proceedings of the 25th IEEE International Real-Time Systems Symposium, pages 187-196, Washington, DC, USA. IEEE Computer Society.
  16. Lime, D. and Roux, O. (2004). A translation based method for the timed analysis of scheduling extended time petri nets. In RTSS 7804: Proceedings of the 25th IEEE International Real-Time Systems Symposium, pages 187-196, Washington, DC, USA. IEEE Computer Society.
  17. Lime, D. and Roux, O. H. (2009). Formal verification of real-time systems with preemptive scheduling. RealTime Syst., 41(2):118-151.
  18. Lime, D. and Roux, O. H. (2009). Formal verification of real-time systems with preemptive scheduling. RealTime Syst., 41(2):118-151.
  19. Liu, C. L. and Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20:46-61.
  20. Liu, C. L. and Layland, J. W. (1973). Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20:46-61.
  21. Mahfoudhi, A., Hadj Kacem, Y., Karamti, W., and Abid, M. (2011). Compositional specification of real time embedded systems by priority time petri nets. The Journal of Supercomputing, pages 1-26. doi 10.1007/s11227-011-0557-9.
  22. Mahfoudhi, A., Hadj Kacem, Y., Karamti, W., and Abid, M. (2011). Compositional specification of real time embedded systems by priority time petri nets. The Journal of Supercomputing, pages 1-26. doi 10.1007/s11227-011-0557-9.
  23. Merlin, P. M. (1974). A Study of the Recoverability of Computing Systems. Irvine: Univ. California, PhD Thesis. available from Ann Arbor: Univ Microfilms, No. 75- 11026.
  24. Merlin, P. M. (1974). A Study of the Recoverability of Computing Systems. Irvine: Univ. California, PhD Thesis. available from Ann Arbor: Univ Microfilms, No. 75- 11026.
  25. Petri, C. A. (1962). Fundamentals of a theory of asynchronous information flow. In IFIP Congress, pages 386-390.
  26. Petri, C. A. (1962). Fundamentals of a theory of asynchronous information flow. In IFIP Congress, pages 386-390.
  27. Roux, O. H. and Déplanche, A. M. (2002). A t-time Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA), 36(7):973- 987.
  28. Roux, O. H. and Déplanche, A. M. (2002). A t-time Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA), 36(7):973- 987.
  29. Sha, L., Abdelzaher, T., Arzén, K. E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., and Mok, K. A. (2004). Real time scheduling theory: A historical perspective. Real-Time Systems, 28:101- 155. 10.1023/B:TIME.0000045315.61234.1e.
  30. Sha, L., Abdelzaher, T., Arzén, K. E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., and Mok, K. A. (2004). Real time scheduling theory: A historical perspective. Real-Time Systems, 28:101- 155. 10.1023/B:TIME.0000045315.61234.1e.
Download


Paper Citation


in Harvard Style

Karamti W., Mahfoudhi A., Hadj Kacem Y. and Abid M. (2012). A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets . In Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS, ISBN 978-989-8565-00-6, pages 317-326. DOI: 10.5220/0003809103170326


in Harvard Style

Karamti W., Mahfoudhi A., Hadj Kacem Y. and Abid M. (2012). A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets . In Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS, ISBN 978-989-8565-00-6, pages 317-326. DOI: 10.5220/0003809103170326


in Bibtex Style

@conference{peccs12,
author={Walid Karamti and Adel Mahfoudhi and Yessine Hadj Kacem and Mohamed Abid},
title={A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets},
booktitle={Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS,},
year={2012},
pages={317-326},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003809103170326},
isbn={978-989-8565-00-6},
}


in Bibtex Style

@conference{peccs12,
author={Walid Karamti and Adel Mahfoudhi and Yessine Hadj Kacem and Mohamed Abid},
title={A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets},
booktitle={Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS,},
year={2012},
pages={317-326},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003809103170326},
isbn={978-989-8565-00-6},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS,
TI - A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets
SN - 978-989-8565-00-6
AU - Karamti W.
AU - Mahfoudhi A.
AU - Hadj Kacem Y.
AU - Abid M.
PY - 2012
SP - 317
EP - 326
DO - 10.5220/0003809103170326


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Pervasive Embedded Computing and Communication Systems - Volume 1: PECCS,
TI - A FORMAL METHOD FOR SCHEDULING ANALYSIS OF A PARTITIONED MULTIPROCESSOR SYSTEM - Dynamic Priority Time Petri Nets
SN - 978-989-8565-00-6
AU - Karamti W.
AU - Mahfoudhi A.
AU - Hadj Kacem Y.
AU - Abid M.
PY - 2012
SP - 317
EP - 326
DO - 10.5220/0003809103170326