Performance of Dynamic Queue Based Minimal Deadline First Scheduling Algorithm In Multicore System Under Real Time And Non-Real Time Kernel Environment
M Shanmugsundaram1, Kalpak Burgul2, Kumar R3, Kittur H M4
1M Shanmugsundaram, Vellore Institute of Technology, Vellore, Tamilnadu, India.
2Kalpak Burgul, Vellore Institute of Technology, Vellore, Tamilnadu, India.
3Kumar R, National Institute of Technology, Warangal, Telangana, India.
4Kittur H M Vellore Institute of Technology, Vellore, Tamilnadu, India.
Manuscript received on 24 August 2019. | Revised Manuscript received on 07 September 2019. | Manuscript published on 30 September 2019. | PP: 3263-3268 | Volume-8 Issue-11, September 2019. | Retrieval Number: K25320981119/2019©BEIESP | DOI: 10.35940/ijitee.K2532.0981119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Some real-time systems that need to be associated with operating system services with a hard real-time system. Since these real-time systems that need to be extremely responsive to the outside world have no simple and low-cost operating system assistance. This paper deals with the application on a Linux-based operating system of the priority-based preemptive real-time scheduling algorithm that will suffice these firm applications in real-time. Typically, the algorithms regarded for these hard real-time systems are preemptive scheduling based on priorities. Based on the priority, by meeting the deadline, this algorithm can produce a feasible schedule for the dynamic tasks to be performed on the processor. It is feasible to schedule tasks on a processor as long as preemption is permitted and tasks do not compete for resources. In this scheduling algorithm, the task in the running queue that is waiting for the execution will be placed in the priority queue that is ready to execute in the available processor. This algorithm is deployed in the Linux kernel with the patch file and the kernel is built in the multi core system to execute an application.
Keywords: Real time scheduling; Preemptive priority; Real time systems; Kernel; MDF; DQMDF; Multicore; Raspberry Pi.
Scope of the Article: Environmental Engineering