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.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
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