An error was encountered while trying to add the item to the cart. Please try again.
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Interconnection Networks and Mapping and Scheduling Parallel Computations

Edited by: D. Frank Hsu Fordham University, Bronx, NY
Arnold L. Rosenberg University of Massachusetts, Amherst, MA
Dominique Sotteau University of Paris XI, Orsay, France
A co-publication of the AMS and DIMACS
Available Formats:
Hardcover ISBN: 978-0-8218-0238-0
Product Code: DIMACS/21
List Price: $102.00 MAA Member Price:$91.80
AMS Member Price: $81.60 Electronic ISBN: 978-1-4704-3979-8 Product Code: DIMACS/21.E List Price:$96.00
MAA Member Price: $86.40 AMS Member Price:$76.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $153.00 MAA Member Price:$137.70
AMS Member Price: $122.40 Click above image for expanded view Interconnection Networks and Mapping and Scheduling Parallel Computations Edited by: D. Frank Hsu Fordham University, Bronx, NY Arnold L. Rosenberg University of Massachusetts, Amherst, MA Dominique Sotteau University of Paris XI, Orsay, France A co-publication of the AMS and DIMACS Available Formats:  Hardcover ISBN: 978-0-8218-0238-0 Product Code: DIMACS/21  List Price:$102.00 MAA Member Price: $91.80 AMS Member Price:$81.60
 Electronic ISBN: 978-1-4704-3979-8 Product Code: DIMACS/21.E
 List Price: $96.00 MAA Member Price:$86.40 AMS Member Price: $76.80 Bundle Print and Electronic Formats and Save! This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.  List Price:$153.00 MAA Member Price: $137.70 AMS Member Price:$122.40
• Book Details

DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
Volume: 211995; 342 pp
MSC: Primary 68; 94; Secondary 78;

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.

Computer scientists and research mathematicians.

• Chapters
• Ranking algorithms for Hamiltonian paths in hypercubic networks
• Dense bus networks of diameter 2
• On broadcasting schemes in restricted optical passive star systems
• Restricted routing and wide diameter of the cycle prefix network
• Permutation routing via Cayley graphs with an example for bus interconnection networks
• Using helpful sets to improve graph bisections
• Modification of consecutive-d digraphs
• Highly adaptive wormhole routing algorithms for n-dimensional torus
• Scheduling of structured and unstructured computation
• Routing in optical networks: The problem of contention
• Communications in optically interconnected parallel computer systems
• Fault-tolerant Kautz networks
• Asynchronous packet routers
• Cayley digraphs of finite cyclic groups with minimal average distance
• Shuffled tree based fault-tolerant hierarchical interconnection networks
• Restricted connectivity and restricted fault diameter of some interconnection networks
• Sorting and selection on interconnection networks
• Towards a simple construction method for Hamiltonian decomposition of the hypercube
• Generalized reduced hypercube interconnection networks for massively parallel computers
• List of participants
• Request Review Copy
Volume: 211995; 342 pp
MSC: Primary 68; 94; Secondary 78;

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.

Computer scientists and research mathematicians.

• Chapters
• Ranking algorithms for Hamiltonian paths in hypercubic networks
• Dense bus networks of diameter 2
• On broadcasting schemes in restricted optical passive star systems
• Restricted routing and wide diameter of the cycle prefix network
• Permutation routing via Cayley graphs with an example for bus interconnection networks
• Using helpful sets to improve graph bisections
• Modification of consecutive-d digraphs
• Highly adaptive wormhole routing algorithms for n-dimensional torus