2014
DOI: 10.2197/ipsjtrans.7.168
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Java Code Generation for Layer-unified Coarse Grain Task Parallel Processing

Abstract: Multicore processors are widely used for various types of computers. In order to achieve high-performance on such multicore systems, it is necessary to extract coarse grain task parallelism from a target program in addition to loop parallelism. Regarding the development of parallel programs, Java or a Java-extension language represents an attractive choice recently, thanks to its performance improvement as well as its platform independence. Therefore, this paper proposes a parallel Java code generation scheme … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Then, each worker-thread binding to a core starts to execute a macrotask in Fork/Join framework with work-stealing. In code generation of the task-driven execution, the first phase detects the inter-macrotask parallelism according to the layer-unified coarse grain parallelization [6], [7], which defines macrotasks hierarchically, analyzes the earliest executable conditions in Table 1 and represents them as a macro-task-graph (MTG) [6], [10]. The second phase generates the task-driven parallel code that can execute the macrotasks on multicores in a dynamic scheduling manner.…”
Section: Concept Of Task-driven Executionmentioning
confidence: 99%
See 2 more Smart Citations
“…Then, each worker-thread binding to a core starts to execute a macrotask in Fork/Join framework with work-stealing. In code generation of the task-driven execution, the first phase detects the inter-macrotask parallelism according to the layer-unified coarse grain parallelization [6], [7], which defines macrotasks hierarchically, analyzes the earliest executable conditions in Table 1 and represents them as a macro-task-graph (MTG) [6], [10]. The second phase generates the task-driven parallel code that can execute the macrotasks on multicores in a dynamic scheduling manner.…”
Section: Concept Of Task-driven Executionmentioning
confidence: 99%
“…On the other hand, the parallel code generation scheme for the layer-unified coarse grain parallelization has been proposed [7]. This scheme can generate a parallel Java code with the original scheduler implemented by Runnable interface, but the generated parallel code does not adopt the task-driven execution style and can not cope with Java Fork/Join framework.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation