A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation

Romulo Silva de Oliveira, Andreu Carminati, Renan Starke

Abstract

Many embedded systems have real-time requirements which are sometimes hard and must be guaranteed at design time, although most embedded systems have soft deadlines in the sense that they can be missed without any catastrophe being caused by that. Scheduling simulations can be used as a necessary but not sufficient schedulability test that is useful for both hard and soft real-time systems. They help to assess the pessimism of formal analysis applied to hard real-time systems and they can be used as test-case generators during the design of soft real-time systems. In this paper, we present a new adversary simulator for multiprocessors with global task queue and fixed-priority scheduling. We consider sporadic tasks with constrained deadlines (D <= T). An adversary simulator uses the non-determinism in the arrivals of sporadic tasks to stress the system scheduler with valid arrival patterns. The simulator proposed in this paper applies a lazy approach that delays the arrival of high-priority tasks in order to form gangs that will preclude the execution of a victim task. We show that the new lazy-adversary simulator presented in this paper outperforms the previously existing necessary schedulability tests.

References

  1. Andersson, B. and Jonsson, J. (2002). Preemptive multiprocessor scheduling anomalies. In Proceedings of the 16th IEEE International Parallel and Distributed Processing Symposium, pages 12-19.
  2. Back, H., Chwa, H. S., and Shin, I. (2012). Schedulability analysis and priority assignment for global job-level fixed-priority multiprocessor scheduling. In Real-Time and Embedded Technology and Applications Symposium (RTAS), 2012 IEEE 18th, pages 297 -306.
  3. Baker, T. P. and Cirinei, M. (2006). A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In Real-Time Systems Symposium, 2006. RTSS 7806. 27th IEEE International, pages 178 -190.
  4. Baker, T. P. and Cirinei, M. (2007). Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In Proceedings of the 11th International Conference on Principles of Distributed Systems, pages 62-75. Springer-Verlag.
  5. Baruah, S. and Fisher, N. (2005). The partitioned multiprocessor scheduling of sporadic task systems. In RealTime Systems Symposium, 2005. RTSS 2005. 26th IEEE International, pages 9 pp.-329.
  6. Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., and Wang, F. (1991). On the competitiveness of on-line real-time task scheduling. In Proceedings of the IEEE Real-Time Systems Symposium, pages 106-115.
  7. Bertogna, M. and Baruah, S. (2011). Tests for global edf schedulability analysis. J. Syst. Archit., 57(5):487- 497.
  8. Bertogna, M., Cirinei, M., and Lipari, G. (2009). Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Transactions on Parallel and Distributed Systems, 20(4):553-566.
  9. Bini, E. and Buttazzo, G. C. (2005). Measuring the performance of schedulability tests. Real-Time Systems, 30:129-154.
  10. Burns, A., Davis, R., Wang, P., and Zhang, F. (2012). Partitioned edf scheduling for multiprocessors using a c=d task splitting scheme. Real-Time Systems, 48:3-33.
  11. Cirinei, M. and Baker, T. (2007). Edzl scheduling analysis. In Real-Time Systems, 2007. ECRTS 7807. 19th Euromicro Conference on, pages 9 -18.
  12. Davis, R. I. and Burns, A. (2009). Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In Proceedings of the 30th IEEE Real-Time Systems Symposium, pages 398- 409.
  13. Davis, R. I. and Burns, A. (2011). Fpzl schedulability analysis. In Proceedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 245-256.
  14. de Oliveira, R. S., Carminati, A., and Starke, R. A. (2012). On using adversary simulators to obtain tight lower bounds for response times. In Proceedings of the 27th Annual ACM Symposium on Applied Computing, pages 1573-1579.
  15. de Oliveira, R. S., Carminati, A., and Starke, R. A. (2013). On using adversary simulators to evaluate global fixed-priority and fpzl scheduling of multiprocessors. Journal of Systems and Software, 86(2):403 - 411.
  16. Fisher, N., Baker, T., and Baruah, S. (2006). Algorithms for determining the demand-based load of a sporadic task system. In Embedded and Real-Time Computing Systems and Applications, 2006. Proceedings. 12th IEEE International Conference on, pages 135-146.
  17. G. Thaker, P. Lardieri, D. K. and Price, M. (2004). Empirical quantification of pessimism in state-of-the-art scheduling theory techniques for periodic and sporadic dre tasks. In Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 490-499.
  18. Lee, J., Easwaran, A., Shin, I., and Lee, I. (2011). Zerolaxity based real-time multiprocessor scheduling. J. Syst. Softw., 84(12):2324-2333.
  19. Reeves, C. R., editor (1993). Modern heuristic techniques for combinatorial problems. John Wiley & Sons, Inc., New York, NY, USA.
  20. Samii, S., Rafiliu, S., Eles, P., and Peng, Z. (2008). A simulation methodology for worst-case response time estimation of distributed real-time systems. In Proceedings of Design, Automation and Test in Europe, pages 556-561.
Download


Paper Citation


in Harvard Style

Silva de Oliveira R., Carminati A. and Starke R. (2014). A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation . In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, ISBN 978-989-758-038-3, pages 321-329. DOI: 10.5220/0005008903210329


in Bibtex Style

@conference{simultech14,
author={Romulo Silva de Oliveira and Andreu Carminati and Renan Starke},
title={A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation},
booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,},
year={2014},
pages={321-329},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005008903210329},
isbn={978-989-758-038-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,
TI - A Necessary Test for Fixed-Priority Real-Time Multiprocessor Systems based on Lazy-adversary Simulation
SN - 978-989-758-038-3
AU - Silva de Oliveira R.
AU - Carminati A.
AU - Starke R.
PY - 2014
SP - 321
EP - 329
DO - 10.5220/0005008903210329