2008 IEEE International Symposium on Parallel and Distributed Processing With Applications 2008
DOI: 10.1109/ispa.2008.69
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Reconfiguration of Tasks Applied to an UAV System Using Aspect Orientation

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
4
1
1

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…Moreover, before the fmal implementation, there is some additional work to be done in order to include task (re)allocation features, presented in [12], to support additional aspects of the adaptation capability.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, before the fmal implementation, there is some additional work to be done in order to include task (re)allocation features, presented in [12], to support additional aspects of the adaptation capability.…”
Section: Discussionmentioning
confidence: 99%
“…Required features are included through adding components or weaving aspects to handle real-time and other non-functional cross-cutting requirements in the minimal middleware. Using aspects to tune the middleware is not focused in this paper, for more information the readers are referred to [9] and [12].…”
Section: The Proposed Middlewarementioning
confidence: 99%
“…Scheduling on a CPU-GPU platform: Involving loadbalancing of tasks over a CPU-GPU platform, our previous work [14] firstly identified non-functional requirements that can be used as support for the assignment decision of tasks at high-level granularity. It was followed by [15], where they together observed a modern desktop as a heterogenous cluster composed of the CPU and several asymmetric PUs, like the GPU.…”
Section: Related Workmentioning
confidence: 99%
“…Although they can be extended to attend multiple PUs (which are not in a large number, since our focus is a desktop), we compare them with a straightforward implementation of a greedy technique (Algorithm 5), called here EFT (Earliest First Termination) and partially inspired on [14]. It performs the assignment of a task to the PU that will finish its pending task at the earliest time and, at the same time, can terminate Find a single task T that if switched to the other PU, it yields a maximum gain 5: end for 6: Swap the allocation of T in X 7: Return X; the processing of the new task at first.…”
Section: Dynamic Schedulermentioning
confidence: 99%
“…Scheduling on a CPU-GPU platform: Involving loadbalancing of GPU tasks, our previous work [13] observed modern desktops as heterogenous clusters composed of the CPU and several asymmetric PUs, like the GPU. Complemented by [14], it proposed a dynamic load-balancing framework for high-level tasks with performance profiling support.…”
Section: Related Workmentioning
confidence: 99%