Analytical modeling of task scheduling for Master-Slave Super-Hypercube architecture

被引:0
作者
Amirirpour, Maryam [1 ]
Abachi, Hamid [1 ]
机构
[1] Monash Univ, Dept Elect & Comp Syst Engn, Clayton, Vic 3800, Australia
来源
PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING | 2008年
关键词
D O I
10.1109/SNPD.2008.43
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper highlights the analytical modeling of task scheduling for a subclass of message passing architecture which is categorized as Master-Slave Super-Hypercube (MSSHP) topology. To establish this analytical modeling, its foundation based on Hypercube (HP) and Super-Hypercube architectures is first laid down and it is then expanded to include the MSSHP architecture. In order to highlight the advantages of the proposed modeling scheme, graphical presentations are introduced and compared. This comparison underlines the relationship between the time complexity for the HP and the new version for the MSSHP architecture. The outcome of this study reveals that the completion time for matrix product on the MSSHP is more favorable than Hypercube architecture.
引用
收藏
页码:190 / 194
页数:5
相关论文
共 6 条
[1]  
ABACHI H, 1997, P 12 INT C COMP THEI, P50
[2]  
AMIRIPOUR M, 2008, HIGH PERF COMP SIM C
[3]   MATRIX MULTIPLICATION VIA ARITHMETIC PROGRESSIONS [J].
COPPERSMITH, D ;
WINOGRAD, S .
JOURNAL OF SYMBOLIC COMPUTATION, 1990, 9 (03) :251-280
[4]  
Grama Ananth, 2003, Introduction to Parallel Computing
[5]  
LI K, 2007, IEEE T PARALLEL DIST, V18
[6]   DATA COMMUNICATION IN HYPERCUBES [J].
SAAD, Y ;
SCHULTZ, MH .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 6 (01) :115-135