Li, Zhen ; Atre, Rohit ; Huda, Zia Ul ; Jannesari, Ali ; Wolf, Felix (2016)
Unveiling Parallelization Opportunities in Sequential Programs.
In: Journal of Systems and Software, 117
doi: 10.1016/j.jss.2016.03.045
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
The stagnation of single-core performance leaves application developers with software parallelism as the only option to further benefit from Moore’s Law. However, in view of the complexity of writing parallel programs, the parallelization of myriads of sequential legacy programs presents a serious economic challenge. A key task in this process is the identification of suitable parallelization targets in the source code. In this paper, we present an approach to automatically identify potential parallelism in sequential programs of realistic size. In comparison to earlier approaches, our work combines a unique set of features that make it superior in terms of functionality: It not only (i) detects available parallelism with high accuracy but also (ii) identifies the parts of the code that can run in parallel—even if they are spread widely across the code, (iii) ranks parallelization opportunities according to the speedup expected for the entire program, while (iv) maintaining competitive overhead both in terms of time and memory.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2016 |
| Autor(en): | Li, Zhen ; Atre, Rohit ; Huda, Zia Ul ; Jannesari, Ali ; Wolf, Felix |
| Art des Eintrags: | Bibliographie |
| Titel: | Unveiling Parallelization Opportunities in Sequential Programs |
| Sprache: | Englisch |
| Publikationsjahr: | 1 Juli 2016 |
| Verlag: | Elsevier |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Journal of Systems and Software |
| Jahrgang/Volume einer Zeitschrift: | 117 |
| DOI: | 10.1016/j.jss.2016.03.045 |
| URL / URN: | https://www.sciencedirect.com/science/article/pii/S016412121... |
| Kurzbeschreibung (Abstract): | The stagnation of single-core performance leaves application developers with software parallelism as the only option to further benefit from Moore’s Law. However, in view of the complexity of writing parallel programs, the parallelization of myriads of sequential legacy programs presents a serious economic challenge. A key task in this process is the identification of suitable parallelization targets in the source code. In this paper, we present an approach to automatically identify potential parallelism in sequential programs of realistic size. In comparison to earlier approaches, our work combines a unique set of features that make it superior in terms of functionality: It not only (i) detects available parallelism with high accuracy but also (ii) identifies the parts of the code that can run in parallel—even if they are spread widely across the code, (iii) ranks parallelization opportunities according to the speedup expected for the entire program, while (iv) maintaining competitive overhead both in terms of time and memory. |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Parallele Programmierung |
| Hinterlegungsdatum: | 20 Apr 2018 12:24 |
| Letzte Änderung: | 01 Mär 2024 10:50 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum