Logo image
Key Messaging on SOME-Bus clusters
Journal article   Peer reviewed

Key Messaging on SOME-Bus clusters

Ming Zhu, Constantine Katsinis, Wentong Cai and Bu-Sung Lee
Parallel computing, v 30(8), pp 947-971
2004

Abstract

Cluster computing Critical path Priority queue SOME-Bus cluster
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.

Metrics

6 Record Views
3 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Theory & Methods
Logo image