2013
DOI: 10.1007/978-3-642-40698-0_9
|View full text |Cite
|
Sign up to set email alerts
|

OpenMP on the Low-Power TI Keystone II ARM/DSP System-on-Chip

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 30 publications
(29 citation statements)
references
References 19 publications
0
26
0
Order By: Relevance
“…Use of low power ARM based SoC processors [13] and manycore accelerators such as the TI C66X DSP [14], [15] for high performance computing are also of increasing interest. A comparison of some of these systems is shown in The closest related work is that of Mattson et al [7].…”
Section: Systemsmentioning
confidence: 99%
“…Use of low power ARM based SoC processors [13] and manycore accelerators such as the TI C66X DSP [14], [15] for high performance computing are also of increasing interest. A comparison of some of these systems is shown in The closest related work is that of Mattson et al [7].…”
Section: Systemsmentioning
confidence: 99%
“…RTEs for embedded parallel accelerators typically sit on top of hardware abstraction layers (HAL) [18] [19] [20] that expose low-level APIs to use bare iron resources. While designing a RTE with such a tight coupling to hardware resources enables very low overheads, it does not immediately allow the co-existence of multiple RTE, as hardware resources are physically identified.…”
Section: Acrm: the Multi-programming Model Multi-offload Pmca Managermentioning
confidence: 99%
“…Table I shows the array µi for each of the tasks shown in Figure 1 with m = 4. For example, the worst-case workload µ4 [2] occurs when NPRs v4,3 and v4,4 execute in parallel, with an overall impact of 9 time units. τ2 has a maximum parallelism of 2, so µ2 [3] and µ2 [4] are equal to 0.…”
Section: Definitionmentioning
confidence: 99%
“…The algorithm takes as input the DAG of task τi, the topological order 2 of Gi, and, for each node vi,j, the sets: (1) SIBLING(vi,j), which contains the nodes which have a common predecessor with 2 A topological order is such that if there is an edge from u to v in the DAG, then u appears before v in the topological order. A topological order can be easily computed in time linear in the size of the DAG [23].…”
Section: )mentioning
confidence: 99%
See 1 more Smart Citation