ROUND-ROBIN PREEMPTIVE SCHEDULER MODEL IN DISTRIBUTED REAL-TIME SYSTEM
DOI:
https://doi.org/10.15588/1607-3274-2017-4-13Keywords:
Task scheduling, real-time, round-robin, priority-driven preemptive scheduler, model, probable and time response characteristics, distributed system, industrial network, fieldbus.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.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.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2017 S. A. Dadenkov, D. A. Dadenkov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
