Parallel Computing Using the Prefix Problem

Inbunden, Engelska, 1994

Av S. Lakshmivarahan, Sudarshan K. Dhall, University of Oklahoma) Lakshmivarahan, S. (Professor of Computer Science, Professor of Computer Science, University of Oklahoma) Dhall, Sudarshan K. (Professor of Computer Science, Professor of Computer Science, Sudarshan Kumar Dhall

1 789 kr

Beställningsvara. Skickas inom 3-6 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1994-09-08
Mått152 x 229 x 22 mm
Vikt603 g
FormatInbunden
SpråkEngelska
Antal sidor320
FörlagOUP USA
ISBN9780195088496

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Hårdvara inom Data och it
Nätverk och kommunikation inom Data och it

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.