Order Total (1 Item Items):
Shipping Destination:
Parallel Searching by Marc Snir (5 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (5)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
- All Conditions
- New (5)
- Used (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (1)
- Not Print on Demand (4)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
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.
-
£ 16.58
Convert currencyFree shipping from U.S.A. to United KingdomQuantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
On Parallel Searching Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
£ 21.41
Convert currencyFree shipping from U.S.A. to United KingdomQuantity: 15 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
£ 13.35
Convert currencyFree shipping within United KingdomQuantity: Over 20 available
Add to basketPaperback. 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.
