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.
"synopsis" may belong to another edition of this title.
Snir is Senior Manager, Scalable Parallel Systems, IBM Research Division.
"About this title" may belong to another edition of this title.
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: Forgotten Books, London, United Kingdom
Paperback. Condition: 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. Seller Inventory # 9781332092222_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332092222
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332092222
Quantity: 15 available