Cargando…
Parallel Computing Using the Prefix Problem.
This is an introduction to those aspects of parallel programming and parallel algorithms that relate to a single topic: the prefix problem. This approach provides intense development of a single computational tool used in many parallel computations, showing and discussing its techniques. The text ma...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Oxford :
Oxford University Press,
1994.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn960164419 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 161112s1994 enk o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d OCLCQ |d STF |d OCLCO |d OCLCF |d OCLCQ |d OCLCO |d HS0 |d OCLCQ |d VLY |d SFB |d OCLCO |d OCLCQ |d OCL |d OCLCO | ||
| 019 | |a 1162211174 |a 1290050914 |a 1300575042 | ||
| 020 | |a 9780195358476 | ||
| 020 | |a 0195358473 | ||
| 020 | |a 1280442972 | ||
| 020 | |a 9781280442971 | ||
| 020 | |a 9786610442973 | ||
| 020 | |a 6610442975 | ||
| 020 | |a 1601299745 | ||
| 020 | |a 9781601299741 | ||
| 020 | |a 0197560547 | ||
| 020 | |a 9780197560549 | ||
| 029 | 1 | |a AU@ |b 000065431012 | |
| 035 | |a (OCoLC)960164419 |z (OCoLC)1162211174 |z (OCoLC)1290050914 |z (OCoLC)1300575042 | ||
| 050 | 4 | |a QA76.642.L357 1994 | |
| 082 | 0 | 4 | |a 005.2 |2 20 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Lakshmivarahan, S. | |
| 245 | 1 | 0 | |a Parallel Computing Using the Prefix Problem. |
| 260 | |a Oxford : |b Oxford University Press, |c 1994. | ||
| 300 | |a 1 online resource (313 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Preface; Acknowledgments; Part One -- Getting Started; Chapter 1 -- The Prefix Problem And Its Applications; 1.1 The Prefix Problem; 1.2 Why Prefix Problem; 1.3 Exercises; 1.4 Notes and References; Chapter 2 -- Parallel Machines And Models -- An Overview; 2.1 The Need for Parallelism; 2.2 A Classification of Parallel Computers; 2.3 Parallel Models; 2.4 Performance Measures; 2.5 A Parallel Complexity Class; 2.6 Brent's Inequality; 2.7 A Simple Lower Bound; 2.8 Exercises; 2.9 Notes and References; Part Two -- Algorithms For Shared Memory Models. | |
| 505 | 8 | |a Chapter 3 -- Parallel Prefix Algorithms On Arrays3.1 Methods of Cyclic Elimination and Reduction; 3.2 Schwartz's Method; 3.3 An Algorithm for Fixed Parallelism; 3.4 A Balanced Binary Tree Algorithm; 3.5 Cole-Vishkin Algorithm; 3.6 A Comparison; 3.7 Exercises; 3.8 Notes and References; Chapter 4 -- Parallel Prefix Algorithms On Linked Lists; 4.1 Basic Pointer-jumping; 4.2 A Strategy for Optimal List Ranking; 4.3 Independent Set via Coloring; 4.4 Cole and Vishkin's Algorithm; 4.5 Independent Set via Randomization; 4.6 Exercises; 4.7 Notes and References; Part Three -- Algorithms For Circuit Models. | |
| 505 | 8 | |a Chapter 5 -- Parallel Prefix Circuits5.1 Serial Circuit; 5.2 A Simple Parallel Prefix Circuit; 5.3 Ladner-Fischer Parallel Prefix Circuits; 5.4 Exercises; 5.5 Notes and References; Chapter 6 -- Size Vs. Depth Trade-Off In Parallel Prefix Circuits; 6.1 A Lower Bound on (Size + Depth); 6.2 A Layered Prefix Circuit CR(N); 6.3 (s, d)-Optimal Design and Snir's Circuit; 6.4 LYD Circuit; 6.5 Exercises; 6.6 Notes and References; Part Four -- Analysis Of Fan-In And Fan-Out In Circuits; Chapter 7 -- Bounding Fan-Out In Parallel Prefix Circuits; 7.1 Methods for Bounding Fan-out. | |
| 505 | 8 | |a 7.2 Prefix Circuits with Bounded Fan-out7.3 Exercises; 7.4 Notes and References; Chapter 8 -- Constant Depth Prefix Circuits With Unbounded Fan-in; 8.1 The Need for Group-Free Semigroups; 8.2 Small Prefix Circuits with Unbounded Fan-in; 8.3 Small Circuits for Binary Addition; 8.4 Small Circuits and Group-Free Semigroups; 8.5 Exercises; 8.6 Notes and References; Appendices; Appendix A -Semigroups and Monoids; A1. Definitions and Properties; A2. A Classification of Semigroups; A3. Notes and References. | |
| 505 | 8 | |a Appendix B -- Group-free Semigroups, Star-free Regular Expressions, and Unbounded Fan-in CircuitsB1. Star-Free Regular Expressions; B2. Relating Star-Free Regular Expression to Group-Free Semigroup; B3. Relating Group-Free Semigroups to Unbounded Fan-in Circuits; B4. Notes and References; Appendix C -- Boolean Circuits for Computing Parity; C1. Definition and Properties of Parity; C2. A Depth-Size Trade-off; C3. A Lower Bound on the Size; C4. Notes and References; References; Index; A; B; C; D; E; F; G; H; I; K; L; M; N; O; P; R; S; T; U; W. | |
| 520 | |a This is an introduction to those aspects of parallel programming and parallel algorithms that relate to a single topic: the prefix problem. This approach provides intense development of a single computational tool used in many parallel computations, showing and discussing its techniques. The text may be used for graduate courses. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 546 | |a English. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Parallel programming (Computer science) | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 6 | |a Programmation parallèle (Informatique) | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Parallel programming (Computer science) |2 fast | |
| 700 | 1 | |a Dhall, Sudarshan K. | |
| 776 | 0 | 8 | |i Print version: |a Lakshmivarahan, S. |t Parallel Computing Using the Prefix Problem. |d Oxford : Oxford University Press, ©1994 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=4701995 |z Texto completo |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL4701995 | ||
| 994 | |a 92 |b IZTAP | ||