Cantitate/Preț
Produs

Processor Networks and Aspects of the Mapping Problem: Cambridge International Series on Parallel Computation, cartea 2

Autor Peter A. J. Hilbers
en Limba Engleză Paperback – 18 apr 2012
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 30763 lei  6-8 săpt.
  Cambridge University Press – 18 apr 2012 30763 lei  6-8 săpt.
Hardback (1) 50306 lei  6-8 săpt.
  Cambridge University Press – 20 noi 1991 50306 lei  6-8 săpt.

Din seria Cambridge International Series on Parallel Computation

Preț: 30763 lei

Preț vechi: 38454 lei
-20% Nou

Puncte Express: 461

Preț estimativ în valută:
5888 6181$ 4864£

Carte tipărită la comandă

Livrare economică 31 ianuarie-14 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781107404175
ISBN-10: 1107404177
Pagini: 144
Dimensiuni: 170 x 244 x 8 mm
Greutate: 0.24 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge International Series on Parallel Computation

Locul publicării:New York, United States

Cuprins

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.

Descriere

This 1991 book discusses how to use processors simultaneously in order to solve a single problem rather than any specific application.