Ariffin, W. N. M. and Salleh, S. (2016) The partitioning technique of directed cyclic graph for task assignment problem. In: 23rd Malaysian National Symposium of Mathematical Sciences: Advances in Industrial and Applied Mathematics, SKSM 2015, 24 November 2015 through 26 November 2015, Johor Bahru; Malaysia.
Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....
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 simple partitioning technique 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 Kernighan-Lin algorithm is applied to obtain the partition of tasks. Combining the technique of reduction and partitioning lead to an efficient graph-mapping concept.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Kernighan-Lin algorithm |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Science |
| ID Code: | 73206 |
| Deposited By: | Muhammad Atiff Mahussain |
| Deposited On: | 28 Nov 2017 05:01 |
| Last Modified: | 28 Nov 2017 05:01 |
Repository Staff Only: item control page
