Mapping and scheduling hard real time applications on multicore systems - The ARGO approach

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using multi-core architectures for embedded time-critical systems creates a big challenge for developers due to the complexity of the underline mapping and scheduling problem. H2020 ARGO project [2] proposes a tool flow to minimize multi-core applications development time while guaranteeing real-time performance. In this paper, we provide an overview of ARGO tool flow and we focus on the heuristic approach of solving the worst case execution time aware (WCET) mapping and scheduling problem on hierarchical task graphs. Examples from two real applications from the aerospace and image processing domains are presented.

Cite

CITATION STYLE

APA

Alefragis, P., Theodoridis, G., Katsimpris, M., Valouxis, C., Gogos, C., Goulas, G., … Becker, J. (2018). Mapping and scheduling hard real time applications on multicore systems - The ARGO approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10824 LNCS, pp. 700–711). Springer Verlag. https://doi.org/10.1007/978-3-319-78890-6_56

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free