FAQ

Parallel algorithm

Known as: Inherently serial problem, 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2018
020040019672018

Related topics

Related topics

50 relations
Assignment problemBiconnected componentBulk synchronous parallelCartesian tree
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Parallel algorithm
Parallel computing
Numerical analysis
Distributed computing
Computer science
Load balancing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1997
Highly Cited
1997
Parallel Algorithms for Discovery of Association Rules
Discovery of association rules is an important data mining task. Several parallel and sequential algorithms have been proposed in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Programming Parallel Algorithms
In the past 20 years there has been treftlen-dous progress in developing and analyzing parallel algorithftls. Researchers have… (More)
  • figure 1
  • figure 5
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Efficient Algorithms for Globally Optimal Trajectories
We present serial and parallel algorithms for solving a system of equations that arises from the discretization of the Hamilton… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Fast Parallel Algorithms for Short–Range Molecular Dynamics
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of… (More)
  • figure 3
  • figure 4
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1993
Highly Cited
1993
LogP: Towards a Realistic Model of Parallel Computation
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Data Parallel Algorithms
Parallel computers with tens of thousands of processors are typically programmed in a data parallel style, as opposed to the… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A Fast Parallel Algorithm for the Maximal Independent Set Problem
A parallel algorithm is presented that accepts as input a graph <italic>G</italic> and produces a maximal independent set of… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Applying parallel computation algorithms in the design of serial algorithms
  • Nimrod Megiddo
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
An mnth-order recurrence problem is defined as the compurirst order, all linear mth-order recurrence equations can be cast into… (More)
  • figure 2
  • table I
  • figure 3
  • table II
  • figure 1
Is this relevant?