scholarly journals Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

2008 ◽  
Author(s):  
Friedrich Eisenbrand ◽  
Thomas Rothvoß
Keyword(s):  
Response Time ◽  
Real Time ◽  
Np Hard ◽  
Real Time Scheduling ◽  
Time Scheduling

Performance Analysis of Preemptive Based Uniprocessor Scheduling

2016 ◽  
Vol 6 (4) ◽  
pp. 1489 ◽  
Author(s):  
M Shanmugasundaram ◽  
R Kumar ◽  
Harish M Kittur
Keyword(s):  
Performance Analysis ◽  
Response Time ◽  
Real Time ◽  
Time Constraints ◽  
Real Time Systems ◽  
Real Time Scheduling ◽  
Analysis Methodology ◽  
Time Scheduling ◽  
Time Systems ◽  
Uniprocessor Scheduling

All the real-time systems are bound with response time constraints, or else, there is a risk of  severe consequences, which includes failure. The System will fail when not able to meet the requirements according to the specifications. The problem of real-time scheduling is very vast, ranging from uni-processor to complicated-multiprocessor. In this paper, we have compared the performance of real-time tasks that should be scheduled properly, to get optimum performance. Analysis methodology and the concept of optimization leads to the design of appropriate scheduling. We have done  the analysis among RM and EDF algorithm that are important for scheduling in uni-processor.

scholarly journals Beyond the limitations of real-time scheduling theory: a unified scheduling theory for the analysis of real-time systems

2021 ◽  
Author(s):  
Frank Slomka ◽  
Mohammadreza Sadeghi
Keyword(s):  
Response Time ◽  
Real Time ◽  
Scheduling Theory ◽  
Real Time Systems ◽  
Response Time Analysis ◽  
Time Analysis ◽  
Worst Case ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Time Systems

AbstractWe investigate the mathematical properties of event bound functions as they are used in the worst-case response time analysis and utilization tests. We figure out the differences and similarities between the two approaches. Based on this analysis, we derive a more general form do describe events and event bounds. This new unified approach gives clear new insights in the investigation of real-time systems, simplifies the models and will support algebraic proofs in future work. In the end, we present a unified analysis which allows the algebraic definition of any scheduler. Introducing such functions to the real-time scheduling theory will lead two a more systematic way to integrate new concepts and applications to the theory. Last but not least, we show how the response time analysis in dynamic scheduling can be improved.

scholarly journals Performance Analysis of Preemptive Based Uniprocessor Scheduling

2016 ◽  
Vol 6 (4) ◽  
pp. 1489
Author(s):  
M Shanmugasundaram ◽  
R Kumar ◽  
Harish M Kittur
Keyword(s):  
Performance Analysis ◽  
Response Time ◽  
Real Time ◽  
Time Constraints ◽  
Real Time Systems ◽  
Real Time Scheduling ◽  
Analysis Methodology ◽  
Time Scheduling ◽  
Time Systems ◽  
Uniprocessor Scheduling

All the real-time systems are bound with response time constraints, or else, there is a risk of  severe consequences, which includes failure. The System will fail when not able to meet the requirements according to the specifications. The problem of real-time scheduling is very vast, ranging from uni-processor to complicated-multiprocessor. In this paper, we have compared the performance of real-time tasks that should be scheduled properly, to get optimum performance. Analysis methodology and the concept of optimization leads to the design of appropriate scheduling. We have done  the analysis among RM and EDF algorithm that are important for scheduling in uni-processor.

Workload assignment for global real-time scheduling on unrelated clustered platforms

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

scholarly journals Research on Multi-Timescale Coordinated Method for Source-Grid-Load with Uncertain Renewable Energy Considering Demand Response

2021 ◽  
Vol 13 (6) ◽  
pp. 3400
Author(s):  
Jia Ning ◽  
Sipeng Hao ◽  
Aidong Zeng ◽  
Bin Chen ◽  
Yi Tang
Keyword(s):  
Renewable Energy ◽  
Real Time ◽  
Demand Response ◽  
System Operation ◽  
Real Time Scheduling ◽  
High Penetration ◽  
Time Scheduling ◽  
Grid Load ◽  
Grid Side ◽  
Scheduling Models

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