Menu
According to Wikipedia, an "embarrassingly parallel" problem is one for which little or no effort is required to separate the problem into a number of parallel tasks. Raytracing is often cited as an example because each ray can, in principle, be processed in parallel.
Obviously, some problems are much harder to parallelize. Some may even be impossible. I'm wondering what terms are used and what the standard examples are for these harder cases.
Can I propose "Annoyingly Sequential" as a possible name?
612
In parallel computing, an embarrassingly parallel workload or problem (also called embarrassingly parallelizable, perfectly parallel, delightfully parallel or pleasingly parallel) is one where little or no effort is needed to separate the problem into a number of parallel tasks.
The simplest parallel algorithm to compute multiple 1D FFTs is “embarrassingly parallel”; the set of M 1D FFTs (of length N each) can simply be evenly divided among the p processors, and each processor simply applies an appropriate sequential algorithm to compute its share of ⌈M/p⌉ 1D FFTs.
In parallel computing, an embarrassingly parallel workload, or embarrassingly parallel problem, is one for which little or no effort is required to separate the problem into a number of parallel tasks. This is often the case where there exists no dependency between those parallel tasks.
Luckily, ray tracing is an embarrassingly parallel computation. All computations work on the same set of inputs – a ray and the scene description. The scene description is a static input – it stays fixed throughout the computation – and the rays are generated as the program runs.
Inherently sequential.
Example: The number of women will not reduce the length of pregnancy.
85
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
