2006 IEEE International Conference on Industrial Informatics 2006
DOI: 10.1109/indin.2006.275645
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic Mechanism for Run-time Reconfiguration Activities in an RTOS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…Gï> 1 2 tz, Dittmann, and Pereira proposed a deterministic mechanism for reconfiguration in [8]. They use a hybrid architecture in which services of the RTOS are implemented both in software and in hardware.…”
Section: Related Workmentioning
confidence: 99%
“…Gï> 1 2 tz, Dittmann, and Pereira proposed a deterministic mechanism for reconfiguration in [8]. They use a hybrid architecture in which services of the RTOS are implemented both in software and in hardware.…”
Section: Related Workmentioning
confidence: 99%
“…In particular, in [10] a new scheduling algorithm for periodic realtime HW tasks is described, which assumes a system architecture based on the 1D model similar to the one we described and takes reconfiguration overhead into account. However, to the best of our knowledge, the only work on combined scheduling of SW/HW tasks that has been published outside of [25,26] is [11]. In [11], the design of a reconfigurable OS is described where OS services can migrate between SW and HW.…”
Section: Related Workmentioning
confidence: 99%
“…However, to the best of our knowledge, the only work on combined scheduling of SW/HW tasks that has been published outside of [25,26] is [11]. In [11], the design of a reconfigurable OS is described where OS services can migrate between SW and HW. Both FPGA reconfiguration time and the time required to migrate the state data are accounted for in the analysis.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The task scheduling problem is considered NP-complete [4] and several heuristics were developed to better meet a good scheduling with little overhead, like the distinct approaches used by [5], [6] for heterogeneous PUs. However, just very recently, some techniques are starting to be directly applied to a CPU-Co-processors execution platform.…”
Section: Introductionmentioning
confidence: 99%