A Loop Transformation Algorithm for Communication Overlapping

Overlapping communication with computation is a well-known approach to improving performance. Previous research had focused on optimizations performed by the programmer. This paper presents a compiler algorithm that automatically determines the appropriate loop indices of a given nested loop and app...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of parallel programming Ročník 28; číslo 2; s. 135 - 154
Hlavní autoři: Ishizaki, Kazuaki, Komatsu, Hideaki, Nakatani, Toshio
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.04.2000
Témata:
Algorithms
Communication
Computer memory
Critical path
Distributed processing
Methods
Optimization
Studies
ISSN:0885-7458, 1573-7640
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Overlapping communication with computation is a well-known approach to improving performance. Previous research had focused on optimizations performed by the programmer. This paper presents a compiler algorithm that automatically determines the appropriate loop indices of a given nested loop and applies loop interchange and tiling in order to overlap communication with computation. This paper also discusses the architectural problems of efficient optimization.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-General Information-1
content type line 14
SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:0885-7458
1573-7640
DOI:10.1023/A:1007554715418