DOI: https://doi.org/10.15588/1607-3274-2017-4-13

ROUND-ROBIN PREEMPTIVE SCHEDULER MODEL IN DISTRIBUTED REAL-TIME SYSTEM

S. A. Dadenkov, D. A. Dadenkov

Abstract


Context. The problem of quantitative estimation of probabilistic and temporal characteristics of the planning node’s tasks subsystem for the design of distributed real-time systems has been solved. Round robin priority driven preemptive scheduler is the subject of research, used in distributed fieldbus-networks.

The goal is to create a model and a method of quantifying the probabilistic and temporal characteristics of the node’s task scheduling subsystem: delays and time intervals for solving problem, intensity of the information load on the industrial fieldbus-network channels.

Method. The method of probability theory has been used there to solve problems. State and transition graph of model has been offered, describing the functioning of cycle algorithm for scheduling node tasks. Analytical relations for estimating the main probabilistic and temporal characteristics of the task scheduling subsystem model have been got. Specifically, an average delay time for task processing, an average time interval between solving problems, an intensity of the information load on the fieldbus-network channels. The proposed model and method are different from well-known ones: with the detailing of the important parameters of the algorithm functioning, that weren’t previously analyzed: dissimilar levels of priorities, number of priority tasks, configuration characteristics of tasks, operation delays and frequency of events of scheduler, etc.

Results. The developed model and method of quantifying the probabilistic and temporal characteristics of tasks scheduling subsystem with round robin priority driven preemptive scheduler.

Conclusions. The conducted experiments have confirmed the proposed software operability and adequacy, allow recommending it for use in practice to solve problems of designing distributed real-time systems with specified time characteristics. During the design process tools will be used for determining: the allowable number of scheduler software modules and the distribution among them of the priority and non-priority tasks handled by the node, depending on the frequency of the technological events and the specified processing delay requirements.

Keywords


Task scheduling; real-time, round-robin; priority-driven preemptive scheduler; model; probable and time response characteristics; distributed system; industrial network; fieldbus.

References


David Neels Pon Kumar D., Jithin Raj, K. Arun Kumar, K. Murugesan An Enhanced Scheduling Scheme for QoS in Mobile WiMAX Networks, International Journal of Engineering and Innovative Technology (IJEIT), 2012, Vol. 2, No. 5, pp. 163–169.

Park W., Cho S., Bahk S. Scheduler Design for Multiple Traffic Classes in OFDMA Networks, in Proc. IEEE Int. Conf. Communications, Istanbul, Turkey, 2006, Vol. 2, pp. 790–795.

Kavalerov M. V., Matushkin N. N. Povyshenie e’ffektivnosti planirovaniya s fiksirovannymi prioritetami zadach zhestkogo real’nogo vremeni na osnove primeneniya r-algoritma dlya formirovaniya zaprosov e’tix zadach, Nejrokomp’yutery: razrabotka, primenenie, 2014, No. 12, pp. 14–19.

Kavalerov M. V., Matushkin N. N. Novyj algoritm naznacheniya parametrov zadach real’nogo vremeni s linejnymi interval’nymi ogranicheniyami v usloviyax planirovaniya s fiksirovannymi prioritetami, osnovannyj na sokrashhennom perebore prioritetov, Nejrokomp’yutery: razrabotka, primenenie, 2013, No. 11, pp. 012–017.

Embedded System Software. Module 6. Version 2. EE IIT, Kharagpur 1 Lesson 30 Real-Time T. 31437008-Realtime-Task-Scheduling-2, 128 p. Access mode: http://www.nptel.ac.in/courses/108105057/Pdf/Lesson-30.pdf

Marcus V lp., Hermann H rtig [Electronic resource], Real-Time Systems: Event-Driven Scheduling, 2003, Access mode: https://os.inf.tu-dresden.de/Studium/RTS/WS2013/05-EventDriven.pdf

Ditrix D., Loj D., Shvajncer G. Yu. LON-texnologiya, postroenie raspredelennyx prilozhenij, Per. s nem. pod red. O. B. Nizamutdinova. Perm’, Zvezda, 1999, 242 p.

LonTalk protocol specification: ANSI/CEA-709.1-B. United States, 2006.

Moshe Kam. Collision Resolution Simulation for Distributed Control Architectures using LonWorks, IEEE International Conference on Automation Science and Engineering. Edmonton, Canada, IEEE, 2005, pp. 319–326.

Mi kowicz M. Analysis of Mean Access Delay in Variable-Window CSMA, Sensors. Schweiz: Molecular Diversity Preservation International, 2007, Vol. 7, pp. 3535–3559.

Mi kowicz M. Access delay in LonTalk MAC protocol, Computer Standards & Interfaces. Nederland: Elsevier Science Publishing Company, 2009, pp. 548–556.

Mi kowicz M. Latency characteristics of event-driven task scheduler embedded in neuron chip, IJCSNS International Journal of Computer Science and Network Security, 2007, Vol. 7, No. 12, pp. 132–149.

Buchholz P., Plonnigs J. Analytical analysis of access-schemes of the CSMA type, Proc. of IEEE International Workshop on Factory Communication Systems WFCS’2004, Wien, 2004, pp. 127–136.

