Items related to On Parallel Searching (Classic Reprint)
Synopsis
Excerpt from On Parallel Searching
There has been recently an increasing interest in the study of tightly coupled parallel machines. Parallel processors have been around for some time, and with the advance in microelectronics it becomes feasible to build parallel machines with thousands of cooperating processors. One possible organization for such machines is a shared memory architecture: many independent processors with access to a common memory. While the problem of providing shared access to a common memory is significant, such architecture seems suitable for a general purpose computer, where the pattern of memory accesses is not known in advance. Also, it seems feasible to build a shared memory parallel machine with thousands.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
About the Author
Snir is Senior Manager, Scalable Parallel Systems, IBM Research Division.
"About this title" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2020
- ISBN 10 1332092225
- ISBN 13 9781332092222
- BindingPaperback
- LanguageEnglish
- Number of pages47
Buy New
View this item
US$ 15.68
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for On Parallel Searching (Classic Reprint)
Seller Image
On Parallel Searching (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
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
Stock Image
On Parallel Searching Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332092222
Quantity: 15 available
Stock Image
On Parallel Searching Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332092222
Quantity: 15 available