This book is approapriate for undergraduate courses in parallel processing and parallel computing, offered in Computer Science or Computer Engineering departments. Prerequisites include computer architecture and analysis of algorithms. This book familiarizes readers with classical results in the theory of parallel computing and explains reasons behind the growth of parallel computing, as well as obstacles that limit the effectiveness of parallelism. The text also discusses problems encountered when implementing parallel algorithms on real parallel computers, developing eight practical algorithm design strategies. Chapters on parallel algorithms are organized according to problem domain and separate chapters discuss matrix multiplications, the fast Fourier transform, solving systems of linear equations and combinatorial algorithms.
Sprache
Verlagsort
Verlagsgruppe
McGraw-Hill Education - Europe
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Maße
Höhe: 230 mm
Breite: 187 mm
Gewicht
ISBN-13
978-0-07-113800-0 (9780071138000)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
PRAM algorithms; processor arrays, multiprocessors and multicomputers; parallel programming languages; mapping and scheduling; elementary parallel algorithms; matrix multiplication; the fast Fourier transform; solving linear systems; sorting; dictionary operations; graph algorithms; combinational search. Appendices: graph theoretic terminology; review of complex numbers; parallel algorithm design strategies.
