2009 International Conference on Reconfigurable Computing and FPGAs 2009
DOI: 10.1109/reconfig.2009.37
|View full text |Cite
|
Sign up to set email alerts
|

Multiprocessor Task Migration Implementation in a Reconfigurable Platform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…Activating/freeing up a core boils down to activating/deactivating a preloaded code instance since the sensordata processing is performed independently in each core. This also implies that this mechanism has no context switch overhead and has a negligible reconfiguration overhead [6].…”
Section: Implementation Architecture For Rpcmentioning
confidence: 95%
See 1 more Smart Citation
“…Activating/freeing up a core boils down to activating/deactivating a preloaded code instance since the sensordata processing is performed independently in each core. This also implies that this mechanism has no context switch overhead and has a negligible reconfiguration overhead [6].…”
Section: Implementation Architecture For Rpcmentioning
confidence: 95%
“…(ii) The shared memory needs to store γ M C old input signals. The other important ingredient is the reconfiguration mechanism, which realizes switching between the configurations at runtime using techniques proposed in [6]. In this method, control codes for the sensor-to-actuation loop are already loaded on γ M C cores.…”
Section: Implementation Architecture For Rpcmentioning
confidence: 99%
“…al [14] migrate tasks between heterogeneous cores of an MPSoC on top of µC/OS-II. Migration requests are pending until the execution has reached a user-defined checkpoint.…”
Section: Manual Definitionmentioning
confidence: 99%
“…Muneeswari [39] proposed a technique in which critical and non-critical tasks are classified, where the critical tasks are scheduled, such that re-utilization of the cache is minimized while, for non-critical tasks, round robin scheduling is used. Holmbacka et al and Gantel et al [40,41] proposed a task replication mechanism in which tasks are migrated between different cores. When a task is created on one core, a replica of the same task is created on other available cores.…”
Section: Introductionmentioning
confidence: 99%