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...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 語言: | 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/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|