Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,178,515 papers from all fields of science
Search
Sign In
Create Free Account
Loop-level parallelism
Known as:
Loop level parallelism
Loop-level parallelism is a form of parallelism in software programming that is concerned with extracting parallel tasks from loops. The opportunity…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Amdahl's law
Control flow
Data parallelism
Distributed memory
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Fine-grain Parallelism Using Multi-core, Cell/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function
F. Pratas
,
Pedro Trancoso
,
A. Stamatakis
,
L. Sousa
International Conference on Parallel Processing
2009
Corpus ID: 6187772
We are currently faced with the situation where applications have increasing computational demands and there is a wide selection…
Expand
Highly Cited
2008
Highly Cited
2008
Uncovering hidden loop level parallelism in sequential applications
Hongtao Zhong
,
M. Mehrara
,
Steven A. Lieberman
,
S. Mahlke
IEEE 14th International Symposium on High…
2008
Corpus ID: 152321
As multicore systems become the dominant mainstream computing technology, one of the most difficult challenges the industry faces…
Expand
2007
2007
Exploiting Loop-Level Parallelism for SIMD Arrays Using OpenMP
Con Bradley
,
Benedict R. Gaster
International Workshop on OpenMP
2007
Corpus ID: 16587226
Programming SIMD arrays in languages such as C or FORTRAN is difficult and although work on automatic parallelizing programs has…
Expand
Highly Cited
2007
Highly Cited
2007
RAxML-Cell: Parallel Phylogenetic Tree Inference on the Cell Broadband Engine
Filip Blagojevic
,
A. Stamatakis
,
C. Antonopoulos
,
Dimitrios S. Nikolopoulos
IEEE International Parallel and Distributed…
2007
Corpus ID: 8145110
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for…
Expand
Highly Cited
2005
Highly Cited
2005
RAxML-OMP: An Efficient Program for Phylogenetic Inference on SMPs
A. Stamatakis
,
Michael Ott
,
T. Ludwig
International Conference on Parallel…
2005
Corpus ID: 280666
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the Maximum Likelihood (ML) method is…
Expand
Highly Cited
2002
Highly Cited
2002
DRESC: a retargetable compiler for coarse-grained reconfigurable architectures
B. Mei
,
S. Vernalde
,
D. Verkest
,
H. Man
,
R. Lauwereins
IEEE International Conference on Field…
2002
Corpus ID: 17776163
Coarse-grained reconfigurable architectures have become increasingly important in recent years. Automatic design or compiling…
Expand
2001
2001
The Scalability of Loop-Level Parallelism
D. Pressel
2001
Corpus ID: 60270312
Abstract : This report deals with the four main constraints on the scalability of programs parallelized using loop-level…
Expand
Highly Cited
2000
Highly Cited
2000
Exploiting superword level parallelism with multimedia instruction sets
S. Larsen
,
Saman P. Amarasinghe
ACM-SIGPLAN Symposium on Programming Language…
2000
Corpus ID: 5164212
Increasing focus on multimedia applications has prompted the additionof multimedia extensions to most existing general purpose…
Expand
1999
1999
The Design of the PROMIS Compiler
H. Saito
,
Nicholas Stavrakos
,
S. Carroll
,
C. Polychronopoulos
,
A. Nicolau
International Conference on Compiler Construction
1999
Corpus ID: 15216550
PROMIS is a multilingual, parallelizing, and retargetable compiler with an integrated frontend and backend operating on a single…
Expand
Highly Cited
1993
Highly Cited
1993
Loop-Level Parallelism in Numeric and Symbolic Programs
J. Larus
IEEE Trans. Parallel Distributed Syst.
1993
Corpus ID: 1051453
A new technique for estimating and understanding the speed improvement that can result from executing a program on a parallel…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE