Parallel Computing Using the Prefix Problem

Inbunden, Engelska, 1994

1 133 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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

Utgivningsdatum:1994-09-08
Mått:152 x 229 x 22 mm
Vikt:603 g
Format:Inbunden
Språk:Engelska
Antal sidor:320
Förlag:OUP USA
ISBN:9780195088496

Utforska kategorier

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

Recensioner i media

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.

Innehållsförteckning

1: The Prefix Problem and Its Applications 2: Parallel Machines and Models--An Overview 3: Parallel Prefix Algorithms on Arrays 4: Parallel Prefix Algorithms on Linked Lists 5: Parallel Prefix Circuits 6: Size Vs. Depth Trade-Off in Parallel Prefix Circuits 7: Methods for Bounding Fan-out 8: Constant Depth Prefix Circuits with Unbounded Fan-in Appendices