Parallel computing : theory and practice
著者
書誌事項
Parallel computing : theory and practice
(McGraw-Hill computer science series, Networks,
McGraw-Hill, c1994
2nd ed
- : pbk
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Rev. ed. of: Designing efficient algorithms for parallel computers. c1987
Bibliography: p. 391-433
Includes index
"McGraw-Hill international edition" -- cover
内容説明・目次
- 巻冊次
-
ISBN 9780070512948
内容説明
This text includes introductory material,exercises, more depth of analysis and coverage of the most successful current parallel computers, including the Connection Machine's CM-S and Intel's Paragon XP/S.
目次
1: Introduction2: PRAM Algorithms3: Processor Arrays, Multiprocessors, and Multicomputers4: Parallel Programming Languages5: Mapping and Scheduling 6. Elementary Parallel Algorithms7. Matrix Multiplication8: The Fast Fourier Transform 9: Solving Linear Systems 10: Sorting11: Dictionary Operations12: Graph Algorithms 13: Combinatorial Search
- 巻冊次
-
: pbk ISBN 9780071138000
内容説明
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.
目次
- 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.
「Nielsen BookData」 より