English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Task scheduling algorithms in heterogeneous computing environment often provide limited performance 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 implemented by nPict programming language. The experimental results demonstrate that the implementation 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 improve 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.

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