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

DOI

10.2991/amitp-16.2016.70How to use a DOI?

Keywords

Task scheduling algorithm, HEFT, pi-calculus, PICT.

Abstract

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

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
BT  - Proceedings of the 2016 4th International Conference on Advanced Materials and Information Technology Processing (AMITP 2016)
PB  - Atlantis Press
SP  - 362
EP  - 368
SN  - 2352-538X
UR  - https://doi.org/10.2991/amitp-16.2016.70
DO  - 10.2991/amitp-16.2016.70
ID  - Kang2016/09
ER  -