On Parallel Searching Classic Reprint

Marc Snir

ISBN 10: 1332092225 ISBN 13: 9781332092222

Edit� par Forgotten Books, 2018

Neuf(s) PAP

Vendeur PBShop.store US, Wood Dale, IL, Etats-Unis �valuation du vendeur 5 sur 5 �toiles

Vendeur AbeBooks depuis 7 avril 2005

Cet article sp�cifique n'est plus disponible.

Afficher tous les articles du vendeur Cr�er une demande de livres portant sur des articles similaires

Afficher tous les exemplaires de ce livre

A propos de cet article

New Book. Shipped from UK. Established seller since 2000. N� de r�f. du vendeur LW-9781332092222

Signaler cet article

Synopsis :

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.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

D�tails bibliographiques

Titre : On Parallel Searching Classic Reprint
�diteur : Forgotten Books
Date d'�dition : 2018
Reliure : PAP
Etat : New

Meilleurs r�sultats de recherche sur AbeBooks

Image fournie par le vendeur

Autres images

On Parallel Searching (Classic Reprint)

Marc Snir

Edit� par Forgotten Books, 2018

ISBN 10 : 1332092225 ISBN 13 : 9781332092222

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 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

Contacter le vendeur