Bi-partition approach of directed cyclic task graph onto multicolumn processors for total completion time minimization task assignment problem
Wan Nor Munirah Ariffin, Shaharuddin Salleh · AIP conference proceedings · 2016
Research on task assignment and scheduling problems began in the 1960’s, and has become a popular research topic in the past few decades. In this paper, the theoretical graph application using bi-partitioning technique is presented to assign a number of tasks onto two processors. This paper considered a directed-weighted cyclic task graph. Combining the technique of reduction and bi-partitioning led to an efficient graph-mapping concept. The developed simulation model found that the proposed techniques and algorithms are easy to be implemented and minimized the computational time.