Parallel computing using the prefix problem /
Gorde:
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Liburua |
| Hizkuntza: | English |
| Argitaratua: |
New York :
Oxford University Press,
1994.
|
| Gaiak: | |
| Sarrera elektronikoa: | Publisher description Table of contents only |
Aurkibidea:
- 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.