An empirical study of hierarchical division for mesh-structured networks

Research output: Contribution to journalArticle

Abstract

A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.

Original languageEnglish
Pages (from-to)S413-S426
JournalJournal of Computational Methods in Sciences and Engineering
Volume6
Issue number5-6
StatePublished - 1 Jan 2006

Fingerprint

Hypercube networks
Network routing
Distributed computer systems
Empirical Study
Division
Agglomeration
Scheduling
Mesh
Monitoring
Hypercube
System Performance
Resource Scheduling
Data Aggregation
Parallel Systems
Distributed Computing
Traffic Flow
Distributed Systems
Routing
Hierarchy
Scenarios

Keywords

  • Hierarchical architecture
  • hierarchy
  • interconnection networks
  • mesh
  • parallel and distributed systems
  • simulation

Cite this

@article{a4d081bee1d84a62aae0945dab1a39be,
title = "An empirical study of hierarchical division for mesh-structured networks",
abstract = "A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.",
keywords = "Hierarchical architecture, hierarchy, interconnection networks, mesh, parallel and distributed systems, simulation",
author = "Dajin Wang",
year = "2006",
month = "1",
day = "1",
language = "English",
volume = "6",
pages = "S413--S426",
journal = "Journal of Computational Methods in Sciences and Engineering",
issn = "1472-7978",
publisher = "IOS Press",
number = "5-6",

}

An empirical study of hierarchical division for mesh-structured networks. / Wang, Dajin.

In: Journal of Computational Methods in Sciences and Engineering, Vol. 6, No. 5-6, 01.01.2006, p. S413-S426.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An empirical study of hierarchical division for mesh-structured networks

AU - Wang, Dajin

PY - 2006/1/1

Y1 - 2006/1/1

N2 - A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.

AB - A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.

KW - Hierarchical architecture

KW - hierarchy

KW - interconnection networks

KW - mesh

KW - parallel and distributed systems

KW - simulation

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

M3 - Article

AN - SCOPUS:84948701946

VL - 6

SP - S413-S426

JO - Journal of Computational Methods in Sciences and Engineering

JF - Journal of Computational Methods in Sciences and Engineering

SN - 1472-7978

IS - 5-6

ER -