Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Ariffin, Wan Nor Munirah, Salleh, Shaharuddin
Format: Article
Published: Hikari Ltd. 2015
Subjects:
QA Mathematics
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!
id my.utm.58885
record_format eprints
spelling my.utm.588852021-12-07T07:47:28Z http://eprints.utm.my/id/eprint/58885/ Task scheduling for directed cyclic graph using matching technique Ariffin, Wan Nor Munirah Salleh, Shaharuddin QA Mathematics 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 directed-weighted cyclic graph. The effort is to reduce the graph onto directed acyclic graph. A co-comparability graph is presented in order to assign the task onto two processors. Combining several innovative techniques lead to an efficient graph-mapping concept, called DCGSimplify. Our simulation model found that the proposed techniques and algorithms are easy to be implemented. Hikari Ltd. 2015 Article PeerReviewed Ariffin, Wan Nor Munirah and Salleh, Shaharuddin (2015) Task scheduling for directed cyclic graph using matching technique. Contemporary Engineering Sciences, 8 (17-20). pp. 773-788. ISSN 1313-6569 http://dx.doi.org/10.12988/ces.2015.56193
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 QA Mathematics
spellingShingle QA Mathematics
Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
Task scheduling for directed cyclic graph using matching technique
description 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 directed-weighted cyclic graph. The effort is to reduce the graph onto directed acyclic graph. A co-comparability graph is presented in order to assign the task onto two processors. Combining several innovative techniques lead to an efficient graph-mapping concept, called DCGSimplify. Our simulation model found that the proposed techniques and algorithms are easy to be implemented.
format Article
author Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
author_facet Ariffin, Wan Nor Munirah
Salleh, Shaharuddin
author_sort Ariffin, Wan Nor Munirah
title Task scheduling for directed cyclic graph using matching technique
title_short Task scheduling for directed cyclic graph using matching technique
title_full Task scheduling for directed cyclic graph using matching technique
title_fullStr Task scheduling for directed cyclic graph using matching technique
title_full_unstemmed Task scheduling for directed cyclic graph using matching technique
title_sort task scheduling for directed cyclic graph using matching technique
publisher Hikari Ltd.
publishDate 2015
url http://eprints.utm.my/id/eprint/58885/
http://dx.doi.org/10.12988/ces.2015.56193
_version_ 1718926036946649088
score 13.160551

Similar Items