Cantitate/Preț
Produs

Parallel Computing Using the Prefix Problem

Autor S. Lakshmivarahan, Sudarshan K. Dhall
en Limba Engleză Hardback – 8 sep 1994
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.
Citește tot Restrânge

Preț: 33268 lei

Preț vechi: 53944 lei
-38% Nou

Puncte Express: 499

Preț estimativ în valută:
6366 6606$ 5321£

Carte tipărită la comandă

Livrare economică 04-10 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780195088496
ISBN-10: 0195088492
Pagini: 320
Ilustrații: line figures
Dimensiuni: 229 x 152 x 22 mm
Greutate: 0.6 kg
Editura: Oxford University Press
Colecția OUP USA
Locul publicării:New York, United States

Recenzii

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.