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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2022
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/104737/ https://pubs.aip.org/aip/acp/article-abstract/2465/1/020001/2825452/Transformation-of-DCG-onto-DAG-for-task-assignment?redirectedFrom=fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
| Summary: | 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. |
|---|