When per-core run times are i.i.d. exponential, the minimum of n run times has mean 1/(nλ), so competitive parallel computing achieves exactly linear speedup.
(1992): Random competition: A simple, but efficient method for parallelizing inference systems, Proceedings of the International Workshop Dagstuhl Castle : 195–209
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A sufficient condition for a linear speedup in competitive parallel computing
When per-core run times are i.i.d. exponential, the minimum of n run times has mean 1/(nλ), so competitive parallel computing achieves exactly linear speedup.