Synopsis
Hook line: Discover how memory width, processor count, and running time shape the limits of parallel computation.
The book examines theoretical models of parallel machines, focusing on how input access, shared memory, and write rules affect performance. It explains new lower-bound techniques and shows how tight bounds emerge for different PRAM variants. The discussion links abstract results to practical ideas about hardware feasibility and scalable parallel design.
Readers will gain a clear view of why certain problems resist fast parallel solutions, and how researchers prove what cannot be done quickly. The material is presented with definitions, proofs, and implications that illuminate both theory and potential real-world impact.
- Definitions of CRCW PRAM and CREW PRAM, including how concurrency and writes are handled
- Lower-bound results that connect input sensitivity to time complexity
- Comparisons of parallel models and what they imply for speedups
- Practical relevance to hardware feasibility and communication as a resource
Ideal for readers of theoretical computer science, parallel computing, and algorithm design seeking a rigorous, accessible treatment of depth-width trade-offs.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Trade-Offs Between Depth and Width in Parallel Computation...
Seller Image
Trade-Offs Between Depth and Width in Parallel Computation (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 delves into the intricate relationship between communication and efficiency in parallel computing, illuminating the profound impact of communication capacity on the performance of computational algorithms. The author, a leading expert in the field, explores the fundamental trade-offs between the depth and width of parallel computation, demonstrating how these factors govern the time required to solve computational problems. By introducing novel techniques to overcome analytical challenges, the author provides groundbreaking insights into the lower bounds for parallel computation models, particularly in the context of concurrent-write and exclusive-write parallel random access machines. These discoveries advance our understanding of the inherent complexity of parallel algorithms and shed light on the optimal resource allocation for efficient computation. 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 # 9781333344283_0
Buy New
US$ 17.09
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
TradeOffs Between Depth and Width in Parallel Computation 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-9781333344283
Stock Image
TradeOffs Between Depth and Width in Parallel Computation 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-9781333344283
Buy New
US$ 23.95
US$ 4.48 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available