Parallel Computing Using the Prefix Problem
- Publisher's listprice GBP 58.00
-
26 187 Ft (24 940 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 2 619 Ft off)
- Discounted price 23 568 Ft (22 446 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
26 187 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher OUP USA
- Date of Publication 8 September 1994
- ISBN 9780195088496
- Binding Hardback
- No. of pages320 pages
- Size 229x152x22 mm
- Weight 603 g
- Language English
- Illustrations line figures 0
Categories
Short description:
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. This may be used for graduate courses, seminars and topics courses.
MoreLong description:
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, lecturers, and programmers will want to read this clear exposition of an important approach.
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.
