Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2019
Energy-aware scheduling of malleable fork-join tasks under a deadline constraint on heterogeneous multicores
This paper proposes an energy-aware scheduling of malleable fork-join (MFJ) tasks on heterogeneous multicores. This work allows a task to be split into multiple sub-tasks for fork-join parallel execution. The number of the sub-tasks is determined ...
- research-articleNovember 2019
ILP-based scheduling for malleable fork-join tasks
This paper studies scheduling of malleable fork-join tasks. In our scheduling problem, each task can be partitioned into multiple sub-tasks, and the sub-tasks are scheduled independently. The optimal number of sub-tasks is determined during scheduling ...
- research-articleNovember 2017
Real-time network function virtualization with timing interfaces
More and more infrastructure is becoming virtualized. Recently this trend has begun to include network functions - such as firewalls, WAN optimizers, and intrusion prevention systems - that have traditionally been implemented as middleboxes using ...
- research-articleNovember 2017
On flexible and robust parameter assignment for periodic real-time components
In order to increase the flexibility of design process, we consider a component-based system in which some components may be changed, repaired, or upgraded. We assume that the worst-case execution time (WCET) of each task that is implemented by a ...
- research-articleNovember 2016
Traffic class assignment for mixed-criticality frames in TTEthernet
In this paper we are interested in mixed-criticality applications, which have functions with different timing requirements, i.e., hard real-time (HRT), soft real-time (SRT) and functions that are not time-critical (NC). The applications are implemented ...
-
- research-articleNovember 2016
Hierarchical scheduling over off- and on-chip deterministic networks
In this paper we present a compositional model for distributed virtualized systems communicating over on-chip/off-chip deterministic networks implementing an end-to-end or partial time-triggered paradigm. We derive system-level constraints for combined ...
- research-articleNovember 2016
A lazy DVS approach for dynamic real time system
This paperpresents a LazyDVS scheduling algorithm that offers higher acceptance ratio (number of tasks able to meet their deadline is to number of tasks appearing) with equivalent orlesser energy consumption for battery powered dynamic real time system. ...
- research-articleApril 2016
Towards a declarative modeling and execution framework for real-time systems
Our work is a contribution towards addressing what Thomas Henziger called the grand challenge in embedded software design [5]: "offering high-level programming models that exposes the execution properties of a system in a way that permits the programmer ...
- research-articleApril 2016
A new scheduling algorithm for non-preemptive independent tasks on a multi-processor platform
The abort-and-restart scheme from the Priority-based Functional Reactive Programming (PFRP) paradigm eliminates the priority inversion problem. This paper is similar by solving the priority inversion problem using the task order restrictions sets of ...
- research-articleApril 2016
Worst case response time and schedulability analysis for real-time software transactional memory-lazy conflict detection (STM-LCD)
Software transactional memory (STM) is a transactional mechanism of controlling access to shared resources in memory. This transactional mechanism is similar to the abort-and-restart execution model in a functional reactive system (FRS). Due to its ...
- research-articleAugust 2015
Virtual release advancing for earlier deadlines
Giving tasks more urgent deadlines leads to shorter response times in EDF-based scheduling. This paper describes a technique that gives earlier deadlines by virtually advancing release times in the Total Bandwidth Server (TBS) context. This technique ...
- research-articleMarch 2015
Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources
In this paper we revisit the admission of applications upon a processor share modeled by the explicit-deadline periodic (EDP) resource-supply model. In particular, we consider applications that represent a fixed-priority sporadic task system. Existing ...
- research-articleNovember 2014
Dynamic reconfiguration in multi-hop switched ethernet networks
The FTT-SE protocol provides adaptive real-time communication on Ethernet networks. To assure a continued real-time behavior, FTT-SE integrates admission control with a quality-of-service mechanism, which screen all adaptation and reconfiguration ...
- research-articleSeptember 2014
Flat but trustworthy: security aspects in flattened hierarchical scheduling
Virtualization is a well-proven technology for consolidating desktop and server applications onto the same hardware platform while maintaining their native environments. However, although embedded real-time systems start to adopt this technology, ...
- research-articleFebruary 2013
Modeling and analysis of adaptive embedded systems using adaptive task automata
Most embedded systems need to continually function in unpredictable environments. One way to achieve high dependability is to make the system adaptive to changes, if possible, without sacrificing maintainability. To be able to reason about adaptivity, ...
- demonstrationMarch 2011
A tool for component-based schedulability analysis of distributed real-time pipelines
In many scenarios, such as in the automotive context [1], [2], the complexity of developing a distributed real-time embedded (DRE) system is reduced by dividing the system into separate components, possibly developed by a different teams or third-party ...
- demonstrationMarch 2011
Hierarchical server-based traffic scheduling in ethernet switches
Distributed Embedded Real-Time Systems (DERTS) are ever more complex, consisting of an increasing number of nodes with more functionality and handling more data. This scenario is pushing for paradigm changes in the methodologies to design complex DERTS. ...
- demonstrationMarch 2011
From composable design models to schedulability analysis with UML and the UML profile for MARTE
Consider the design of hard real-time distributed systems using a model-based and composable approach, in which their specification is made using a high level modelling language like UML. This demo abstract, presents a tool-aided methodology to enable ...
- research-articleMarch 2011
Improving resource utilization for compositional scheduling using DPRM interfaces
The paper revisits the generation of interfaces for compositional real-time scheduling. Following an established line of research, we use periodic resource models in component interfaces to describe resource demand of the component. We identify a ...
- research-articleMarch 2011
Implementation of compositional scheduling framework on virtualization
Virtualization has been receiving increasing attention in embedded real-time systems. However, real-time systems, whose correctness depends on timing requirements, are not easily applicable to virtualization since virtualization mainly focuses on ...