Here 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.
Table of contents:
Introduction; 1. Distributed computations and processor networks; 2. A new operation on graphs; 3. Homogeneous mappings; 4. Mappings of binary tree computation graphs; 5. Mappings on Torus-connected graphs; 6. Deadlock-free message routing in processor networks; Conclusion.
This monograph is a fundamental treatment of the general case of how to use processors simultaneously, in order to solve a single problem, rather than any specific application.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Table of contents:
Introduction; 1. Distributed computations and processor networks; 2. A new operation on graphs; 3. Homogeneous mappings; 4. Mappings of binary tree computation graphs; 5. Mappings on Torus-connected graphs; 6. Deadlock-free message routing in processor networks; Conclusion.
This monograph is a fundamental treatment of the general case of how to use processors simultaneously, in order to solve a single problem, rather than any specific application.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.