Optimizing compositions of scans and reductions in parallel program derivation:

Abstract: "We prove two transformation rules over popular primitives of parallel programming: the first rule transforms a sequential composition of scan and reduction into a single reduction, the second rule transforms a composition of two scans into a single scan. For the maximum segment sum p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Gorlač, Sergej (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Passau 1997
Schriftenreihe:Universität <Passau> / Fakultät für Mathematik und Informatik: MIP 1997,11
Schlagworte:
Zusammenfassung:Abstract: "We prove two transformation rules over popular primitives of parallel programming: the first rule transforms a sequential composition of scan and reduction into a single reduction, the second rule transforms a composition of two scans into a single scan. For the maximum segment sum problem, we formally derive the two previously known parallel solutions: the derivation of the first solution involves one application of the first rule, the second solution is obtained by a repeated rule application."
Beschreibung:9, 5 S.