Parallel Computing Using the Prefix Problem

Lakshmivarahan, S., & Dhall, Sudarshan K.

ISBN 10: 0195088492 / ISBN 13: 9780195088496

Editore: Oxford University Press, New York, 1994

Riguardo questo articolo

Full bound navy cloth with gold lettering, 294pp w Index, As New Condition. Codice articolo 3321

Dati bibliografici

Titolo: Parallel Computing Using the Prefix Problem

Casa editrice: Oxford University Press, New York

Data di pubblicazione: 1994

Legatura: Hardcover

Condizione: Fine

Condizione sovraccoperta: No Jacket

Edizione: First Edition

Descrizione articolo

Riassunto:

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.

Recensione:

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)