Parallel algorithms

著者

    • Casanova, Henri
    • Legrand, Arnaud
    • Robert, Yves

書誌事項

Parallel algorithms

Henri Casanova, Arnaud Legrand, Yves Robert

(Chapman & Hall/CRC numerical analysis and scientific computing)

CRC Press, c2009

大学図書館所蔵 件 / 5

この図書・雑誌をさがす

注記

"A Chapman & Hall book."

Includes bibliographical references (p. 323-332) and index

HTTP:URL=http://www.loc.gov/catdir/toc/fy0805/2008019142.html Information=Table of contents only

内容説明・目次

内容説明

Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms presents a rigorous yet accessible treatment of theoretical models of parallel computation, parallel algorithm design for homogeneous and heterogeneous platforms, complexity and performance analysis, and essential notions of scheduling. The book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades. In the first section of the text, the authors cover two classical theoretical models of parallel computation (PRAMs and sorting networks), describe network models for topology and performance, and define several classical communication primitives. The next part deals with parallel algorithms on ring and grid logical topologies as well as the issue of load balancing on heterogeneous computing platforms. The final section presents basic results and approaches for common scheduling problems that arise when developing parallel algorithms. It also discusses advanced scheduling topics, such as divisible load scheduling and steady-state scheduling. With numerous examples and exercises in each chapter, this text encompasses both the theoretical foundations of parallel algorithms and practical parallel algorithm design.

目次

Preface. Models. Parallel Algorithms. Scheduling. Bibliography. Index.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