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 2019
PrVM: a multicore real-time virtualization scheduling framework with probabilistic timing guarantees
We present PrVM, a framework for scheduling real-time VMs on multicore hardware. It addresses the intersection of the following problems: probabilistic real-time scheduling, VM scheduling, and full virtualization. Though each of these problems have been ...
- research-articleJanuary 2018
Cost minimization of network services with buffer and end-to-end deadline constraints
Cloud computing technology provides the means to share physical resources among multiple users and data center tenants by exposing them as virtual resources. There is a strong industrial drive to use similar technology and concepts to provide timing ...
- 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
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-articleAugust 2016
Towards compositional mixed-criticality real-time scheduling in open systems: invited paper
Although many cyber-physical systems are both mixed-criticality system and compositional system, there are little work on intersection of mixed-criticality system and compositional system. We propose novel concepts for task-level criticality-mode and ...
- research-articleAugust 2016
Intra-component resource sharing on a virtual multiprocessor platform
Component-based software development facilitates the development process of large and complex software systems. By the advent of multiprocessors, the independently developed components can be integrated on a multi-core platform to achieve an efficient ...
- 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-articleJuly 2013
Using NPS-F for mixed-criticality multicore systems
Hard real-time multiprocessors scheduling has recently seen the flourishing of semi-partitioned scheduling algorithms -- a category of scheduling schemes that combine elements of partitioned and migrative scheduling to allow more efficient processor ...
- research-articleJuly 2013
An evaluation of the RUN algorithm in LITMUSRT
Existing multiprocessor real-time scheduling algorithms follow partitioning/global scheduling approaches or some hybrid approaches of the two. Under partitioning, all tasks are assigned to specific processors. Under global scheduling, tasks may migrate ...
- research-articleJuly 2013
Fixed priorities or EDF for distributed real-time systems?
Although fixed priority (FP) scheduling is the most popular online scheduling policy in industrial environments, the earliest deadline first (EDF) policy is starting to get more attention, given its benefits in terms of increased resource usage. A ...
- 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, ...