Top-down Heuristic for Finding Optimal Grain Size of Parallel Tasks
In order to have an optimal execution time of a program running on a multiprocessor system, the program has to be partitioned into concurrent tasks. Partitioning of programs to grain size suitable for parallel execution is an NP complete problem but near-optimal time can be derived. This paper di...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English English |
| 出版事項: |
Universiti Putra Malaysia Press
1995
|
| オンライン･アクセス: | http://psasir.upm.edu.my/id/eprint/3870/1/Top-down_Heuristic_for_Finding_Optimal_Grain.pdf http://psasir.upm.edu.my/id/eprint/3870/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|