The partitioning technique of directed cyclic graph for task assignment problem
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. Th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
American Institute of Physics Inc.
2016
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/73206/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84984535677&doi=10.1063%2f1.4954523&partnerID=40&md5=dbffdd04f86f3380c7dbb4077e0d391c |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|