scholarly journals Scheduling in Real Time System

Author(s):  
mehreen sirshar ◽  
huma rizwan ◽  
muneeba shabbir ◽  
hajra nawaz

Scheduling of real time tasks are very important aspect in systems as processes should complete its task at a specific time. There is a need of high energy efficiency and low response time in large data stream so for this energy efficient resources and optimized frameworks are needed. Both hard real time and mixed critically systems are targeted. Soft deadline can be handled while hard deadlines are difficult to cater. Different algorithms are used to schedule tasks like rate monotonic, earliest deadline first, deadline monotonic etc.

Vestnik MEI ◽  
2018 ◽  
Vol 5 (5) ◽  
pp. 73-78
Author(s):  
Igor В. Fominykh ◽  
◽  
Sergey V. Romanchuk ◽  
Nikolay Р. Alekseev ◽  
◽  
...  

Author(s):  
Husam Kareem

<p>A major issue that happens in kitchens of houses and/or restaurants is the leakage of gas used as a fuel for cooker stove, which is commonly referred to as LPG (liquefied petroleum gas). LPG leakage may lead to a serious fire or even a deadly explosion that might affect the surrounding people. A substantial solution to avoid such disasters is by stopping its main cause. Therefore designing a device capable of monitoring and detecting such gases can minimize the dangerous and unwanted incidents by LPG leakage. This paper introduces a low cost and energy efficient real-time monitoring system that able to sense different dangerous gases, specifically those used for stove cooker. This system considers the pros of the previously introduced systems and fixes the cons available in those systems. In addition, the manufacturing cost has been taken into consideration. If the system senses any type of LPG gas (there is a gas leakage), it will react by making three different actions. It will make an alert sound to notify the people around the leakage place, send an SMS to two cell phones, and show, on an LCD screen, the leakage location.</p>


2017 ◽  
Vol 26 (06) ◽  
pp. 1750091 ◽  
Author(s):  
Linwei Niu ◽  
Wei Li

In this paper, we study the problem of reducing the energy consumption for hard real-time systems scheduled according to either fixed-priority (FP) or earliest-deadline-first (EDF) scheme. To balance the static and dynamic energy consumptions, the concept of critical speed was proposed in previous research. Moreover, when combined with the processor idle/shutdown state, the critical speed was widely used as the lower bound for voltage scaling in literature. In this paper, we show that this strategy might not always be more energy efficient than the traditional DVS strategy and there exists a dynamic tradeoff between these two strategies depending on the job’s work-demand to be finished within certain intervals. To effectively address this issue, we propose a unified approach that combines these two strategies to achieve better overall energy saving performance. Our approach determines the energy-efficient speeds for real-time jobs in their corresponding feasible intervals based on the threshold work-demand analysis. Our experimental results demonstrate that the proposed techniques significantly outperform previous approaches in the overall energy saving performance.


Author(s):  
Diego Pinheiro ◽  
Rawlinson Goncalves ◽  
Eduardo Valentin ◽  
Horacio Oliveira ◽  
Raimundo Barreto

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 172 ◽  
Author(s):  
Hoyoun Lee ◽  
Jinkyu Lee

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.


2013 ◽  
Vol 475-476 ◽  
pp. 1161-1166
Author(s):  
Xu Dong Zhu ◽  
Hui You Chang

This paper puts forward a novel constraint specification. By limitations on the maximum of consecutive miss of deadline and the minimum probability of meeting deadline on the fixed sliding window s×m, the novel constraint specification has three contributions to the research of the weakly hard real-time system constraint specification. Firstly, has configurable flexible parameters which can easily realize all hard real-time, soft real-time and weakly hard real-time only by changing the parameters. Secondly, replacing the "fixed sliding window" with the "any" window, the novel constraint specification not only simplify the calculation of real-time, which will reduce the time consume, but also broaden the application scope such as smoothly scheduling. Moreover, the fixed sliding window is helpful to find a schedulable μ-pattern. Thirdly, the novel constraint specification solves the invalidity of some constraint specification when the first invocation of task is lost or missed. Through analysis and experiments, the results demonstrate that our novel constraint specification outperform previous approaches in both calculation methods and application scopes.


Sign in / Sign up

Export Citation Format

Share Document