Adding parallelism to sequential programs – a combined method
I tiakina i:
| I whakaputaina i: | International Journal of Electronics and Telecommunications vol. 70, no. 1 (2024), p. 135 |
|---|---|
| Kaituhi matua: | |
| Ētahi atu kaituhi: | , |
| I whakaputaina: |
Polish Academy of Sciences
|
| Ngā marau: | |
| Urunga tuihono: | Citation/Abstract Full Text - PDF |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
| Whakarāpopotonga: | The article outlines a contemporary method for creating software for multi-processor computers. It describes the identification of parallelizable sequential code structures. Three structures were found and then carefully examined. The algorithms used to determine whether or not certain parts of code may be parallelized result from static analysis. The techniques demonstrate how, if possible, existing sequential structures might be transformed into parallel-running programs. A dynamic evaluation is also a part of our process, and it can be used to assess the efficiency of the parallel programs that are developed. As a tool for sequential programs, the algorithms have been implemented in C#. All proposed methods were discussed using a common benchmark. |
|---|---|
| ISSN: | 2081-8491 2300-1933 0035-9386 0867-6747 |
| DOI: | 10.24425/ijet.2024.149523 |
| Puna: | Advanced Technologies & Aerospace Database |