A Two-Phase Scheduling Algorithm for Efficient Collective Communications of MPICH-G2

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 525
  • Download : 453
In this paper, we propose a packet-level parallel data transfer and a Two-Phase Scheduling(TPS) algorithm for collective communication primitives in MPICH-G2. The algorithms are characterized by two unique features: 1) a concurrent data transfer of packets from a source node to multiple destination nodes and 2) a scheduling of enhancing the performance of collective commu- nications by early identification of bottleneck incurring nodes. The proposed technique is implemented and the performance improvement is measured. Ac- cording to the performance evaluation, the proposed method has achieved about 20% performance improvement against conventional block data transfer meth- ods when a binomial tree is used for the communication in LAN. In TPS algo- rithm, the distribution of messages to bottleneck incurring nodes is delayed to minimize the affection of the node to the total performance. Using TPS algo- rithm on WAN, significant performance improvement has also been achieved for various data sizes and number of nodes.
Publisher
Springer Verlag (Germany)
Issue Date
2005-12-09
Citation

Lecture Notes in Computer Science, Vol.3816, pp.217-228

ISBN
978-3-540-30999-4
ISSN
0302-9743
DOI
10.1007/11604655_25
URI
http://hdl.handle.net/10203/18019
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
A Two-Phase Scheduling Algorithm for Efficient.pdf(169.13 kB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0