Synopsis
Explore how randomness speeds up parallel computing with practical algorithms and clear results.
This book surveys randomized parallel algorithms that push toward ideal speed-ups. It frames the gap between deterministic methods and what randomness can achieve, using concrete problems and running times to illustrate the ideas. You’ll see how parallel time, processor count, and probability interact to yield fast, scalable solutions.
- Learn about the list-ranking problem and how randomization changes the efficiency landscape.
- See comparisons between EREW and CRCW PRAM models and how they affect algorithm design.
- Discover several algorithms that achieve near-optimal speed-up with rigorous probabilistic guarantees.
- Understand how randomized techniques can serve as a design tool in parallel computation.
"synopsis" may belong to another edition of this title.
