Limits to Parallel Computation - Greenlaw, Raymond; Hoover, H. J.; Ruzzo, Walter L.
426,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
213 °P sammeln
  • Gebundenes Buch

This book focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. If a computer scientist or researcher has a problem that seems to be difficult to parallelize, the first place to look will be the list of problems in this book. It will contain nearly all the current definitions and results in the area - something that is currently scattered throughout the computer science literature.
This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
This book focuses on one important topic of parallel computation: the complexity of problems that appear to be difficult to parallelize. If a computer scientist or researcher has a problem that seems to be difficult to parallelize, the first place to look will be the list of problems in this book. It will contain nearly all the current definitions and results in the area - something that is currently scattered throughout the computer science literature.
This volume provides an ideal introduction to key topics in parallel computing.
With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an
interest in the super computers of the future.
Rezensionen
an excellent reference manual. ... All the chapters are well written, and the extensive bibliography is useful. The authors have been extremely thorough and careful. ... the theory of P-completeness gives us important insights into the nature of the limits of parallel computation, and Greenlaw, Hoover, and Ruzzo have written an excellent reference work. I recommend it highly. Eric Allender, Computing Reviews, July 1996.