Trade-Offs Between Depth and Width in Parallel Computation (Classic Reprint) - Softcover

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.