Research and implementation of the heterogeneous earliest finish time algorithm based on Pi-Calculus

被引:0
作者
Kang, Hui [1 ]
Fei, Huiping [1 ]
Mei, Fang [1 ]
机构
[1] JiLin Univ, Sch Comp, Changchun 130012, Peoples R China
来源
PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON ADVANCED MATERIALS AND INFORMATION TECHNOLOGY PROCESSING (AMITP 2016) | 2016年 / 60卷
关键词
Task scheduling algorithm; HEFT; pi-calculus; PICT;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Task scheduling algorithm in heterogeneous environment is programmed in a serial manner in the underlying by using traditional programming language. In this paper, we proposed that using the characteristics of parallel computation of Pi-calculus, to parallel analysis and modeling of the heterogeneous earliest finish time (HEFT) algorithm based on pi-calculus. Then programmed it using PICT, which is a programming language that corresponds to the pi-calculus. By creating different topologies of the task scheduling graph and compared with traditional programming language (C++ language) prove that the efficiency of using pi-calculus to develop the HEFT algorithm is higher than that of traditional programming language.
引用
收藏
页码:362 / 368
页数:7
相关论文
共 13 条
[1]  
[Anonymous], 2002, IEEE T PARALLEL DIST
[2]  
[Anonymous], 1983, Signals and Systems
[3]  
KANG Hui, 2009, J COMMUNICATIONS
[4]  
Milner Robin, 1990, 1154 INRIA SOPHIAN T
[5]  
Milner Robin, 1999, COMMUNICATING MOBILE
[6]   Behavioral equivalence in the polymorphic pi-calculus [J].
Pierce, BC ;
Sangiorgi, D .
JOURNAL OF THE ACM, 2000, 47 (03) :531-584
[7]  
Pierce Benjamin, 1997, DRAFT REPOR AVAILABL
[8]  
Pierce Benjamin C., 2000, PROOF LANGUAGE INTER
[9]  
Stavrinides G.L., 2010, J SYSTEMS SOFTWARE
[10]   NP-COMPLETE SCHEDULING PROBLEMS [J].
ULLMAN, JD .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 10 (03) :384-393