Overview
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, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.
Full Product Details
Author: S. Lakshmivarahan (Professor of Computer Science, Professor of Computer Science, University of Oklahoma) ,
Sudarshan K. Dhall (Professor of Computer Science, Professor of Computer Science, University of Oklahoma)
Publisher: Oxford University Press Inc
Imprint: Oxford University Press Inc
Dimensions:
Width: 22.90cm
, Height: 2.20cm
, Length: 15.20cm
Weight: 0.603kg
ISBN: 9780195088496
ISBN 10: 0195088492
Pages: 320
Publication Date: 08 September 1994
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Hardback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
Reviews
<br> The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design. --MathematicalReviews<p><br>
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
The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design. --Mathematical Reviews<br>
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 *
<br> The book is well organized and the exposition is self-contained. Furthermore, there are many interesting exercises at the end of each chapter. The reviewer recommends this book for use in a graduate class on parallel algorithm design and for researchers in parallel algorithm design. --Mathematical Reviews<br>
