Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.
Daniel SpoonhowerGuy E. BlellochPhillip B. GibbonsRobert HarperPublished in: SPAA (2009)
Keyphrases
- tight bounds
- shared memory
- upper bound
- parallel processing
- data parallelism
- parallel execution
- parallel computation
- massively parallel
- distributed memory
- parallel algorithm
- parallel computing
- level parallelism
- parallel computers
- parallel architecture
- message passing
- lower bound
- computational power
- parallel programming
- parallel architectures
- coarse grain
- multi core systems
- parallel implementation
- processing elements
- response time
- data structure
- neural network
- hierarchical structure
- orders of magnitude
- multi core processors
- combinatorial search
- general purpose
- message passing interface
- database systems
- multicore processors