Implementation and validation of dynamic scheduler based on LST on FreeRTOS

Belagali, Rakesh; Kulkarni, Sushant; Hegde, Vinayak Gajanan; Mishra, Geetishree

doi:10.1109/iceeccot.2016.7955239

Cited by 6 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous research has explored ways to implement dynamic scheduling in FreeRTOS, such as the works by Kase et al [16] and Paez et al [17], which proposed a dynamic scheduling integration from an application perspective. Meanwhile, Belagali et al [18] implemented a layer above the static scheduler that allowed changing the priority in run time based on dynamic parameters while keeping the scheduling parts unchanged. Although these are valuable contributions, the proposed methods resulted in a high-overhead implementation of dynamic scheduling in FreeRTOS.…”

Section: B Motivational Examplementioning

confidence: 99%

Dynamic Scheduling for Event-Driven Embedded Industrial Applications

Taji,

Miranda,

Peón-Quirós

et al. 2023

2023 IFIP/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC)

View full text Add to dashboard Cite

This paper addresses the optimization of embedded platforms to meet the computing and real-time requirements of cyber-physical systems and IoT applications, including embedded intelligence. In this context, schedulers are vital in enhancing processor utilization in industrial contexts. Although existing research has focused primarily on the schedulability of periodic tasks, event-driven tasks better represent these new embedded intelligence scenarios in the real world. This work explores static and dynamic scheduling policies within a general scenario and a specific case study based on an actual industrial application. The proposed dynamic scheduler has been integrated into the FreeRTOS kernel and has been employed to conduct all of our experiments on industrial products within the smart home domain. Our results show that, while we can respect real-time requirements, our proposed dynamic scheduling can improve the performance of event-driven applications by reducing missed task deadlines by up to 60 %. Moreover, we have also developed a lightweight version of our dynamic scheduler for industrial products that reduces average timing overhead for task selection and insertion by up to 34.7 % and memory overhead for task creation and list scheduling by up to 74.7 % compared to stateof-the-art static alternatives.

show abstract

Section: B Motivational Examplementioning

confidence: 99%

Dynamic Scheduling for Event-Driven Embedded Industrial Applications

Taji,

Miranda,

Peón-Quirós

et al. 2023

2023 IFIP/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC)

View full text Add to dashboard Cite

show abstract

“…The implementation of a least slack time first dynamic scheduling approach to serve a number of real-time applications on a single processor is presented in papers [6] and [7]. The suggested method implementation covers a variety of real-time applications and can be customised for a variety of tasks, including periodic, aperiodic, and sporadic jobs.…”

Section: Literature Reviewmentioning

confidence: 99%

A Survey on Different Real Time Operating Systems

Santhosh¹,

Nagaraja²

2021

IJEAT

View full text Add to dashboard Cite

To minimise development costs and enhance dependability, modern embedded system development is increasingly emphasising on software modularity and reuse. Microcontrollers are extensively employed in embedded applications that have a very specific and specialised job to complete. The embedded applications are always resource constraint which requires efficient utilization of available resources. A Real Time Operating System (RTOS) is frequently used in this context to plan task execution as well as enable intertask communication and synchronisation. This paper provides the survey of different RTOS available in market and their applications. Several open source RTOS such as Free RTOS, VxWorks, SmallRTOS and TinyOS are compared with respect to the scheduling algorithms used.

show abstract

“…The algorithm checks the slacks of all the ready process each time a new process is released, or the existing process completes. The process with the smallest slack value will have the highest priority [9][15] [16] [17]. By looking at the approach of both algorithms, its ultimate aim is to meet the deadline of the given process.…”

Section: B Dynamic Scheduling Algorithmsmentioning

confidence: 99%

Hybrid Scheduler (S_LST) for Soft Real-Time System based on Static and Dynamic Algorithm

Teraiya¹,

Shah²

2019

IJEAT

View full text Add to dashboard Cite

In the Soft Real-Time System scheduling process with the processor is a critical task. The system schedules the processes on a processor in a time interval, and hence the processes get chance to executes on the processor. Priority-driven scheduling algorithms are sub-categorized into mainly two categories called Static Priority and Dynamic Priority Scheduler. Critical Analysis of more static and dynamic priority scheduling algorithms have been discussed in this paper. This paper has covered the static priority algorithms like Rate Monotonic (RM) and Shortest Job First (SJF) and the dynamic priority algorithms like Earliest Deadline First (EDF) and Least Slack Time First (LST). These all algorithms have been analyzed with preemptive process set and this paper has considered all the process set are periodic. This paper has also proposed a hybrid approach for efficient scheduling. In a critical analysis, it has been observed that while scheduling in underload situation dynamic priority algorithms perform well and even EDF also make sure that all process will meet their deadline. However, in an overload situation, the performance of dynamic priority algorithms reduce quickly, and most of the task will miss its deadline, whereas static priority scheduling algorithms miss a few deadlines, even it is possible to schedule all processes in underload situation, whereas in an overload situation, the static algorithms perform well compared to the dynamic scheduler. This paper is proposing one Hybrid algorithm call S_LST which uses the concept of LST and SJF scheduling algorithm. This algorithm has been applied to the periodic task set, and observations are registered. We have observed the Success Ratio (SR) & Effective CPU Utilization (ECU) and compared all algorithms in the same conditions. It is noted that instead of using LST and SJF as an independent algorithm, Hybrid algorithm S_LST performs well in underload and overload scenario. Practical investigations have been led on a huge dataset. Data Set consists of the 7000+ process set, and each process set has one to nine processes and load varies between 0.5 to 5. It has been tried on 500-time unit to approve the rightness everything being equal.

show abstract

Implementation and validation of dynamic scheduler based on LST on FreeRTOS

Cited by 6 publications

References 6 publications

Dynamic Scheduling for Event-Driven Embedded Industrial Applications

Dynamic Scheduling for Event-Driven Embedded Industrial Applications

A Survey on Different Real Time Operating Systems

Hybrid Scheduler (S_LST) for Soft Real-Time System based on Static and Dynamic Algorithm

Contact Info

Product

Resources

About