Limits to Parallel Computation - P-Completeness Theory

Zusatztext 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. Klappentext With its cogent overview of the essentials of parallel computation as well as lists of P-complete and open problems! extensive remarks corresponding to each problem! and extensive references! this book is the ideal introduction to parallel computing. Zusammenfassung 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.

Product details

• Authors: Raymond Greenlaw, Raymond (Assistant Professor Greenlaw, Raymond Etc. Hoover Greenlaw, Greenlaw Raymond, H. J. Hoover, H. James Hoover, Walter L. Ruzzo, Ruzzo Walter L.
• Publisher: Oxford University Press
• Languages: English
• Product format: Hardback
• Released: 01.06.1995
• EAN: 9780195085914
• ISBN: 978-0-19-508591-4
• No. of pages: 336
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > Data communication, networks; Parallel processing, COMPUTERS / Parallel Processing