arXiv Open Access 2018

Task Graph Transformations for Latency Tolerance

Victor Eijkhout
Lihat Sumber

Abstrak

The Integrative Model for Parallelism (IMP) derives a task graph from a higher level description of parallel algorithms. In this note we show how task graph transformations can be used to achieve latency tolerance in the program execution. We give a formal derivation of the graph transformation, and show through simulation how latency tolerant algorithms can be faster than the naive execution in a strong scaling scenario.

Topik & Kata Kunci

Penulis (1)

V

Victor Eijkhout

Format Sitasi

Eijkhout, V. (2018). Task Graph Transformations for Latency Tolerance. https://arxiv.org/abs/1811.05077

Akses Cepat

Lihat di Sumber
Informasi Jurnal
Tahun Terbit
2018
Bahasa
en
Sumber Database
arXiv
Akses
Open Access ✓