Paperback. Condizione: 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. Codice articolo 9781332092222_0

Contatta il venditore

Compra nuovo

EUR 14,47

Convertire valuta

Spese di spedizione: EUR 11,89

Da: Regno Unito a: Italia

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Articoli correlati a On Parallel Searching (Classic Reprint)

On Parallel Searching (Classic Reprint) - Brossura

Snir, Marc

Compra nuovo

Altre edizioni note dello stesso titolo

Edizione in evidenza

Risultati della ricerca per On Parallel Searching (Classic Reprint)