Embarrassingly parallel

Known as: Embarrassingly parallel problem, Embarassingly parallel, Embarrallel 
In parallel computing, an embarrassingly parallel workload or problem (also called perfectly parallel or pleasingly parallel) is one where little or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
0204019902017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We introduce an Embarrassingly Parallel Search (EPS) method for solving constraint problems in parallel, and we show that this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2015
2015
We develop a parallel variational inference (VI) procedure for use in data-distributed settings, where each machine only has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Communication costs, resulting from synchronization requirements during learning, can greatly slow down many parallel machine… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
We propose an adaptation of the Embarrassingly Parallel Search (EPS) method for data centers. EPS is a simple but efficient… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2013
2013
We propose the Embarrassingly Parallel Search, a simple and efficient method for solving constraint programming problems in… (More)
Is this relevant?
2010
2010
The Embarrassingly Parallel (EP) is one kernel benchmark of NAS Parallel Benchmarks (NPB) which are a set of programs designed to… (More)
  • figure 2
  • table I
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2010
2010
The Embarrassingly Parallel (EP) is one kernel benchmark of NAS Parallel Benchmarks (NPB). EP generates pairs of Gaussian Random… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2006
2006
We have previously proposed a new technique for the communication-free adaptive refinement of tetrahedral meshes that works for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we report on our experience parallelizing probabilistic roadmap motion planning methods (prms). We show that signi… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?