Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Nonuniform traffic spots (NUTS) in multistage interconnection networks
Journal of Parallel and Distributed Computing
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Performance of multicomputer networks under Pin-out constraints
Journal of Parallel and Distributed Computing
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
Destination Tag Routing Techniques Based on a State Model for the IADM Network
IEEE Transactions on Computers
Using a Multipath Network for Reducing the Effects of Hot Spots
IEEE Transactions on Parallel and Distributed Systems
The SP2 high-performance switch
IBM Systems Journal
Multiphase Complete Exchange on Paragon, SP2, and CS-2
IEEE Parallel & Distributed Technology: Systems & Technology
A Generalized Scheme for Mapping Parallel Algorithms
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Collective Value of QoS: A Performance Measure Framework for Distributed Heterogeneous Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Hardware for multiconnected networks: the design flow
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
A universal performance factor for multi-criteria evaluation of multistage interconnection networks
Future Generation Computer Systems - Systems performance analysis and evaluation
Information Processing Letters
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
Hi-index | 0.00 |
Designing a parallel machine would be much easier if one inter-connection network were "best" for all applications and all operating environments (including hardware, software, and financial factors). Unfortunately, no such network exists. Furthermore, even for a fixed application domain and a fixed operating environment, selecting the best network may be difficult because many cost and performance metrics could be used. Suppose someone asked you to select the best animal. What features would you use to compare, say, an alligator and an armadillo? In some ways, the two are very similar: both have four legs, a rugged exterior, and sharp claws. However, in other ways the two are very different: one prefers a marshy environment, the other dry land; one has a long tail, the other a short tail; one is a reptile, the other a mammal. Which of the two, then, is a better animal and what makes it better? These questions apply to interconnection networks as well. Suppose you are comparing the average message delay, for a given set of traffic conditions, for a hypercube network and a mesh network. do you incorporate that hypercube networks may require more complex hardware? Should the total path width of all the links the networks employ be the same? Or should the two networks require the same number of transistors per switch? This article explores the problems of determining which metrics or weighted set of metrics designers should use to compare networks and how they should apply these metrics to yield meaningful information. The authors also look at problems in conducting fair and scientific evaluations.