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/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
my.upm.eprints.3870 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.38702013-05-27T07:11:54Z http://psasir.upm.edu.my/id/eprint/3870/ Top-down Heuristic for Finding Optimal Grain Size of Parallel Tasks Mohd Saman, Md. Yazid D. J., Evans 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 discusses a heuristic to determine the near-optimal grain size of parallel tasks that will give the best execution time. The effects of communication overheads between the different processors are examined. The heuristic developed is capable of balancing between maximizing parallelism and minimizing overheads. Universiti Putra Malaysia Press 1995 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/3870/1/Top-down_Heuristic_for_Finding_Optimal_Grain.pdf Mohd Saman, Md. Yazid and D. J., Evans (1995) Top-down Heuristic for Finding Optimal Grain Size of Parallel Tasks. Pertanika Journal of Science & Technology, 3 (2). pp. 241-259. ISSN 0128-7680 English |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English English |
| description |
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 discusses
a heuristic to determine the near-optimal grain size of parallel tasks that will
give the best execution time. The effects of communication overheads between
the different processors are examined. The heuristic developed is capable of
balancing between maximizing parallelism and minimizing overheads. |
| format |
Article |
| author |
Mohd Saman, Md. Yazid D. J., Evans |
| spellingShingle |
Mohd Saman, Md. Yazid D. J., Evans Top-down Heuristic for Finding Optimal Grain Size of Parallel Tasks |
| author_facet |
Mohd Saman, Md. Yazid D. J., Evans |
| author_sort |
Mohd Saman, Md. Yazid |
| title |
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks |
| title_short |
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks |
| title_full |
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks |
| title_fullStr |
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks |
| title_full_unstemmed |
Top-down Heuristic for Finding Optimal Grain
Size of Parallel Tasks |
| title_sort |
top-down heuristic for finding optimal grain
size of parallel tasks |
| publisher |
Universiti Putra Malaysia Press |
| publishDate |
1995 |
| url |
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/ |
| _version_ |
1643822738049073152 |
| score |
13.251813 |