Skip to main content
Article
An Empirical Comparison of Networks and Routing Strategies for Parallel Computation
Proceedings of the Eighth IASTED International Conference on Parallel and Distributed Computing and Systems
  • Ronald I. Greenberg
  • Lee Guan
Document Type
Article
Publication Date
10-1-1996
Pages
265--269
Abstract

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.

Comments

Readers may also be interested in a related paper http://ecommons.luc.edu/cs_facpubs/155

Creative Commons License
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0
Citation Information
Ronald I. Greenberg and Lee Guan. An empirical comparison of networks and routing strategies for parallel computation. In Proceedings of the Eighth IASTED International Conference on Parallel and Distributed Computing and Systems, pages 265--269, Chicago, October 1996.