Parallel computing using the prefix problem /
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
New York :
Oxford University Press,
1994.
|
| Subjects: | |
| Online Access: | Publisher description Table of contents only |
Table of Contents:
- Ch. 1. The Prefix Problem And Its Applications
- Ch. 2. Parallel Machines And Models - An Overview
- Ch. 3. Parallel Prefix Algorithms On Arrays
- Ch. 4. Parallel Prefix Algorithms On Linked Lists
- Ch. 5. Parallel Prefix Circuits
- Ch. 6. Size Vs. Depth Trade-Off In Parallel Prefix Circuits
- Ch. 7. Bounding Fan-Out In Parallel Prefix Circuits
- Ch. 8. Constant Depth Prefix Circuits With Unbounded Fan-in
- Appendix A - Semigroups and Monoids
- Appendix B - Group-free Semigroups, Star-free Regular Expressions, and Unbounded Fan-in Circuits
- Appendix C - Boolean Circuits for Computing Parity.