David A. Bader
IEEE Fellow
AAAS Fellow
Professor
College of Computing
Georgia Tech
Atlanta, GA 30332


 
 

 

Broadcast on Clusters of SMPs with Optimal Concurrency

In this paper, we present a hierarchical method for broadcast on clusters of symmetric multiprocessors (CSMPs) connected by switches with one-port model. We focus on the inter-switch broadcast that forms the core part of a broadcast on CSMPs. The proposed broadcast method is based on single-source shortest path minimum-cost spanning tree (SSS-MST). Two heuristic algorithms, from-up-to-down and from-down-to-up, are proposed to achieve the maximum concurrency using the information of the underlying network topology and the costs of links. Performance evaluation is also conducted to show the superiority of the proposed methods.

Publication History

Versions of this paper appeared as:
  1. Y. Sun and D.A. Bader ``Broadcast on Clusters of SMPs with Optimal Concurrency,'' AHPCC Technical Report 2000-013, University of New Mexico, Albuquerque, NM, June 2000.
  2. Y. Sun, D.A. Bader, X. Lin, and Y. Ling, ``Broadcast on Clusters of SMPs with Optimal Concurrency,'' The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02), Las Vegas, NV, June 2002.

Download this report in Adobe PDF


 
 

Last updated: July 25, 2004

 




Computational Biology



Parallel Computing



Combinatorics