Interconnection Networks and Mapping and Scheduling Parallel Computations (Series in Discrete Mathematics & Theoretical Computer Science No. 21)
By: Arnold L. Rosenberg (editor), Dominique Sotteau (editor), D.Frank Hsu (editor)Hardback
1 - 2 weeks availability
The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processors so that the necessary inputs for a process are available where and when the process is scheduled to be computed.This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation, held in February 1994. The workshop brought together researchers from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future, the book includes topics such as network topologies, network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling.
Ranking algorithms for Hamiltonian paths in hypercubic networks by F. S. Annexstein Dense bus networks of diameter $2$ by J.-C. Bermond, J. Bond, and S. Djelloul On broadcasting schemes in restricted optical passive star systems by P. Berthome and A. Ferreira Restricted routing and wide diameter of the cycle prefix network by W. Y. C. Chen, V. Faber, and E. Knill Permutation routing via Cayley graphs with an example for bus interconnection networks by G. Cooperman and L. Finkelstein Using helpful sets to improve graph bisections by R. Diekmann, B. Monien, and R. Preis Modification of consecutive-$d$ digraphs by D.-Z. Du, D. F. Hsu, and D. J. Kleitman Highly adaptive wormhole routing algorithms for $N$-dimensional torus by J. Duato and P. Lopez Conflict-free access to constant-perimeter rectangular subarrays by D. G. Erickson and C. J. Colboum Makespan minimization of task graphs with random task running times by L. Finta and Z. Liu Scheduling of structured and unstructured computation by A. Gerasoulis, J. Jiao, and T. Yang Routing in optical networks: The problem of contention by L. A. Goldberg Communications in optically interconnected parallel computer systems by M. Hamdi Fault-tolerant Kautz networks by R. Harbane Asynchronous packet routers by C. Jesshope and I. Nedelchev Cayley digraphs of finite cyclic groups with minimal average distance by X. Jia Shuffled tree based fault-tolerant hierarchical interconnection networks by O. H. Karam and D. P. Agrawal Restricted connectivity and restricted fault diameter of some interconnection networks by L. Qiao and Z. Yi Sorting and selection on interconnection networks by S. Rajasekaran Towards a simple construction method for Hamiltonian decomposition of the hypercube by S. W. Song Generalized reduced hypercube interconnection networks for massively parallel computers by S. G. Ziavras.
Number Of Pages:
- ID: 9780821802380
- Saver Delivery: Yes
- 1st Class Delivery: Yes
- Courier Delivery: Yes
- Store Delivery: Yes
Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly
© Copyright 2013 - 2016 WHSmith and its suppliers.
WHSmith High Street Limited Greenbridge Road, Swindon, Wiltshire, United Kingdom, SN3 3LD, VAT GB238 5548 36