Sökning: "Hierarchical scheduling systems"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden Hierarchical scheduling systems.

  1. 1. Hierarchical scheduling for predictable execution of real-time software components and legacy systems

    Författare :Rafia Inam; Mikael Sjödin; Jukka Mäki-Turja; Moris Behnam; Giuseppe Lipari; Mälardalens högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; real-time systems; component integration and reuse; hierarchical scheduling; multicore; Computer Science; datavetenskap;

    Sammanfattning : This dissertation presents techniques to achieve predictable execution of coarse-grained software components and for preservation of temporal properties of components during their integration and reuse.The dissertation presents a novel concept runnable virtual node (RVN) which interaction with the environment is bounded both by a functional and a temporal interface, and the validity of its internal temporal behaviour is preserved when integrated with other components or when reused in a new environment. LÄS MER

  2. 2. Analysis and Optimisation of Distributed Embedded Systems with Heterogeneous Scheduling Policies

    Författare :Traian Pop; Petru Ion Eles; Zebo Peng; Luis Almeida; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Distributed embedded systems; Real-time analysis; Scheduling; Design optimisation; FlexRay; Computer and systems science; Data- och systemvetenskap;

    Sammanfattning : The growing amount and diversity of functions to be implemented by the current and future embedded applications (like, for example, in automotive electronics) have shown that, in many cases, time-triggered and event-triggered functions have to coexist on the computing nodes and to interact over the communication infrastructure. When time-triggered and event-triggered activities have to share the same processing node, a natural way for the execution support can be provided through a hierarchical scheduler. LÄS MER

  3. 3. Towards a Predictable Component-Based Run-Time System

    Författare :Rafia Inam; Mikael Sjödin; Jukka Mäki-Turja; Tullio Vardanega; Mälardalens högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; real-time systems; component based software engineering; hierarchical scheduling; Computer Science; datavetenskap;

    Sammanfattning : In this thesis we propose a technique to preserve the temporal properties of realtime components during their integration and reuse. We propose a new concept of runnable virtual node which is a coarse-grained real-time component that provides functional and temporal isolation with respect to its environment. LÄS MER

  4. 4. Adaptive Hierarchical Scheduling Framework for Real-Time Systems

    Författare :Nima Khalilzad; Thomas Nolte; Martina Maggio; Mälardalens högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Computer Science; datavetenskap;

    Sammanfattning : Modern computer systems are often designed to play a multipurpose role. Therefore, they are capable of running a number of software tasks (software programs) simultaneously in parallel. These software tasks should share the processor such that all of them run and finish their computations as expected. LÄS MER

  5. 5. !secure(system) <=?=> !safe(system) : On Security and Safety of Industrial Software Systems

    Författare :Marcus Lindner; Per Lindgren; Valeriy Vyatkin; Knut Åkesson; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; embedded systems; hard real-time; concurrency; model of computation; safety-critical; safety; security; industrial automation; RTFM; real-time for the masses; Embedded Systems; Inbyggda system;

    Sammanfattning : The focus of our research work is on readily accessible, embedded, real-time development with concurrency support. To this end, we develop the Real-Time For the Masses (RTFM) programming framework with a model of computation based on tasks and resources and that stipulates a timing semantics. LÄS MER