The matching technique of directed cyclic graph for task assignment problem
In this paper, the theoretical graph application using matching is presented to assign a number of tasks onto two processors. The problem involves cycles, which concerns finding directed acyclic graph by arranging the nodes onto multicolumn inspired by DPillar and presenting their edges to show comm...
Saved in:
Main Authors: | Ariffin, Wan Nor Munirah, Salleh, Shaharuddin |
---|---|
Format: | Article |
Published: |
AIP Publishing
2014
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/62982/ http://dx.doi.org/10.1063/1.4903612 http://dx.doi.org/10.1063/1.4903612 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Task scheduling for directed cyclic graph using matching technique
by: Ariffin, Wan Nor Munirah, et al.
Published: (2015) -
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) -
Transformation of DCG onto DAG for task assignment problem.
by: Mohd. Puzi, Shazirawati, et al.
Published: (2022)