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.
By:
Peter A. J. Hilbers Imprint: Cambridge University Press Country of Publication: United Kingdom Volume: 2 Dimensions:
Height: 244mm,
Width: 170mm,
Spine: 8mm
Weight: 240g ISBN:9781107404175 ISBN 10: 1107404177 Series:Cambridge International Series on Parallel Computation Pages: 144 Publication Date:19 April 2012 Audience:
Professional and scholarly
,
Undergraduate
Format:Paperback Publisher's Status: Active
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.