Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis

Teraiya, Jay; Shah, Apurva

doi:10.1109/icacci.2018.8554483

Cited by 11 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Teraiya and Shah [95], recommended that the LST and SJF be implemented in a real-time operating system that is not strictly real-time. Some algorithms were tested on a periodic work set, and the following results were achieved.…”

Section: Related Workmentioning

confidence: 99%

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

Ismael

Salih

Al-Zebari

et al. 2021

AJRCoS

View full text Add to dashboard Cite

The term "Real-Time Operating System (RTOS)" refers to systems wherein the time component is critical. For example, one or more of a computer's peripheral devices send a signal, and the computer must respond appropriately within a specified period of time. Examples include: the monitoring system in a hospital care unit, the autopilot in the aircraft, and the safety control system in the nuclear reactor. Scheduling is a method that ensures that jobs are performed at certain times. In the real-time systems, accuracy does not only rely on the outcomes of calculation, and also on the time it takes to provide the results. It must be completed within the specified time frame. The scheduling strategy is crucial in any real-time system, which is required to prevent overlapping execution in the system. The paper review classifies several previews works on many characteristics. Also, strategies utilized for scheduling in real time are examined and their features compared.

show abstract

Section: Related Workmentioning

confidence: 99%

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

Ismael

Salih

Al-Zebari

et al. 2021

AJRCoS

View full text Add to dashboard Cite

show abstract

“…One is required to find the probability of each task using equation in the initial phase. (1) In addition to that, all schedulable tasks are considered as a node and using pheromone τ, and heuristic value η, the probability of all nodes are selected for execution,…”

Section: A Creation Of Tourmentioning

confidence: 99%

“…Dynamic methods can be endured with static or dynamic priority. Rate Monotonic (RM) and Deadline Monotonic (DM) are the examples of the dynamic scheduling method with static priority [1] [2]. There are examples of dynamic scheduling with dynamic priority such as-Earliest Deadline First (EDF) and Least Slack Time First (LST).…”

Section: Introductionmentioning

confidence: 99%

ACO Based Scheduling Method for Soft RTOS with Simulation and Mathematical Proofs

Teraiya¹,

Shah²,

Kotecha³

2019

IJITEE

Self Cite

View full text Add to dashboard Cite

Abstract: The Ant Colony Optimization (ACO) algorithm is a mathematical model enlivened by the system searching conduct of ants. By taking a gander at the qualities of ACO, it is most suitable for scheduling of tasks in soft real-time systems. In this paper, the ACO based scheduling method for the soft real-time operating system (RTOS) has been profound with mathematical and practical proof. In Mathematical proof, three different Propositions and two Theorems have been given, which prove the correctness of the proposed algorithm. Practical experiments also support mathematical proofs. During the investigation, observations are gathered with different periodic task set. Algorithms have been observed regarding Success Ratio (SR) and Effective CPU utilization (ECU). ACO based scheduling algorithm has been compared with the Earliest Deadline First (EDF) algorithm with parameter SR and ECU. The EDF is dynamic scheduling algorithm and it is most suitable in RTOS when task set is preemptable. It is noted that the new algorithm is equally efficient during under loaded conditions when CPU load is less than one. ACO based scheduling algorithm performs superior during the overloaded conditions when CPU load is more than one where as EDF algorithm performance degraded in overload condition. Empirical study has been executed with ahefty Dataset consist of more than 7500 task set, and a set contains different one to nine processes where CPU load is dynamic for each process set and differ from 0.5 to 5. Algorithms have been executed on five-hundred-time unit for each process set to authenticate the accuracy of both algorithms.

show abstract

“…LST and SJF are static algorithms, and they do well in an overload scenario and try to schedule the maximum process in a given process set. The ideal algorithm can be designed, which uses the features of Dynamic and Static algorithm, and it performs well in underload as well as overload scenario [3][4] [5].…”

Section: ) Success Ratio (Sr)mentioning

confidence: 99%

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

Teraiya¹,

Shah²

2019

IJEAT

Self Cite

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

Comparative Study of LST and SJF Scheduling Algorithm in Soft Real-Time System with its Implementation and Analysis

Cited by 11 publications

References 10 publications

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

ACO Based Scheduling Method for Soft RTOS with Simulation and Mathematical Proofs

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

Contact Info

Product

Resources

About