Universiti Teknologi Malaysia Institutional Repository

Task scheduling for directed cyclic graph using matching technique

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

Full text not available from this repository.

Official URL: http://dx.doi.org/10.12988/ces.2015.56193

Abstract

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.

Item Type:Article
Subjects:A General Works
ID Code:58885
Deposited By: Haliza Zainal
Deposited On:04 Dec 2016 12:07
Last Modified:20 Sep 2017 15:41

Repository Staff Only: item control page