Dadenkov S. A., Chmykov V. V. Razrabotka imitacionnoj modeli urovnya prilozhenij uzla LonWorks seti, Materialy konferencii «Avtomatizirovannye sistemy upravleniya i informacionnye texnologii», 2014. Rezhim dostupa: http://etf.pstu.ru/conf/files/stud_conf_2014.pdf.

Dadenkov S. A., Kon E. L. Podxod k postroeniyu analiticheskoj modeli informacionno-upravlyayushhej seti LonWorks na osnove nejrochipov, Nejrokomp’yutery: razrabotka, primenenie. Moscow, Radiotexnika, 2013, No. 11, pp. 64–69.


GOST Style Citations


1. David Neels Pon Kumar D. An Enhanced Scheduling Scheme for QoS in Mobile WiMAX Networks / D. David Neels Pon Kumar, Jithin Raj, K. Arun Kumar, K. Murugesan // International Journal of Engineering and Innovative Technology (IJEIT). – 2012. – Vol. 2, № 5. – P. 163–169.

2. Park W. Scheduler Design for Multiple Traffic Classes in OFDMA Networks / W. Park, S. Cho, S. Bahk // in Proc. IEEE Int. Conf. Communications, Istanbul, Turkey. – 2006. – Vol. 2. – P. 790–795.

3. Кавалеров М. В. Повышение эффективности планирования с фиксированными приоритетами задач жесткого реального времени на основе применения r-алгоритма для формирования запросов этих задач / М. В. Кавалеров, Н. Н. Матушкин // Нейрокомпьютеры: разработка, применение. – 2014. – №12. – С. 14–19.

4. Кавалеров М. В. Новый алгоритм назначения параметров задач реального времени с линейными интервальными ограничениями в условиях планирования с фиксированными приоритетами, основанный на сокращенном переборе приоритетов / М. В. Кавалеров, Н. Н. Матушкин // Нейрокомпьютеры: разработка, применение. – 2013. – №11. – С. 012–017.

5. Embedded System Software. Module 6. Version 2. EE IIT, Kharagpur 1 Lesson 30 Real-Time T. 31437008-Realtime-Task-Scheduling-2. – 128 p. – Access mode: http://www.nptel.ac.in/courses/108105057/Pdf/Lesson-30.pdf

6. Marcus V lp. Real-Time Systems: Event-Driven Scheduling / Marcus V lp, Hermann H rtig [Electronic resource]. – 2003. – Access mode: https://os.inf.tu-dresden.de/Studium/RTS/WS2013/05-EventDriven.pdf

7. Дитрих Д. LON-технология, построение распределенных приложений / Д. Дитрих, Д. Лой, Г . Ю. Швайнцер // Пер. с нем. – под ред. О. Б. Низамутдинова. – Пермь : Звезда, 1999 – 242 с.

8. LonTalk protocol specification: ANSI/CEA-709.1-B. – United States, 2006.

9. Moshe Kam. Collision Resolution Simulation for Distributed Control Architectures using LonWorks / Moshe Kam // IEEE International Conference on Automation Science and Engineering. – Edmonton, Canada: IEEE, 2005. – P. 319–326.

10. Mi kowicz M. Analysis of Mean Access Delay in Variable-Window CSMA / M. Miњkowicz // Sensors. Schweiz: Molecular Diversity Preservation International, 2007. – Vol. 7. – P. 3535–3559.

11. Mi kowicz M. Access delay in LonTalk MAC protocol / M. Mi kowicz // Computer Standards & Interfaces. Nederland: Elsevier Science Publishing Company, 2009. – P. 548–556.

12. Mi kowicz M. Latency characteristics of event-driven task scheduler embedded in neuron chip / M. Mi kowicz // IJCSNS International Journal of Computer Science and Network Security. – 2007. – Vol. 7, № 12. – Р. 132–149.

13. Buchholz P. Analytical analysis of access-schemes of the CSMA type / P. Buchholz, J. Plonnigs // Proc. of IEEE International Workshop on Factory Communication Systems WFCS’2004, Wien, 2004. – P. 127–136.

14. Даденков С. А. Разработка имитационной модели уровня приложений узла LonWorks сети / С. А. Даденков, В. В. Чмыков // Материалы конференции «Автоматизированные системы управления и информационные технологии», 2014. – Режим доступа: http://etf.pstu.ru/conf/files/stud_conf_2014.pdf.

15. Даденков С. А. Подход к построению аналитической модели информационно-управляющей сети LonWorks на основе нейрочипов / С. А. Даденков, Е. Л. Кон // Нейрокомпьютеры: разработка, применение. – 2013. – №11. – С. 64–69.






Copyright (c) 2017 S. A. Dadenkov, D. A. Dadenkov

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Address of the journal editorial office:
Editorial office of the journal «Radio Electronics, Computer Science, Control»,
Zaporizhzhya National Technical University, 
Zhukovskiy street, 64, Zaporizhzhya, 69063, Ukraine. 
Telephone: +38-061-769-82-96 – the Editing and Publishing Department.
E-mail: rvv@zntu.edu.ua

The reference to the journal is obligatory in the cases of complete or partial use of its materials.