Key Messaging on SOME-Bus clusters

  • Authors:
  • Ming Zhu;Constantine Katsinis;Wentong Cai;Bu-Sung Lee

  • Affiliations:
  • Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104/10104, United States;Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA 19104/10104, United States;School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore

  • Venue:
  • Parallel Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

One implementation of broadcast-based networks is the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus). It is a low-latency, high-bandwidth, fiber-optic network that directly connects each processing node to all other nodes without contention. To better utilize the communication network and reduce the completion time of a parallel application, this paper describes the Key Message (KM) approach on SOME-Bus clusters. The main mechanism of the KM approach is to prioritize messages using KM algorithm. After presenting KM algorithm with SOME-Bus structure which is modeled by a M/D/1 queue, an analytical method is adopted to evaluate its performance. The analysis results show better improvement on communication of a parallel application over the system that does not use the KM approach.