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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference or Workshop Item |
| 出版事項: |
American Institute of Physics Inc.
2016
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|