A Conflict-Free Routing Scheme on Multistage Interconnection Networks

Woei Lin, Tsang Ling Sheu, Chita R. Das, Tseyun Feng, Chuan Lin Wu

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log4 M) parallel steps, where M is the network size. We also consider contraction and stretch of the quadtree structure, while retaining its conflict-free property. Contracted and stretched tree structures allow us to adaptively balance off computation and communication requirements for various parallel algorithms.

Original languageEnglish (US)
Pages (from-to)1086-1097
Number of pages12
JournalIEEE Transactions on Computers
Volume38
Issue number8
DOIs
StatePublished - Aug 1989

Fingerprint

Multistage Interconnection Networks
Quadtree
Routing
Communication
Parallel algorithms
Parallel Algorithms
Parallel and Distributed Computing
Requirements
Distributed computer systems
Parallel processing systems
Tree Structure
Stretch
Merging
Contraction
Conflict
Class

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Lin, Woei ; Sheu, Tsang Ling ; Das, Chita R. ; Feng, Tseyun ; Wu, Chuan Lin. / A Conflict-Free Routing Scheme on Multistage Interconnection Networks. In: IEEE Transactions on Computers. 1989 ; Vol. 38, No. 8. pp. 1086-1097.
@article{47c3d9434e944b299c09ed5f5369f799,
title = "A Conflict-Free Routing Scheme on Multistage Interconnection Networks",
abstract = "In this paper, we present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log4 M) parallel steps, where M is the network size. We also consider contraction and stretch of the quadtree structure, while retaining its conflict-free property. Contracted and stretched tree structures allow us to adaptively balance off computation and communication requirements for various parallel algorithms.",
author = "Woei Lin and Sheu, {Tsang Ling} and Das, {Chita R.} and Tseyun Feng and Wu, {Chuan Lin}",
year = "1989",
month = "8",
doi = "10.1109/12.30864",
language = "English (US)",
volume = "38",
pages = "1086--1097",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "8",

}

A Conflict-Free Routing Scheme on Multistage Interconnection Networks. / Lin, Woei; Sheu, Tsang Ling; Das, Chita R.; Feng, Tseyun; Wu, Chuan Lin.

In: IEEE Transactions on Computers, Vol. 38, No. 8, 08.1989, p. 1086-1097.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Conflict-Free Routing Scheme on Multistage Interconnection Networks

AU - Lin, Woei

AU - Sheu, Tsang Ling

AU - Das, Chita R.

AU - Feng, Tseyun

AU - Wu, Chuan Lin

PY - 1989/8

Y1 - 1989/8

N2 - In this paper, we present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log4 M) parallel steps, where M is the network size. We also consider contraction and stretch of the quadtree structure, while retaining its conflict-free property. Contracted and stretched tree structures allow us to adaptively balance off computation and communication requirements for various parallel algorithms.

AB - In this paper, we present a conflict-free routing scheme for a class of parallel and distributed computing systems. The core of the proposed routing scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log4 M) parallel steps, where M is the network size. We also consider contraction and stretch of the quadtree structure, while retaining its conflict-free property. Contracted and stretched tree structures allow us to adaptively balance off computation and communication requirements for various parallel algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0024716084&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024716084&partnerID=8YFLogxK

U2 - 10.1109/12.30864

DO - 10.1109/12.30864

M3 - Article

AN - SCOPUS:0024716084

VL - 38

SP - 1086

EP - 1097

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 8

ER -