Processor Networks and Aspects of the Mapping Problem
Series: Cambridge International Series on Parallel Computation; 2;
- Publisher's listprice GBP 72.00
-
36 439 Ft (34 704 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. 3 644 Ft off)
- Discounted price 32 795 Ft (31 234 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
36 439 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
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 Cambridge University Press
- Date of Publication 21 November 1991
- ISBN 9780521402507
- Binding Hardback
- No. of pages144 pages
- Size 244x170x10 mm
- Weight 430 g
- Language English 0
Categories
Short description:
This 1991 book discusses how to use processors simultaneously in order to solve a single problem rather than any specific application.
MoreLong description:
In this 1991 book, Hilbers discusses the general case of how to use processors simultaneously in order to solve a single problem rather than any specific application, and develops a theory independent of particular architectures. He starts by introducing distributed computing with graph theory, and considers processor networks and their price/performance ratios. He goes on to look at obtaining homogeneous distributions of work over networks and considers examples. Finally he discusses message routing within a processor network. This is intended to be a fundamental treatment of the relevant subjects and is aimed at computer scientists and graduate students in computer science who have experience with parallel processing: it will also be useful to others interested in processor networks.
MoreTable of Contents:
Preface; 1. Introduction; 2. Processor networks; 3. A new operation on graphs; 4. Homogenous mappings; 5. Mappings of binary tree computation graphs; 6. Mappings on torus-connected graphs; 7. Deadlock-free message routing in processor networks; References; Index.
More
