GPU-EvR: Run-time event based real-time scheduling framework on GPGPU platform

Author(s):  
Haeseung Lee ◽  
Mohammad Abdullah Al Faruque
2013 ◽  
Vol 2 (1) ◽  
pp. 114-132 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Mohamed Khalgui ◽  
Samir Ben Ahmed

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest Deadline first (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. The paper deals with Reconfigurable Uniprocessor embedded Real-Time Systems classically implemented by different OS tasks that the authors suppose independent, synchronous and periodic to meet functional and temporal properties described in user requirements. They define two forms of automatic reconfigurations which are applied at run-time: Addition-Remove of tasks or just modifications of their temporal parameters: WCET and/or Periods. The authors define a new semantic of the reconfiguration where a crucial criterion to consider is the automatic improvement of the system’s feasibility at run-time by using an Intelligent Agent that automatically checks the system’s feasibility after any reconfiguration scenario to verify if all tasks meet the required deadlines. To handle all possible reconfiguration solutions, the authors propose an agent-based architecture that applies automatic reconfigurations to re-obtain the system’s feasibility and satisfy user requirements. Therefore, they developed the tool RT-Reconfiguration to support these contributions that they apply on the running example system and the authors apply the Real-Time Simulator, Cheddar to check the whole system behavior and evaluate the performance of the algorithm. They present simulations of this architecture where the agent that implemented is evaluated.


2021 ◽  
Author(s):  
Antoine Bertout ◽  
Joël Goossens ◽  
Emmanuel Grolleau ◽  
Roy Jamil ◽  
Xavier Poczekajlo

2021 ◽  
Vol 13 (6) ◽  
pp. 3400
Author(s):  
Jia Ning ◽  
Sipeng Hao ◽  
Aidong Zeng ◽  
Bin Chen ◽  
Yi Tang

The high penetration of renewable energy brings great challenges to power system operation and scheduling. In this paper, a multi-timescale coordinated method for source-grid-load is proposed. First, the multi-timescale characteristics of wind forecasting power and demand response (DR) resources are described, and the coordinated framework of source-grid-load is presented under multi-timescale. Next, economic scheduling models of source-grid-load based on multi-timescale DR under network constraints are established in the process of day-ahead scheduling, intraday scheduling, and real-time scheduling. The loads are classified into three types in terms of different timescale. The security constraints of grid side and time-varying DR potential are considered. Three-stage stochastic programming is employed to schedule resources of source side and load side in day-ahead, intraday, and real-time markets. The simulations are performed in a modified Institute of Electrical and Electronics Engineers (IEEE) 24-node system, which shows a notable reduction in total cost of source-grid-load scheduling and an increase in wind accommodation, and their results are proposed and discussed against under merely two timescales, which demonstrates the superiority of the proposed multi-timescale models in terms of cost and demand response quantity reduction.


Sign in / Sign up

Export Citation Format

Share Document