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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Diterbitkan: |
American Institute of Physics Inc.
2016
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/73206/ http://eprints.utm.my/73206/ |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!