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: | Ariffin, W. N. M., Salleh, S. |
---|---|
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!
|
Similar Items
-
Bi-partition approach of directed cyclic task graph onto multicolumn processors for total completion time minimization task assignment problem
by: Ariffin, W. N. M., et al.
Published: (2016) -
Transformation models of directed cyclic graph onto acyclic graph and mapping for task assignment problem
by: Ariffin, Wan Nor Munirah
Published: (2021) -
The matching technique of directed cyclic graph for task assignment problem
by: Ariffin, Wan Nor Munirah, et al.
Published: (2014) -
Task scheduling for directed cyclic graph using matching technique
by: Ariffin, Wan Nor Munirah, et al.
Published: (2015) -
Partitioning technique for transformation of connected graphs into single-row networks
by: Loh, S., et al.
Published: (2011)