Augmented binary hypercube: A new architecture for processor management

被引:0
作者
Lalgudi, H [1 ]
Akyildiz, IF [1 ]
Yalamanchili, S [1 ]
机构
[1] GEORGIA INST TECHNOL,SCH ELECT & COMP ENGN,ATLANTA,GA 30332
关键词
augmented binary hypercube; update algorithms; ideal mapping; resource management traffic;
D O I
10.1109/12.536241
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Augmented Binary Hypercube (AH) architecture consists of the binary hypercube processor nodes (PNs) and a hierarchy of management nodes (MNs). Several distributed algorithms maintain subcube information at the MNs to realize fault tolerant, fragmentation free processor allocation and load balancing. For efficient implementation of AH, we map MNs onto PNs, define and prove infeasibility of ideal mappings. We propose easily implementable nonoptimal mappings, having negligible overheads on performance. Extensive simulation studies and performance analysis conclude that these algorithms realize significantly better average job completion time and higher processor utilization, as compared to the best sequential allocation schemes and parallel implementation of Free List [7]. AH algorithms can be tuned or adapt to the job and system characteristics, and resource management traffic.
引用
收藏
页码:980 / 984
页数:5
相关论文
共 11 条
[1]   HIERARCHICAL SCHEDULING OF DYNAMIC PARALLEL COMPUTATIONS ON HYPERCUBE MULTICOMPUTERS [J].
AHMAD, I ;
GHAFOOR, A ;
FOX, GC .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 20 (03) :317-329
[2]   PROCESSOR ALLOCATION IN AN N-CUBE MULTIPROCESSOR USING GRAY CODES [J].
CHEN, MS ;
SHIN, KG .
IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (12) :1396-1407
[3]   A FAST RECOGNITION-COMPLETE PROCESSOR ALLOCATION STRATEGY FOR HYPERCUBE COMPUTERS [J].
CHUANG, PJ ;
TZENG, NF .
IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (04) :467-479
[4]   VIRTUAL-CHANNEL FLOW-CONTROL [J].
DALLY, WJ .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (02) :194-205
[5]   SUBCUBE ALLOCATION IN HYPERCUBE COMPUTERS [J].
DUTT, S ;
HAYES, JP .
IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (03) :341-352
[6]  
GAUGHAN P, 1993, COMPUTER MAY, P12
[7]  
KIM J, 1989, P 1989 INT C PAR PRO, V2, P231
[8]  
Krumme DW, 1986, P HYP MULT 1986 PA S, P148
[9]  
LALGUDI HKB, 1909, TRGITCSRL9303, P27
[10]  
SHARMA DD, 1993, P INT C PAR PROC, P118