Task scheduling for directed cyclic graph using matching technique
The scheduling and mapping of task graph to processors is considered to be the most crucial NP-complete in parallel and distributed computing systems. In this paper, the theoretical graph application using matching is presented to assign a number of tasks onto two processors. This paper addresses a...
Saved in:
Main Authors: | Ariffin, Wan Nor Munirah, Salleh, Shaharuddin |
---|---|
Format: | Article |
Published: |
Hikari Ltd.
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/58885/ http://dx.doi.org/10.12988/ces.2015.56193 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The matching technique of directed cyclic graph for task assignment problem
by: Ariffin, Wan Nor Munirah, et al.
Published: (2014) -
The partitioning technique of directed cyclic graph for task assignment problem
by: Ariffin, W. N. M., et al.
Published: (2016) -
Transformation models of directed cyclic graph onto acyclic graph and mapping for task assignment problem
by: Ariffin, Wan Nor Munirah
Published: (2021) -
Bi-partition approach of directed cyclic task graph onto multicolumn processors for total completion time minimization task assignment problem
by: Ariffin, W. N. M., et al.
Published: (2016) -
Eigenvalues of the matching derangement graph
by: Ku, Cheng Yeaw, et al.
Published: (2018)