2015
DOI: 10.1007/978-3-319-17473-0_14
|View full text |Cite
|
Sign up to set email alerts
|

Change Detection Based Parallelism Mapping: Exploiting Offline Models and Online Adaptation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…Their approach predicts the optimal number of threads for a program and also predicts the run time environment. Emani et al [162] proposed an efficient parallel mapping based on online change detection by combining offline model with online adaption to find the optimal number of threads for an OpenMP program. Luk et al [163] proposed a fully automatic mapping technique to map computations to processing elements on heterogeneous multiprocessors.…”
Section: Machine Learning Based Parallelism Mappingmentioning
confidence: 99%
“…Their approach predicts the optimal number of threads for a program and also predicts the run time environment. Emani et al [162] proposed an efficient parallel mapping based on online change detection by combining offline model with online adaption to find the optimal number of threads for an OpenMP program. Luk et al [163] proposed a fully automatic mapping technique to map computations to processing elements on heterogeneous multiprocessors.…”
Section: Machine Learning Based Parallelism Mappingmentioning
confidence: 99%
“…Their approach predicts the optimal number of threads for a program and the run-time environment. Emani et al [162] proposed an efficient parallel mapping based on online change detection by combining an offline model with online adaption to find the optimal number of threads for an OpenMP program. Luk et al [163] proposed a fully automatic mapping technique to map computations to processing elements on heterogeneous multiprocessors.…”
Section: Machine Learning-based Parallelism Mappingmentioning
confidence: 99%
“…An interesting RL based approach for scheduling parallel OpenMP programs is presented in [114]. This approach predicts the best number of threads for a target OpenMP program when it runs with other competing workloads, aiming to make the target program run faster.…”
Section: B Unsupervised Learningmentioning
confidence: 99%