Parallel computing : theory and practice

Author(s)

• Quinn, Michael J. (Michael Jay)

Bibliographic Information

Parallel computing : theory and practice

Michael J. Quinn

（McGraw-Hill computer science series, Networks, parallel and distributed computing）

McGraw-Hill, c1994

2nd ed

• : pbk

Note

Rev. ed. of: Designing efficient algorithms for parallel computers. c1987

Bibliography: p. 391-433

Includes index

"McGraw-Hill international edition" -- cover

Description and Table of Contents

Volume

ISBN 9780070512948

Description

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.

Table of Contents

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

Volume

: pbk ISBN 9780071138000

Description

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.

Table of Contents

• 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.

by "Nielsen BookData"

Details

• NCID: BA21441132
• ISBN:
  • 0070512949
  • 0071138005
• LCCN: 93029813
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: New York ; Tokyo
• Pages/Volumes: xvii, 446 p.
• Size: 25 cm
• Classification:
  • LCC : QA76.5
  • DC20 : 004/.35
• Subject Headings:
  • LCSH : Parallel computers
• Parent Bibliography ID:
  • BA00039928