Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks

Author(s):  
Jian-Jia Chen
Keyword(s):  
Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1060
Author(s):  
Md Mamun Ur Rashid ◽  
Majed A. Alotaibi ◽  
Abdul Hasib Chowdhury ◽  
Muaz Rahman ◽  
Md. Shafiul Alam ◽  
...  

From a residential point of view, home energy management (HEM) is an essential requirement in order to diminish peak demand and utility tariffs. The integration of renewable energy sources (RESs) together with battery energy storage systems (BESSs) and central battery storage system (CBSS) may promote energy and cost minimization. However, proper home appliance scheduling along with energy storage options is essential to significantly decrease the energy consumption profile and overall expenditure in real-time operation. This paper proposes a cost-effective HEM scheme in the microgrid framework to promote curtailing of energy usage and relevant utility tariff considering both energy storage and renewable sources integration. Usually, the household appliances have different runtime preferences and duration of operation based on user demand. This work considers a simulator designed in the C++ platform to address the domestic customer’s HEM issue based on usages priorities. The positive aspects of merging RESs, BESSs, and CBSSs with the proposed optimal power sharing algorithm (OPSA) are evaluated by considering three distinct case scenarios. Comprehensive analysis of each scenario considering the real-time scheduling of home appliances is conducted to substantiate the efficacy of the outlined energy and cost mitigation schemes. The results obtained demonstrate the effectiveness of the proposed algorithm to enable energy and cost savings up to 37.5% and 45% in comparison to the prevailing methodology.


Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the existing algorithms to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors. This paper then compares the proposed algorithm with existing algorithm. The expected results show that the proposed algorithm performs better than the existing algorithms.</p>


2020 ◽  
Vol 193 ◽  
pp. 106593 ◽  
Author(s):  
Gregory Levitin ◽  
Liudong Xing ◽  
Yanping Xiang

2015 ◽  
Vol 26 (3) ◽  
pp. 284-290 ◽  
Author(s):  
Lisa H. Evans ◽  
Jane E. Herron ◽  
Edward L. Wilding
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document