Muutke küpsiste eelistusi

Parallel Computing Using the Prefix Problem [Kõva köide]

(Professor of Computer Science, University of Oklahoma), (Professor of Computer Science, University of Oklahoma)
  • Formaat: Hardback, 320 pages, kõrgus x laius x paksus: 229x152x22 mm, kaal: 603 g, line figures
  • Ilmumisaeg: 08-Sep-1994
  • Kirjastus: Oxford University Press Inc
  • ISBN-10: 0195088492
  • ISBN-13: 9780195088496
Teised raamatud teemal:
Parallel Computing Using the Prefix Problem
  • Formaat: Hardback, 320 pages, kõrgus x laius x paksus: 229x152x22 mm, kaal: 603 g, line figures
  • Ilmumisaeg: 08-Sep-1994
  • Kirjastus: Oxford University Press Inc
  • ISBN-10: 0195088492
  • ISBN-13: 9780195088496
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9780195088496.html
Märksõnad:
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, teachers, programmers, and computer scientists will want to read this clear exposition of an important approach.

Arvustused

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. * Rajesh K. Mansharamani, Tata Research Development and Design Centre, Pune, India, The Computer Journal, Vol. 38, No. 3, 1995 *

1. The Prefix Problem and Its Applications2. Parallel Machines and Models--An Overview3. Parallel Prefix Algorithms on Arrays4. Parallel Prefix Algorithms on Linked Lists5. Parallel Prefix Circuits6. Size Vs. Depth Trade-Off in Parallel Prefix Circuits7. Methods for Bounding Fan-out8. Constant Depth Prefix Circuits with Unbounded Fan-inAppendices