Synopsis
A close look at parallel searching in On Parallel Searching reveals how speedups are won and lost.
This work analyzes how many processors are needed to speed up a search on large data sets, and where coordination overhead offsets gains from parallelism. It introduces concrete models of parallel machines and explains how memory access rules affect what can be computed in parallel. The material ties these ideas to range and search problems, showing that some setups resist speedups while others can achieve practical gains.
- Learn how different memory models (EREW, CREW, CRCW) limit or enable parallel search.
- See how a PTBM (Parallel Test and Branch Machine) is defined and used to study concurrent computation.
- Discover why certain lower bounds arise for search and range queries in parallel settings.
- Explore how generalized comparisons can change the leverage of parallel processing.
Ideal for readers of theoretical computer science and researchers curious about parallel algorithms, memory models, and computational limits.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour On Parallel Searching (Classic Reprint)
Image fournie par le vendeur
On Parallel Searching (Classic Reprint)
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book examines the potential and limitations of shared memory parallel computers for searching large data sets using only comparison-based algorithms. The author argues that while these computers can offer significant advantages over traditional serial computers, certain inherent limitations prevent them from achieving truly linear speedups. The book develops lower bounds on the time complexity of parallel searching algorithms, demonstrating that shared memory parallel computers with a fixed number of processors cannot achieve a speedup greater than a constant factor. The author also analyzes the impact of using more powerful comparison operators, such as polynomial comparisons, and shows that while these operators can improve the performance of parallel searching algorithms, they do not fundamentally change the overall complexity. Through these insights, this book provides a deeper understanding of the capabilities and limitations of shared memory parallel computers for searching problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781332092222_0
Acheter neuf
EUR 15,23
Livraison gratuite
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
On Parallel Searching Classic Reprint
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332092222
Acheter neuf
EUR 21,63
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 15 disponible(s)
Image d'archives
On Parallel Searching Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332092222
Acheter neuf
EUR 20,62
Expédition à EUR 3,80
Expédition depuis Royaume-Uni vers Etats-Unis
Expédition depuis Royaume-Uni vers Etats-Unis
Quantité disponible : 15 disponible(s)