Hiding Communication Latency with Non-SPMD, Graph-Based Execution

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. Key words: parallel programming, latency tolerance, non-SPMD, coarse grain dataflow

• Type: Conference
• Year: 2009
• Where: ICCS
• Authors: Jacob Sorensen, Scott B. Baden
• Keywords: Applied Computing, Cases Exceeding Performance, Communication Delays, ICCS 2009, Overlap Strategy