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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
AIP Publishing
2014
|
| Subjects: |
| _version_ | 1796861374670831616 |
|---|---|
| author | Ariffin, Wan Nor Munirah Salleh, Shaharuddin |
| author_facet | Ariffin, Wan Nor Munirah Salleh, Shaharuddin |
| author_sort | Ariffin, Wan Nor Munirah |
| collection | ePrints |
| description | 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 communication between the nodes. A co-comparability graph is presented in order to assign the task onto two processors. The quality techniques used for finding the acyclic graph and co-comparability graph lead to an efficient graph-mapping concept. |
| first_indexed | 2024-03-05T19:55:21Z |
| format | Article |
| id | utm.eprints-62982 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T19:55:21Z |
| publishDate | 2014 |
| publisher | AIP Publishing |
| record_format | dspace |
| spelling | utm.eprints-629822017-10-03T07:08:39Z http://eprints.utm.my/62982/ The matching technique of directed cyclic graph for task assignment problem Ariffin, Wan Nor Munirah Salleh, Shaharuddin Q Science 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 communication between the nodes. A co-comparability graph is presented in order to assign the task onto two processors. The quality techniques used for finding the acyclic graph and co-comparability graph lead to an efficient graph-mapping concept. AIP Publishing 2014 Article PeerReviewed Ariffin, Wan Nor Munirah and Salleh, Shaharuddin (2014) The matching technique of directed cyclic graph for task assignment problem. AIP Conference Proceedings, 1635 . pp. 387-394. ISSN 0094-243X http://dx.doi.org/10.1063/1.4903612 http://dx.doi.org/10.1063/1.4903612 |
| spellingShingle | Q Science Ariffin, Wan Nor Munirah Salleh, Shaharuddin The matching technique of directed cyclic graph for task assignment problem |
| title | The matching technique of directed cyclic graph for task assignment problem |
| title_full | The matching technique of directed cyclic graph for task assignment problem |
| title_fullStr | The matching technique of directed cyclic graph for task assignment problem |
| title_full_unstemmed | The matching technique of directed cyclic graph for task assignment problem |
| title_short | The matching technique of directed cyclic graph for task assignment problem |
| title_sort | matching technique of directed cyclic graph for task assignment problem |
| topic | Q Science |
| work_keys_str_mv | AT ariffinwannormunirah thematchingtechniqueofdirectedcyclicgraphfortaskassignmentproblem AT sallehshaharuddin thematchingtechniqueofdirectedcyclicgraphfortaskassignmentproblem AT ariffinwannormunirah matchingtechniqueofdirectedcyclicgraphfortaskassignmentproblem AT sallehshaharuddin matchingtechniqueofdirectedcyclicgraphfortaskassignmentproblem |