
Parallel Computing Using the Prefix Problem
Oxford University Press Inc
Published on 8. September 1994
Book
Hardback
320 pages
978-0-19-508849-6 (ISBN)
Description
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.
Students, lecturers, and programmers will want to read this clear exposition of an important approach.
Reviews / Votes
This book comprehensively surveys parallel prefix algorithms for shared memory and circuit models. It is probably the only book available in the literature for such a detailed treatment of the subject. For the research student there are a good number of exercises at the end of each chapter; the algorithms are also presented in a form that can be easily implemented. The notation, too, is very readable. * Rajesh K. Mansharamani, Tata Research Development and Design Centre, Pune, India, The Computer Journal, Vol. 38, No. 3, 1995 *More details
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Illustrations
line figures
Dimensions
Height: 235 mm
Width: 157 mm
Thickness: 23 mm
Weight
666 gr
ISBN-13
978-0-19-508849-6 (9780195088496)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

S. Lakshmivarahan | Sudarshan K. Dhall
Parallel Computing Using the Prefix Problem
E-Book
07/1994
1st Edition
OUP eBook
€45.99
Available for download
Persons
Author
Professor of Computer ScienceProfessor of Computer Science, University of Oklahoma
Professor of Computer ScienceProfessor of Computer Science, University of Oklahoma
Content
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
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