Parallel computing using the prefix problem

著者

• Lakshmivarahan, S.
• Dhall, Sudarshan Kumar

書誌事項

Parallel computing using the prefix problem

S. Lakshmivarahan, Sudarshan K. Dhall

Oxford University Press, 1994

注記

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」 より

• NII書誌ID(NCID): BA23260591
• ISBN:
  • 0195088492
• LCCN: 94003070
• 出版国コード: us
• タイトル言語コード: eng
• 出版地: New York
• ページ数/冊数: xvii, 294 p.
• 大きさ: 24 cm
• 分類:
  • LCC : QA76.642
  • DC20 : 005.2
• 件名:
  • LCSH : Parallel programming (Computer science)
  • LCSH : Computer algorithms