Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,259,171 papers from all fields of science
Search
Sign In
Create Free Account
Automatic parallelization
Known as:
Autoparallelization
, Irregular algorithm
, Parallelizing
Automatic parallelization, also auto parallelization, autoparallelization, or parallelization, the last one of which implies automation when used in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
44 relations
Alias analysis
Aliasing (computing)
Automatic parallelization tool
Automatic vectorization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates
S. Gu
,
E. Holly
,
T. Lillicrap
,
S. Levine
IEEE International Conference on Robotics and…
2016
Corpus ID: 18389147
Reinforcement learning holds the promise of enabling autonomous robots to learn large repertoires of behavioral skills with…
Expand
Highly Cited
2016
Highly Cited
2016
QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding
Dan Alistarh
,
Demjan Grubic
,
Jerry Li
,
Ryota Tomioka
,
M. Vojnović
NIPS
2016
Corpus ID: 1193239
Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to its…
Expand
Highly Cited
2013
Highly Cited
2013
PLUMED 2: New feathers for an old bird
G. A. Tribello
,
M. Bonomi
,
D. Branduardi
,
C. Camilloni
,
G. Bussi
Computer Physics Communications
2013
Corpus ID: 17904052
Highly Cited
2012
Highly Cited
2012
ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading
Sokol Kosta
,
Andrius Aucinas
,
P. Hui
,
R. Mortier
,
Xinwen Zhang
Proceedings IEEE INFOCOM
2012
Corpus ID: 206924850
Smartphones have exploded in popularity in recent years, becoming ever more sophisticated and capable. As a result, developers…
Expand
Highly Cited
2007
Highly Cited
2007
Effective automatic parallelization of stencil computations
S. Krishnamoorthy
,
M. Baskaran
,
Uday Bondhugula
,
J. Ramanujam
,
A. Rountev
,
P. Sadayappan
ACM-SIGPLAN Symposium on Programming Language…
2007
Corpus ID: 900262
Performance optimization of stencil computations has been widely studied in the literature, since they occur in many…
Expand
Highly Cited
2002
Highly Cited
2002
Evolutionary Algorithms for Solving Multi-Objective Problems
C. Coello
,
D. V. Veldhuizen
,
G. Lamont
Genetic Algorithms and Evolutionary Computation
2002
Corpus ID: 36482639
List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test…
Expand
Review
2002
Review
2002
Parallelism and evolutionary algorithms
E. Alba
,
M. Tomassini
IEEE Transactions on Evolutionary Computation
2002
Corpus ID: 18852019
This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is…
Expand
Review
2000
Review
2000
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
J. Roerdink
,
Arnold Meijster
Fundamenta Informaticae
2000
Corpus ID: 6050657
The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a…
Expand
Highly Cited
1997
Highly Cited
1997
LINCS: A linear constraint solver for molecular simulations
B. Hess
,
H. Bekker
,
H. Berendsen
,
J. Fraaije
Journal of Computational Chemistry
1997
Corpus ID: 21320216
In this article, we present a new LINear Constraint Solver (LINCS) for molecular simulations with bond constraints. The algorithm…
Expand
Review
1993
Review
1993
Automatic program parallelization
U. Banerjee
,
R. Eigenmann
,
A. Nicolau
,
D. Padua
Proceedings of the IEEE
1993
Corpus ID: 18607837
An overview of automatic program parallelization techniques is presented. It covers dependence analysis techniques, followed by a…
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