Parallel computation : models and methods

書誌事項

Parallel computation : models and methods

Selim G. Akl

Prentice Hall, c1997

大学図書館所蔵 件 / 8

この図書・雑誌をさがす

注記

Includes bibliographical references (p. 553-599) and index

内容説明・目次

内容説明

Focusing throughout on models of computation and methods of problem solving, this text shows how a parallel algorithm can be designed for a given computational problem to run on a parallel computer, and then how it can be analyzed to determine its goodness. The book covers in detail the main three models of computation used to design parallel algorithms (namely combinational circuits, shared memory machines, and interconnection networks). The algorithms are grouped by method of design (prefix computation, divide and conquer, and pointer based methods) and described for interconnection networks varying from the simplest (linear array) to the most advanced (star). The chapter on parallel synergy shows that the concept of superlinear speedup is mathematically possible, and describes some real-life examples where such speedup can be achieved.

目次

1. Introduction2. Models of Computation3. Combinational Circuits4. Parallel Prefix Computation5. Divide and Conquer6. Pointer-Based Data Structures7. Linear Arrays8. Meshes and Related Models9. Hypercubes and Stars10. Models Using Buses11. Broadcasting with Selective Reduction12. Parallel SynergyBibliographyIndex

「Nielsen BookData」 より

詳細情報

ページトップへ