Research and implementation of the heterogeneous earliest finish time algorithm based on Pi-Calculus
Hui Kang, Huiping Fei, Fang Mei
Available Online September 2016.
- https://doi.org/10.2991/amitp-16.2016.70How to use a DOI?
- Task scheduling algorithm, HEFT, pi-calculus, PICT.
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Hui Kang AU - Huiping Fei AU - Fang Mei PY - 2016/09 DA - 2016/09 TI - Research and implementation of the heterogeneous earliest finish time algorithm based on Pi-Calculus PB - Atlantis Press SP - 362 EP - 368 SN - 2352-538X UR - https://doi.org/10.2991/amitp-16.2016.70 DO - https://doi.org/10.2991/amitp-16.2016.70 ID - Kang2016/09 ER -