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.

• 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

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.

• 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

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.

• 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