Processor Networks and Aspects of the Mapping Problem
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.
Product details
April 2012Paperback
9781107404175
144 pages
244 × 170 × 8 mm
0.24kg
Available
Table 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.