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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
American Institute of Physics Inc.
2016
|
| Subjects: |