The research and implementation of The Critical Path on a Processor (CPOP) Algorithm based on Pi calculus

DOI

10.2991/iccia-16.2016.62How to use a DOI?

Keywords

Heterogeneous system; Task scheduling algorithm; Pi calculus; nPict.

Abstract

Task scheduling algorithms in heterogeneous computing environment often provide limited perfor-mance owing to their low efficiency. This paper models and implements the first two phases of the Critical Path (CP) on a Processor Algorithm with the functional programming paradigm. Firstly, an overall research is conducted on the CPOP algorithms, then the logical relationship of the first two phrases of the algorithm is modeled based on Pi calculus theories, and finally the algorithm is im-plemented by nPict programming language. The experimental results demonstrate that the imple-mentation efficiency of the new programming algorithm is higher than that of the traditional C++ language. Therefore, Pi calculus can be applied to the three phases of the CPOP algorithm to im-prove the task scheduling efficiency. This paper aims to prove that the CPOP algorithm can be more efficient than ever by using Pi calculus, through modeling and comparing the topological structures of the different types of task scheduling models.

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  - He Yuan
AU  - Yongzhe Zhao
AU  - Hui Kang
PY  - 2016/09
DA  - 2016/09
TI  - The research and implementation of The Critical Path on a Processor (CPOP) Algorithm based on Pi calculus
BT  - Proceedings of the 2016 International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2016)
PB  - Atlantis Press
SP  - 334
EP  - 342
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccia-16.2016.62
DO  - 10.2991/iccia-16.2016.62
ID  - Yuan2016/09
ER  -