Scalable loop self-scheduling schemes for heterogeneous clusters

被引:12
作者
Chronopoulos, Anthony T. [1 ]
Penmatsa, Satish [1 ]
Yu, Ning [1 ]
Yu, Du [1 ]
机构
[1] Univ Texas San Antonio, Dept Comp Sci, 6900 N Loop,1604 W, San Antonio, TX 78249 USA
关键词
scalable; distributed; loops; scheduling schemes;
D O I
10.1504/IJCSE.2005.009696
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Heterogeneous cluster systems (e.g., a LAN of computers) can be used for concurrent processing for some applications. However, a serious difficulty in concurrent programming of a heterogeneous system is how to deal with scheduling and load balancing of such a system that may consist of heterogeneous computers. Distributed scheduling schemes suitable for parallel loops with independent iterations on heterogeneous computer clusters have been proposed and analysed in the past. Here, we implement the previous schemes in MPI. We present an extension of these schemes implemented in a hierarchical Master-Slave architecture and include experimental results and comparisons.
引用
收藏
页码:110 / 117
页数:8
相关论文
共 22 条
[1]  
Banicescu I., 2000, Proceedings of the High Performance Computing Symposium - HPC 2000, P122
[2]  
Banicescu I., 2003, CLUSTER COMPUT, V6, P215, DOI DOI 10.1023/A:1023588520138
[3]  
Barbosa J., 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556), P147, DOI 10.1109/HCW.2000.843740
[4]  
Bull JM, 1998, LECT NOTES COMPUT SC, V1470, P377, DOI 10.1007/BFb0057877
[5]  
CHRONOPOULOS AT, 2001, P 3 IEEE INT C CLUST
[6]  
Cierniak M., 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing (Cat. No.95TB8075), P78, DOI 10.1109/HPDC.1995.518697
[7]  
Dandamudi S. P., 1997, P MASCOTS 97 JAN HAI
[8]   A hierarchical processor scheduling policy for distributed-memory multicomputer systems [J].
Dandamudi, SP ;
Thyagaraj, TK .
FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, :218-223
[9]  
Fann YW, 2000, J INF SCI ENG, V16, P169
[10]  
FREEMAN TL, 2000, P 5 INT WORKSH PARA, P149