Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation 2012
DOI: 10.1145/2254064.2254122
|View full text |Cite
|
Sign up to set email alerts
|

Effective parallelization of loops in the presence of I/O operations

Abstract: Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors. However, none of the previous efforts deal with efficient parallelization of hybrid loops, i.e., loops that contain a mix of computation and I/O operations. In this paper, we propose a set of techniques for efficiently parallelizing hybrid loops. Our techniques apply DOALL parallelism to hybrid loops by breaking the cross-iteration … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…Directives were similar to OpenMP's [Dagum and Menon 1998], so sequential programs only needed a few additional directives: A directive to suggest what kind of parallelism would be used, and another to mark where commit operations had to take place. [Feng et al 2012a] extended SpiceC with some additional directives to support I/O operations within parallel loops. To the best of our knowledge, this was the first approach that addressed the parallelization of this kind of codes through TLS.…”
Section: 22mentioning
confidence: 99%
“…Directives were similar to OpenMP's [Dagum and Menon 1998], so sequential programs only needed a few additional directives: A directive to suggest what kind of parallelism would be used, and another to mark where commit operations had to take place. [Feng et al 2012a] extended SpiceC with some additional directives to support I/O operations within parallel loops. To the best of our knowledge, this was the first approach that addressed the parallelization of this kind of codes through TLS.…”
Section: 22mentioning
confidence: 99%
“…Feng et al [92] in their approach centred on adapt I/O operations to TLS approaches, used the GSS algorithm described in the previous section. Tian et al [241], in their Copy-or-Discard approach, addressed scheduling by unrolling loops to reduce dependences.…”
Section: Scheduling Iterations Under Tlsmentioning
confidence: 99%