Sökning: "Mikael Sjödin"
Visar resultat 1 - 5 av 18 avhandlingar innehållade orden Mikael Sjödin.
Sammanfattning : The ubiquitous use of computers in modern society is rapidly changing our way of life. In many existing and emerging applications the timely response to events is of utmost importance. Consider for instance a modern vehicle with embedded computers that must react to driver commands within well specified timing tolerances. LÄS MER
Sammanfattning : The Hierarchical Scheduling Framework (HSF) has been introduced to enable compositional schedulability analysis and execution of embedded software systems with real-time constraints. In this thesis, we consider a system consisting of a number of semi-independent components called subsystems, and these subsystems are allowed to share logical resources. LÄS MER
Sammanfattning : In this thesis we propose techniques to simplify the integration of subsystems while minimizing the overall amount of CPU resources needed to guarantee the schedulability of real-time tasks. In addition, we provide solutions to the problem of allowing for the use of logical resources requiring mutual exclusion. LÄS MER
Sammanfattning : A combinatorial optimization problem is an optimization problem where the number of possible solutions are finite and grow combinatorially with the problem size. Combinatorial problems exist everywhere in industrial systems. LÄS MER
Sammanfattning : Considering the ubiquitousness of software in modern vehicles, its increased value and development cost, an efficient software development became of paramount importance for the vehicular domain. It has been identified that early verification of non functional properties of vehicular embedded software such as, timing, reliability and safety, is crucial to efficiency. LÄS MER