Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles

Dikran S. Meliksetian, C. Y. Roger Chen

Research output: Contribution to journalArticle

23 Scopus citations

Abstract

Communication between processors is one of the most important issues in parallel and distributed systems. In this paper we study the communication aspects of a well known multiprocessor structure, the Cube-Connected Cycles (CCC). Only nonoptimal routing algorithms and bounds on the diameter of restricted subclasses of the CCC have been presented in earlier work. In this paper, we present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, we derive the exact network diameter for the general CCC.

Original languageEnglish (US)
Pages (from-to)1172-1178
Number of pages7
JournalIEEE Transactions on Parallel and Distributed Systems
Volume4
Issue number10
DOIs
StatePublished - Oct 1993

Keywords

  • Cube-connected cycles
  • diameter
  • hypercube
  • multiprocessor
  • routing

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles'. Together they form a unique fingerprint.

  • Cite this