An Empirical Comparison of Networks and Routing Strategies for Parallel Computation

Ronald I. Greenberg; Lee Guan

doi:n/a

An Empirical Comparison of Networks and Routing Strategies for Parallel Computation

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	Computer Science: Faculty Publications and Other Works
DOIs	https://doi.org/n/a
State	Published - Oct 1 1996

Keywords

empirical comparison
parallel computation
routing strategy
appropriate cost
worst-case result
network
communication capability
gener-purpose parallel computing

Disciplines

Computer and Systems Architecture
Computer Sciences

Access to Document

n/aLicense: Unspecified

An Empirical Comparison of Networks and Routing Strategies for PaFinal published version, 317 KBLicense: Unspecified

Cite this

@article{7de88ebb02c240bdbbda05be176c03fe,

title = "An Empirical Comparison of Networks and Routing Strategies for Parallel Computation",

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.",

keywords = "empirical comparison, parallel computation, routing strategy, appropriate cost, worst-case result, network, communication capability, gener-purpose parallel computing",

author = "Greenberg, {Ronald I.} and Lee Guan",

note = "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.",

year = "1996",

month = oct,

day = "1",

doi = "n/a",

language = "American English",

journal = "Computer Science: Faculty Publications and Other Works",

}

TY - JOUR

T1 - An Empirical Comparison of Networks and Routing Strategies for Parallel Computation

AU - Greenberg, Ronald I.

AU - Guan, Lee

N1 - 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.

PY - 1996/10/1

Y1 - 1996/10/1

N2 - 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.

AB - 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.

KW - empirical comparison

KW - parallel computation

KW - routing strategy

KW - appropriate cost

KW - worst-case result

KW - network

KW - communication capability

KW - gener-purpose parallel computing

UR - https://ecommons.luc.edu/cs_facpubs/154

U2 - n/a

DO - n/a

M3 - Article

JO - Computer Science: Faculty Publications and Other Works

JF - Computer Science: Faculty Publications and Other Works

ER -

An Empirical Comparison of Networks and Routing Strategies for Parallel Computation

Abstract

Keywords

Disciplines

Access to Document

Other files and links

Cite this