Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,812 papers from all fields of science
Search
Sign In
Create Free Account
Parallel algorithm
Known as:
Inherently serial problem
, Parallel
, Parallel algorithms
In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can be executed a piece at a time on…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Analysis of parallel algorithms
Arnold L. Rosenberg
Biconnected component
Bitonic sorter
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
Carsten Burstedde
,
L. Wilcox
,
O. Ghattas
SIAM Journal on Scientific Computing
2011
Corpus ID: 45940879
We present scalable algorithms for parallel adaptive mesh refinement and coarsening (AMR), partitioning, and 2:1 balancing on…
Expand
Highly Cited
1997
Highly Cited
1997
Parallel Algorithms for Discovery of Association Rules
Mohammed J. Zaki
,
S. Parthasarathy
,
Mitsunori Ogihara
,
Wei Li
Data mining and knowledge discovery
1997
Corpus ID: 10038675
Discovery of association rules is an important data mining task. Several parallel and sequential algorithms have been proposed in…
Expand
Review
1996
Review
1996
Parallel programming with MPI
Peter S. Pacheco
1996
Corpus ID: 5130751
Chapter 1 Introduction Chapter 2 An Overview of Parallel Computing Chapter 3 Greetings! Chapter 4 An Application: Numerical…
Expand
Highly Cited
1993
Highly Cited
1993
Fast parallel algorithms for short-range molecular dynamics
S. Plimpton
1993
Corpus ID: 15881414
Abstract Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed…
Expand
Review
1991
Review
1991
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
F. T. Leighton
1991
Corpus ID: 267790161
Preface Acknowledgments Notation 1 Arrays and Trees 1.1 Elementary Sorting and Counting 1.1.1 Sorting on a Linear Array Assessing…
Expand
Highly Cited
1986
Highly Cited
1986
Data parallel algorithms
W. D. Hillis
,
Guy L. Steele
CACM
1986
Corpus ID: 2315965
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the…
Expand
Highly Cited
1985
Highly Cited
1985
A simple parallel algorithm for the maximal independent set problem
M. Luby
Symposium on the Theory of Computing
1985
Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo…
Expand
Highly Cited
1984
Highly Cited
1984
A fast parallel algorithm for thinning digital patterns
T. Y. Zhang
,
C. Suen
CACM
1984
Corpus ID: 39713481
A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south…
Expand
Highly Cited
1981
Highly Cited
1981
Applying parallel computation algorithms in the design of serial algorithms
N. Megiddo
22nd Annual Symposium on Foundations of Computer…
1981
Corpus ID: 2212007
The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even…
Expand
Highly Cited
1973
Highly Cited
1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
P. Kogge
,
H. Stone
IEEE transactions on computers
1973
Corpus ID: 206619926
An mth-order recurrence problem is defined as the computation of the series x<inf>1</inf>, x<inf>2</inf>, ..., X<inf>N</inf…
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