Hiding communication latency with non-spmd, graph-based execution

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present an alternative approach based on dataflow, that factors the overlap strategy out of the application. Using this approach we are able to reduce communication delays, meeting and in many cases exceeding performance obtained with traditional hand coded applications. © 2009 Springer Berlin Heidelberg.

References Powered by Scopus

Data Flow Supercomputers

364Citations
N/AReaders
Get full text

SUMMA: Scalable universal matrix multiplication algorithm

304Citations
N/AReaders
Get full text

Cilk: An Efficient Multithreaded Runtime System

245Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Bamboo - Translating MPI applications to a latency-tolerant, data-driven form

16Citations
N/AReaders
Get full text

Automatic translation of MPI source into a latency-tolerant, data-driven form

3Citations
N/AReaders
Get full text

LU factorization: Towards hiding communication overheads with a lookahead-free algorithm

3Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Sorensen, J., & Baden, S. B. (2009). Hiding communication latency with non-spmd, graph-based execution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5544 LNCS, pp. 155–164). https://doi.org/10.1007/978-3-642-01970-8_16

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

67%

Professor / Associate Prof. 1

33%

Readers' Discipline

Tooltip

Computer Science 2

67%

Mathematics 1

33%

Save time finding and organizing research with Mendeley

Sign up for free