Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems
The article presents a comparative analysis of the effectiveness of using parallelism of varying granularity degrees in modern multicore computer systems using the most popular programming languages and libraries (such as C#, Java, C++, and OpenMP). Based on the performed comparison, the possibiliti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Igor Sikorsky Kyiv Polytechnic Institute
2022-08-01
|
| Series: | Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï |
| Subjects: | |
| Online Access: | http://journal.iasa.kpi.ua/article/view/251975 |
| _version_ | 1797351349190393856 |
|---|---|
| author | Valerii Martell Aleksandr Korochkin Olga Rusanova |
| author_facet | Valerii Martell Aleksandr Korochkin Olga Rusanova |
| author_sort | Valerii Martell |
| collection | DOAJ |
| description | The article presents a comparative analysis of the effectiveness of using parallelism of varying granularity degrees in modern multicore computer systems using the most popular programming languages and libraries (such as C#, Java, C++, and OpenMP). Based on the performed comparison, the possibilities of increasing the efficiency of computations in multicore computer systems by using combinations of medium- and fine-grained parallelism were also investigated. The results demonstrate the high potential efficiency of fine-grained parallelism when organizing intensive parallel computations. Based on these results, it can be argued that, in comparison with more traditional parallelization methods that use medium-grain parallelism, the use of separately fine-grained parallelism can reduce the computation time of a large mathematical problem by an average of 4%. The use of combined parallelism can reduce the computation time of such a problem to 5,5%. This reduction in execution time can be significant when performing very large computations. |
| first_indexed | 2024-03-08T12:59:13Z |
| format | Article |
| id | doaj.art-4104bbc01e3d44d49c93e662bf209ad2 |
| institution | Directory Open Access Journal |
| issn | 1681-6048 2308-8893 |
| language | Ukrainian |
| last_indexed | 2024-03-08T12:59:13Z |
| publishDate | 2022-08-01 |
| publisher | Igor Sikorsky Kyiv Polytechnic Institute |
| record_format | Article |
| series | Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï |
| spelling | doaj.art-4104bbc01e3d44d49c93e662bf209ad22024-01-19T12:36:00ZukrIgor Sikorsky Kyiv Polytechnic InstituteSistemnì Doslìdženâ ta Informacìjnì Tehnologìï1681-60482308-88932022-08-012456010.20535/SRIT.2308-8893.2022.2.03289872Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systemsValerii Martell0https://orcid.org/0000-0002-1749-5818Aleksandr Korochkin1https://orcid.org/0000-0003-4650-2316Olga Rusanova2https://orcid.org/0000-0003-0145-3012National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", KyivNational Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", KyivNational Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", KyivThe article presents a comparative analysis of the effectiveness of using parallelism of varying granularity degrees in modern multicore computer systems using the most popular programming languages and libraries (such as C#, Java, C++, and OpenMP). Based on the performed comparison, the possibilities of increasing the efficiency of computations in multicore computer systems by using combinations of medium- and fine-grained parallelism were also investigated. The results demonstrate the high potential efficiency of fine-grained parallelism when organizing intensive parallel computations. Based on these results, it can be argued that, in comparison with more traditional parallelization methods that use medium-grain parallelism, the use of separately fine-grained parallelism can reduce the computation time of a large mathematical problem by an average of 4%. The use of combined parallelism can reduce the computation time of such a problem to 5,5%. This reduction in execution time can be significant when performing very large computations.http://journal.iasa.kpi.ua/article/view/251975multicore computer systemcorethreadtasksparallelismgranularityfork-joinspeedup coefficientfine-grained parallelismnested parallelismcombined parallelism |
| spellingShingle | Valerii Martell Aleksandr Korochkin Olga Rusanova Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï multicore computer system core thread tasks parallelism granularity fork-join speedup coefficient fine-grained parallelism nested parallelism combined parallelism |
| title | Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| title_full | Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| title_fullStr | Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| title_full_unstemmed | Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| title_short | Comparative analysis of the effectiveness of using fine-grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| title_sort | comparative analysis of the effectiveness of using fine grained and nested parallelism to increase the speedup of parallel computing in multicore computer systems |
| topic | multicore computer system core thread tasks parallelism granularity fork-join speedup coefficient fine-grained parallelism nested parallelism combined parallelism |
| url | http://journal.iasa.kpi.ua/article/view/251975 |
| work_keys_str_mv | AT valeriimartell comparativeanalysisoftheeffectivenessofusingfinegrainedandnestedparallelismtoincreasethespeedupofparallelcomputinginmulticorecomputersystems AT aleksandrkorochkin comparativeanalysisoftheeffectivenessofusingfinegrainedandnestedparallelismtoincreasethespeedupofparallelcomputinginmulticorecomputersystems AT olgarusanova comparativeanalysisoftheeffectivenessofusingfinegrainedandnestedparallelismtoincreasethespeedupofparallelcomputinginmulticorecomputersystems |