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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Hikari Ltd.
2015
|
| Subjects: |
| _version_ | 1796860602006634496 |
|---|---|
| author | Ariffin, Wan Nor Munirah Salleh, Shaharuddin |
| author_facet | Ariffin, Wan Nor Munirah Salleh, Shaharuddin |
| author_sort | Ariffin, Wan Nor Munirah |
| collection | ePrints |
| 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. |
| first_indexed | 2024-03-05T19:43:45Z |
| format | Article |
| id | utm.eprints-58885 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T19:43:45Z |
| publishDate | 2015 |
| publisher | Hikari Ltd. |
| record_format | dspace |
| spelling | utm.eprints-588852021-12-07T07:47:28Z http://eprints.utm.my/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 |
| spellingShingle | QA Mathematics Ariffin, Wan Nor Munirah Salleh, Shaharuddin Task scheduling for directed cyclic graph using matching technique |
| title | 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_short | Task scheduling for directed cyclic graph using matching technique |
| title_sort | task scheduling for directed cyclic graph using matching technique |
| topic | QA Mathematics |
| work_keys_str_mv | AT ariffinwannormunirah taskschedulingfordirectedcyclicgraphusingmatchingtechnique AT sallehshaharuddin taskschedulingfordirectedcyclicgraphusingmatchingtechnique |