Using knowledge-based techniques on loop parallelization for parallelizing compilers

被引:3
作者
Yang, CT [1 ]
Tseng, SS [1 ]
Chuang, CD [1 ]
Shih, WC [1 ]
机构
[1] NATL CHIAO TUNG UNIV,DEPT COMP & INFORMAT SCI,HSINCHU 300,TAIWAN
关键词
parallelizing compiler; data dependence testing; loop parallelization; parallel loop scheduling; knowledge-based; repertory grid analysis; speedup;
D O I
10.1016/S0167-8191(96)00090-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we propose a knowledge-based approach for solving data dependence testing and loop scheduling problems. A rule-based system, called the K-Test, is developed by repertory grid and attribute ording table to construct the knowledge base. The K-Test chooses an appropriate testing algorithm according to some features of the input program by using knowledge-based techniques, and then applies the resulting test to detect data dependences for loop parallelization. Another rule-based system, called the KPLS, is also proposed to be able to choose an appropriate scheduling by inferring some features of loops and assign parallel loops on multiprocessors for achieving high speedup. The experimental results show that the graceful speedup obtained by our compiler is obvious.
引用
收藏
页码:291 / 309
页数:19
相关论文
共 25 条
[1]   COMPILER TRANSFORMATIONS FOR HIGH-PERFORMANCE COMPUTING [J].
BACON, DF ;
GRAHAM, SL ;
SHARP, OJ .
ACM COMPUTING SURVEYS, 1994, 26 (04) :345-420
[2]   AUTOMATIC PROGRAM PARALLELIZATION [J].
BANERJEE, U ;
EIGENMANN, R ;
NICOLAU, A ;
PADUA, DA .
PROCEEDINGS OF THE IEEE, 1993, 81 (02) :211-243
[3]  
BANERJEE U, 1988, DEPENDENCE ANAL SUPE
[4]  
BLUME W, 1994, CSRD1375 U ILL URB C
[5]  
BOYKIN J, 1993, PROGRAMMING MACH
[6]  
CHAPMAN BM, 1991, P 1 INT ACPC C PAR C, P77
[7]  
Giarratano J., 1993, Expert Systems: Principles and Programming, V2nd ed.
[8]  
GOFF G, 1991, ACM SIGPLAN 91 C PRO, P15
[9]  
HSIAO MC, 1994, P 1994 ICPADS, P333
[10]   FACTORING - A METHOD FOR SCHEDULING PARALLEL LOOPS [J].
HUMMEL, SF ;
SCHONBERG, E ;
FLYNN, LE .
COMMUNICATIONS OF THE ACM, 1992, 35 (08) :90-101