scholarly journals Enabling Model-Driven Schedulability Analysis in the Development of Distributed Component-Based Real-Time Applications

2009 ◽  
Author(s):  
Patricia López Martinez ◽  
José M. Drake ◽  
Julio L. Medina
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Model Driven ◽  
Real Time Applications

A Review of Hierarchical Fixed Priority Scheduling

2014 ◽  
Vol 536-537 ◽  
pp. 566-569
Author(s):  
Feng Xiang Zhang
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Priority Scheduling ◽  
Scheduling Policies ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Priority Algorithms ◽  
Priority Systems ◽  
Real Time Applications ◽  
Global And Local

This paper focus on two level hierarchical scheduling where several real-time applications are scheduled by the fixed priority algorithms. The application with its real-time tasks is bound to a server which can be modeled as a sporadic task with special care for the schedulability analysis. Different scheduling policies and servers can be applied for hierarchical fixed priority systems, this paper gives a closer review of schedulability analysis for applications and tasks when the global and local schedulers of a system are fixed priority.

Model-Driven Engineering, Services and Interactive Real-Time Applications

2014 ◽  
pp. 178-202
Author(s):  
Luis Costa ◽  
Neil Loughran ◽  
Roy Grønmo
Keyword(s):  
Software Engineering ◽  
Language Development ◽  
Real Time ◽  
Software Systems ◽  
Model Driven Engineering ◽  
Model Driven ◽  
Future Developments ◽  
Real Time Applications ◽  
High Level

Model-driven software engineering (MDE) has the basic assumption that the development of software systems from high-level abstractions along with the generation of low-level implementation code can improve the quality of the systems and at the same time reduce costs and improve time to market. This chapter provides an overview of MDE, state of the art approaches, standards, resources, and tools that support different aspects of model-driven software engineering: language development, modeling services, and real-time applications. The chapter concludes with a reflection over the main challenges faced by projects using the current MDE technologies, pointing out some promising directions for future developments.

Model-Driven Engineering, Services and Interactive Real-Time Applications

2011 ◽  
pp. 16-40
Author(s):  
Luis Costa ◽  
Neil Loughran ◽  
Roy Grønmo
Keyword(s):  
Software Engineering ◽  
Language Development ◽  
Real Time ◽  
Software Systems ◽  
Model Driven Engineering ◽  
Model Driven ◽  
Future Developments ◽  
Real Time Applications ◽  
High Level

Model-driven software engineering (MDE) has the basic assumption that the development of software systems from high-level abstractions along with the generation of low-level implementation code can improve the quality of the systems and at the same time reduce costs and improve time to market. This chapter provides an overview of MDE, state of the art approaches, standards, resources, and tools that support different aspects of model-driven software engineering: language development, modeling services, and real-time applications. The chapter concludes with a reflection over the main challenges faced by projects using the current MDE technologies, pointing out some promising directions for future developments.

scholarly journals Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems

2011 ◽  
Vol 6 (1) ◽  
pp. 187 ◽  
Author(s):  
Doina Zmaranda ◽  
Gianina Gabor ◽  
Daniela Elena Popescu ◽  
Codruta Vancea ◽  
Florin Vancea
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Scheduling Algorithms ◽  
Real Time Systems ◽  
Priority Scheduling ◽  
Fixed Priority ◽  
Fixed Priority Scheduling ◽  
Rate Monotonic ◽  
Real Time Applications ◽  
Time Systems

For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in the literature, starting from static scheduling or cyclic executives which provide very deterministic yet inflexible behaviour, to the so called best-effort scheduling, which facilitates maximum run-time flexibility but allows only probabilistic predictions of run-time performance presenting a non-predictable and nondeterministic solution. Between these two extremes lies fixed priority scheduling algorithms, such as Rate Monotonic, that is not so efficient for real-time purposes but exhibits a predictable approach because scheduling is doing offline and guarantees regarding process deadlines could be obtained using appropriate analysis methods. This paper investigates the use of Rate Monotonic algorithm by making adjustments in order to make it more suitable for real-time applications. The factors that motivate the interest for fixed priority scheduling algorithms such Rate Monotonic when doing with real-time systems lies in its associated analysis that could be oriented in two directions: schedulability analysis and analysis of process interactions. The analyzing process is carried out using a previously implemented framework that allows modelling, simulation and schedulability analysis for a set of real-time system tasks, and some of the results obtained are presented.

Sign in / Sign up

Export Citation Format

Share Document