Transformation of DCG onto DAG for task assignment problem.
Task assignment is one of the most challenging problems in distributed computing environment and many real-life problems. Several approaches and techniques of optimal task assignment have been proposed by various researchers ranging from graph partitioning-based tools to heuristic graph matching. A...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2022
|
| Subjects: |
| _version_ | 1796867716553900032 |
|---|---|
| author | Mohd. Puzi, Shazirawati Abdullah, Mohd. Mustafa Albakri Mohd. Amin, Nor Azrita Masran, Hafiz Ariffin, Wan Nor Munirah |
| author_facet | Mohd. Puzi, Shazirawati Abdullah, Mohd. Mustafa Albakri Mohd. Amin, Nor Azrita Masran, Hafiz Ariffin, Wan Nor Munirah |
| author_sort | Mohd. Puzi, Shazirawati |
| collection | ePrints |
| description | Task assignment is one of the most challenging problems in distributed computing environment and many real-life problems. Several approaches and techniques of optimal task assignment have been proposed by various researchers ranging from graph partitioning-based tools to heuristic graph matching. A good task assignment algorithm and mapping strategy ensure completion time minimization. However, if a cycle exists, it is undesirable and impossible to complete the task according to the constraints. Thus, it is desirable to have a method to eliminate the cycle to obtain a directed acyclic graph for a task assignment problem. In this paper, the technique of transforming a directed cyclic graph formed by a plurality of nodes into a directed acyclic graph are presented. The algorithm was coded, and the simulations are run for the proposed model using respective program developed by JavaScript programming language with D3 library. Based on the results, the proposed models give better optimality index by 6.80% compared to previous works. This research provides fundamental solution and better understanding to avoid cycle on assignment problems thus helping organizations or companies to increase the efficiency in planning as well as reducing the routing cost. |
| first_indexed | 2024-03-05T21:31:28Z |
| format | Conference or Workshop Item |
| id | utm.eprints-104737 |
| institution | Universiti Teknologi Malaysia - ePrints |
| last_indexed | 2024-03-05T21:31:28Z |
| publishDate | 2022 |
| record_format | dspace |
| spelling | utm.eprints-1047372024-02-25T04:53:18Z http://eprints.utm.my/104737/ Transformation of DCG onto DAG for task assignment problem. Mohd. Puzi, Shazirawati Abdullah, Mohd. Mustafa Albakri Mohd. Amin, Nor Azrita Masran, Hafiz Ariffin, Wan Nor Munirah QA Mathematics QA75 Electronic computers. Computer science Task assignment is one of the most challenging problems in distributed computing environment and many real-life problems. Several approaches and techniques of optimal task assignment have been proposed by various researchers ranging from graph partitioning-based tools to heuristic graph matching. A good task assignment algorithm and mapping strategy ensure completion time minimization. However, if a cycle exists, it is undesirable and impossible to complete the task according to the constraints. Thus, it is desirable to have a method to eliminate the cycle to obtain a directed acyclic graph for a task assignment problem. In this paper, the technique of transforming a directed cyclic graph formed by a plurality of nodes into a directed acyclic graph are presented. The algorithm was coded, and the simulations are run for the proposed model using respective program developed by JavaScript programming language with D3 library. Based on the results, the proposed models give better optimality index by 6.80% compared to previous works. This research provides fundamental solution and better understanding to avoid cycle on assignment problems thus helping organizations or companies to increase the efficiency in planning as well as reducing the routing cost. 2022 Conference or Workshop Item PeerReviewed Mohd. Puzi, Shazirawati and Abdullah, Mohd. Mustafa Albakri and Mohd. Amin, Nor Azrita and Masran, Hafiz and Ariffin, Wan Nor Munirah (2022) Transformation of DCG onto DAG for task assignment problem. In: 1ST Joint International Conference On Mathematics, Statistics And Engineering (J-COMSE 2021), 12–13 July 2021, Penang, Malaysia. https://pubs.aip.org/aip/acp/article-abstract/2465/1/020001/2825452/Transformation-of-DCG-onto-DAG-for-task-assignment?redirectedFrom=fulltext |
| spellingShingle | QA Mathematics QA75 Electronic computers. Computer science Mohd. Puzi, Shazirawati Abdullah, Mohd. Mustafa Albakri Mohd. Amin, Nor Azrita Masran, Hafiz Ariffin, Wan Nor Munirah Transformation of DCG onto DAG for task assignment problem. |
| title | Transformation of DCG onto DAG for task assignment problem. |
| title_full | Transformation of DCG onto DAG for task assignment problem. |
| title_fullStr | Transformation of DCG onto DAG for task assignment problem. |
| title_full_unstemmed | Transformation of DCG onto DAG for task assignment problem. |
| title_short | Transformation of DCG onto DAG for task assignment problem. |
| title_sort | transformation of dcg onto dag for task assignment problem |
| topic | QA Mathematics QA75 Electronic computers. Computer science |
| work_keys_str_mv | AT mohdpuzishazirawati transformationofdcgontodagfortaskassignmentproblem AT abdullahmohdmustafaalbakri transformationofdcgontodagfortaskassignmentproblem AT mohdaminnorazrita transformationofdcgontodagfortaskassignmentproblem AT masranhafiz transformationofdcgontodagfortaskassignmentproblem AT ariffinwannormunirah transformationofdcgontodagfortaskassignmentproblem |