Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ariffin, Wan Nor Munirah, Salleh, Shaharuddin
Format: Article
Published: AIP Publishing 2014
Subjects:
Q Science
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!
id my.utm.62982
record_format eprints
spelling my.utm.629822017-10-03T07:08:39Z http://eprints.utm.my/id/eprint/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
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic Q Science
spellingShingle Q Science
Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
The matching technique of directed cyclic graph for task assignment problem
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.
format Article
author Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
author_facet Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
author_sort Ariffin, Wan Nor Munirah
title 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_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_sort matching technique of directed cyclic graph for task assignment problem
publisher AIP Publishing
publishDate 2014
url http://eprints.utm.my/id/eprint/62982/
http://dx.doi.org/10.1063/1.4903612
http://dx.doi.org/10.1063/1.4903612
_version_ 1643655581675814912
score 13.160551

Similar Items