On optimal parallelization of arbitrary loops

On optimal parallelization of arbitrary loops

The problem of automatic loop parallelization has received a lot of attention in the area of parallelizing compilers. Automatic loop parallelization can be achieved by several algorithms. In this paper, we address the problem of time optimal parallelization of loops with conditional jumps. We prove...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing 1991-02, Vol.11 (2), p.130-134
Hauptverfasser: Schwiegelshohn, Uwe, Gasperoni, Franco, Ebcioǧlu, Kemal
Format: Artikel
Sprache:eng
Schlagworte:
990200 - Mathematics & Computers
ALGORITHMS
Applied sciences
COMPUTER ARCHITECTURE
Computer science
control theory
systems
Exact sciences and technology
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PROGRAMMING
Software
Software engineering
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of automatic loop parallelization has received a lot of attention in the area of parallelizing compilers. Automatic loop parallelization can be achieved by several algorithms. In this paper, we address the problem of time optimal parallelization of loops with conditional jumps. We prove that even for machines with unlimited resources there are simple loops for which no semantically and algorithmically equivalent time optimal program exists.
ISSN:0743-7315
1096-0848
DOI:10.1016/0743-7315(91)90118-S