TLP: Towards three‐level loop parallelisation
Abstract Due to the design of computer systems in the multi‐core and/or multi‐processor form, it is possible to use the maximum capacity of processors to run an application with the least time consumed through parallelisation. This is the responsibility of parallel compilers, which perform paralleli...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-09-01
|
| Series: | IET Computers & Digital Techniques |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cdt2.12046 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832559545236324352 |
|---|---|
| author | Shabnam Mahjoub Mehdi Golsorkhtabaramiri Seyed Sadegh Salehi Amiri |
| author_facet | Shabnam Mahjoub Mehdi Golsorkhtabaramiri Seyed Sadegh Salehi Amiri |
| author_sort | Shabnam Mahjoub |
| collection | DOAJ |
| description | Abstract Due to the design of computer systems in the multi‐core and/or multi‐processor form, it is possible to use the maximum capacity of processors to run an application with the least time consumed through parallelisation. This is the responsibility of parallel compilers, which perform parallelisation in several steps by distributing iterations between different processors and executing them simultaneously to achieve lower runtime. The present paper focuses on the uniformisation of three‐level perfect nested loops as an important step in parallelisation and proposes a method called Towards Three‐Level Loop Parallelisation (TLP) that uses a combination of a Frog Leaping Algorithm and Fuzzy to achieve optimal results because in recent years, many algorithms have worked on volumetric data, that is, three‐dimensional spaces. Results of the implementation of the TLP algorithm in comparison with existing methods lead to a wide variety of optimal results at desired times, with minimum cone size resulting from the vectors. Besides, the maximum number of input dependence vectors is decomposed by this algorithm. These results can accelerate the process of generating parallel codes and facilitate their development for High‐Performance Computing purposes. |
| format | Article |
| id | doaj-art-302344ce698b410e8871f60611881d74 |
| institution | Kabale University |
| issn | 1751-8601 1751-861X |
| language | English |
| publishDate | 2022-09-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Computers & Digital Techniques |
| spelling | doaj-art-302344ce698b410e8871f60611881d742025-02-03T01:29:42ZengWileyIET Computers & Digital Techniques1751-86011751-861X2022-09-01165-615917110.1049/cdt2.12046TLP: Towards three‐level loop parallelisationShabnam Mahjoub0Mehdi Golsorkhtabaramiri1Seyed Sadegh Salehi Amiri2Department of Computer Engineering Babol Branch Islamic Azad University Babol IranDepartment of Computer Engineering Babol Branch Islamic Azad University Babol IranDepartment of Mathematics Babol Branch Islamic Azad University Babol IranAbstract Due to the design of computer systems in the multi‐core and/or multi‐processor form, it is possible to use the maximum capacity of processors to run an application with the least time consumed through parallelisation. This is the responsibility of parallel compilers, which perform parallelisation in several steps by distributing iterations between different processors and executing them simultaneously to achieve lower runtime. The present paper focuses on the uniformisation of three‐level perfect nested loops as an important step in parallelisation and proposes a method called Towards Three‐Level Loop Parallelisation (TLP) that uses a combination of a Frog Leaping Algorithm and Fuzzy to achieve optimal results because in recent years, many algorithms have worked on volumetric data, that is, three‐dimensional spaces. Results of the implementation of the TLP algorithm in comparison with existing methods lead to a wide variety of optimal results at desired times, with minimum cone size resulting from the vectors. Besides, the maximum number of input dependence vectors is decomposed by this algorithm. These results can accelerate the process of generating parallel codes and facilitate their development for High‐Performance Computing purposes.https://doi.org/10.1049/cdt2.12046frog leaping algorithmfuzzyparallelizationthree‐level loopsuniformisation |
| spellingShingle | Shabnam Mahjoub Mehdi Golsorkhtabaramiri Seyed Sadegh Salehi Amiri TLP: Towards three‐level loop parallelisation IET Computers & Digital Techniques frog leaping algorithm fuzzy parallelization three‐level loops uniformisation |
| title | TLP: Towards three‐level loop parallelisation |
| title_full | TLP: Towards three‐level loop parallelisation |
| title_fullStr | TLP: Towards three‐level loop parallelisation |
| title_full_unstemmed | TLP: Towards three‐level loop parallelisation |
| title_short | TLP: Towards three‐level loop parallelisation |
| title_sort | tlp towards three level loop parallelisation |
| topic | frog leaping algorithm fuzzy parallelization three‐level loops uniformisation |
| url | https://doi.org/10.1049/cdt2.12046 |
| work_keys_str_mv | AT shabnammahjoub tlptowardsthreelevelloopparallelisation AT mehdigolsorkhtabaramiri tlptowardsthreelevelloopparallelisation AT seyedsadeghsalehiamiri tlptowardsthreelevelloopparallelisation |