Parallel computing using the prefix problem
著者
書誌事項
Parallel computing using the prefix problem
Oxford University Press, 1994
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
The prefix operation on a set of data is one of the simplest and most useful building blocks in parallel algorithms. This introduction to those aspects of parallel programming and parallel algorithms that relate to the prefix problem emphasizes its use in a broad range of familiar and important problems. The book illustrates how the prefix operation approach to parallel computing leads to fast and efficient solutions to many different kinds of problems.
Students, lecturers, and programmers will want to read this clear exposition of an important approach.
目次
1: The Prefix Problem and Its Applications
2: Parallel Machines and Models--An Overview
3: Parallel Prefix Algorithms on Arrays
4: Parallel Prefix Algorithms on Linked Lists
5: Parallel Prefix Circuits
6: Size Vs. Depth Trade-Off in Parallel Prefix Circuits
7: Methods for Bounding Fan-out
8: Constant Depth Prefix Circuits with Unbounded Fan-in
Appendices
「Nielsen BookData」 より