Parallel Computing Using the Prefix Problem

Parallel Computing Using the Prefix Problem

By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?


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.
show more

Product details

  • Hardback | 312 pages
  • 152.4 x 228.6 x 18mm | 935.58g
  • New York, United States
  • English
  • line figures
  • 0195088492
  • 9780195088496

Review quote

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 *
show more