Efficient data generation for the testing of real-time multiprocessor scheduling algorithms

• Autorzy: Shehzad M. N , Déplanche A. M , Trinquet Y , Farooq U

Warianty tytułu

PL

Efektywny proces generacji danych w multiprocesorze czasu rzeczywistego

• Języki publikacji: EN

Abstrakty

EN

In conducting the performance evaluation tests of real-time multiprocessor scheduling algorithms, synthetic input data is mandatory for obtaining reliable results and to draw strong conclusions. The results of the statistical evaluation highly depend on the data chosen for the experimentation. The data generation process is required to be efficient while the resultant data should comply with the user requirements. This article discusses two established data generation techniques used in the literature, explains their advantages and disadvantages, and finally proposes few extensions in one of the techniques, which is considered quite efficient, to be made compatible with discrete time simulator.

PL

W artykule przedyskutowano dwie techniki generacji danych w multiprocesorze czasu rzeczywistego. Zaproponowano modyfikacje algorytmu Stafforda.

Słowa kluczowe

EN

simulation data; multiprocessor; performance evaluation

PL

kolejkowanie; algorytm Stafforda; multiprocesor

• Wydawca: Wydawnictwo SIGMA-NOT
• Czasopismo: Przegląd Elektrotechniczny
• Rocznik: 2014
• Tom: R. 90, nr 9
• Strony: 136--139
• Opis fizyczny: Bibliogr. 9 poz., rys., tab., wykr.

Twórcy

autor

Shehzad M. N

• CIIT Lahore, Pakistan

autor

Déplanche A. M

• LUNAM Université, Université de Nantes, IRCCyN UMR CNRS, 6597, Nantes, France

autor

Trinquet Y

• LUNAM Université, Université de Nantes, IRCCyN UMR CNRS, 6597, Nantes, France

autor

Farooq U

• CIIT Lahore, Pakistan

Bibliografia

• [1] M. Bertogna, M. Cirinei, Response-time analysis for globally scheduled symmetric multiprocessor platforms, In the Proceedings of the 28th IEEE International Real-Time Systems Symposium (2007) pp. 149–160.
• [2] Z. Handzel, Implementing the rate monotonic scheduling algorithm for heterogeneous processors, Przeglad Elektrotechniczny (2012) pp.143–145.
• [3] R. I. Davis, A. Burns, Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems, In the Proceedings of the 30th IEEE Real-Time Systems Symposium RTSS 2009 (December 2009) pp. 398–409.
• [4] R. Stafford, Random vectors with fixed sum., http://www.mathworks.com/matlabcentral/fileexchange/9700.
• [5] P. Emberson, R. Stafford, R. I. Davis, Techniques for the synthesis of multiprocessor tasksets, 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS) (2010) pp. 6–11.
• [6] E. Bini, G. Buttazzo, Measuring the performance of schedulability tests, Real-Time Systems 30 (May 2005) pp. 129–154.
• [7] J. P. Lehoczky, L. Sha, Y. Ding, The rate monotonic scheduling algorithm: Exact characterization and average case behavior, in: RTSS, 1989, pp. 166–171.
• [8] M. Bertogna, Real-time scheduling for multiprocessor platforms, Ph.D. thesis, PhD. dissertation, Scuola Superiore SantAnna (Pisa 2007).
• [9] M. Bertogna, M. Cirinei, G. Lipari, Schedulability analysis of global scheduling algorithms on multiprocessor platforms, IEEE Trans. Parallel Distrib. Syst. 20 (4) (2009) pp. 553–566.