2017
DOI: 10.1109/access.2017.2684129
|View full text |Cite
|
Sign up to set email alerts
|

Toward Emotion-Aware Computing: A Loop Selection Approach Based on Machine Learning for Speculative Multithreading

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…In computational theory, the simplest computational resources are computation time, the number of parameters necessary to solve a problem, and memory space [28]. In this section, the computational resource comparisons of four classic neural network models and the proposed model are analyzed in Table 6.…”
Section: Computational Resourcesmentioning
confidence: 99%
“…In computational theory, the simplest computational resources are computation time, the number of parameters necessary to solve a problem, and memory space [28]. In this section, the computational resource comparisons of four classic neural network models and the proposed model are analyzed in Table 6.…”
Section: Computational Resourcesmentioning
confidence: 99%
“…Compared with the method that combines static compilation benefit analysis and a dynamic operating loop scheduling scheme [31], the proposed method can obtain a higher parallelism granularity. Compared with the multilevel nested loop parallelization model proposed by Liu et al [32] based on the KNN algorithm of machine learning, the proposed method is simpler and more intuitive, which makes it easier to integrate with mainstream compilers. Given that Dice et al [9] considered the actual running state of the multilevel nested loops to be closely related to the underlying hardware and that Li et al [2] extracted the relevant parameters of multilevel nested loops from the intermediate representation of the Prophet compiler, which relies on the organizational structure of the specific compiler, the proposed method starts from the direction matrix of multilevel nested loops and thus has a higher applicability in mainstream compilers.…”
Section: Discussionmentioning
confidence: 99%
“…We selected two loop selection methods, Method A and Method B, which have been mostly investigated. Method A uses a loop selection method that combines the compile time and the runtime [31], and Method B uses a loop selection method based on machine learning [32]. e automatic parallelization performance of the basic compiler was again used as the benchmark of the test.…”
Section: Comparison Of the Proposed Methods With Existingmentioning
confidence: 99%
See 2 more Smart Citations