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.
REFERENCES
1.
Z.
Linhong
, K. N.
Wee
and J.
Cheng
, Information System
36
, 958
–972
(2011
).2.
Y.
Tian
, and J.M.
Patel
, IEEE Computer Society
, 963
–972
(2008
).3.
L.P.
Cordella
., P.
Foggia
, C.
Sansone
and M.
Vento
, IEEE Transaction on Pattern Analysis and Machine Intelligence
26
(10
), 1367
–1372
(2004
).4.
5.
6.
Y.
Liao
, J.
Yin
, D.
Yin
and L.
Goa
, Comp. Netw.
56
, 2132
–2147
(2012
).7.
This content is only available via PDF.
© 2016 Author(s).
2016
Author(s)
You do not currently have access to this content.