Interconnection Networks and Mapping and Scheduling Parallel Computations: Dimacs Workshop, February 7-9, 1994 (Dimacs Series in Discrete Mathematic)

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.Arnold L. Rosenberg is the author of 'Interconnection Networks and Mapping and Scheduling Parallel Computations: Dimacs Workshop, February 7-9, 1994 (Dimacs Series in Discrete Mathematic)' with ISBN 9780821802380 and ISBN 0821802380.