Performance modeling of Cartesian product networks

  • Authors:
  • Reza Moraveji;Hamid Sarbazi-Azad;Albert Y. Zomaya

  • Affiliations:
  • School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran and Centre for Distributed and High Performance Computing, School of Information Technologies, The Un ...;Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran;Centre for Distributed and High Performance Computing, School of Information Technologies, The University of Sydney, Sydney, Australia

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a comprehensive performance model for fully adaptive routing in wormhole-switched Cartesian product networks. Besides the generality of the model which makes it suitable to be used for any product graph, experimental (simulation) results show that the proposed model exhibits high accuracy even in heavy traffic and saturation region, where other models have severe problems to predict the performance of the network. Most popular interconnection network can be defined as a Cartesian product of two or more networks including the mesh, hypercube, and torus networks. Torus and mesh networks are the most popular topologies used in recent supercomputing parallel machines. They have been widely used for realizing on-chip network in recent on-chip multicore and multiprocessors system.