A global communication optimization technique based on data-flow analysis and linear algebra

DMCA

A global communication optimization technique based on data-flow analysis and linear algebra (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by M. Kandemir , P. Banerjee , A. Choudhary , J. Ramanujam , N. Shenoy

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	18 - 1 self

BibTeX

@ARTICLE{Kandemir99aglobal,
    author = {M. Kandemir and P. Banerjee and A. Choudhary and J. Ramanujam and N. Shenoy},
    title = {A global communication optimization technique based on data-flow analysis and linear algebra},
    journal = {ACM Transactions on Programming Languages and Systems},
    year = {1999},
    volume = {21},
    pages = {1251--1297}
}

OpenURL

Abstract

Reducing communication overhead is extremely important in distributed-memory messagepassing architectures. In this article, we present a technique to improve communication that considers data access patterns of the entire program. Our approach is based on a combination of traditional data-flow analysis and a linear algebra framework, and it works on structured programs with conditional statements and nested loops but without arbitrary goto statements. The distinctive features of the solution are the accuracy in keeping communication set information, support for general alignments and distributions including block-cyclic distributions, and the ability to simulate some of the previous approaches with suitable modifications. We also show how optimizations such as message vectorization, message coalescing, and redundancy elimination are supported by our framework. Experimental results on several benchmarks show that our technique is effective in reducing the number of messages (an average of 32 % reduction), the volume of the data communicated (an average of 37%

Keyphrases

data-flow analysis global communication optimization technique linear algebra distributed-memory messagepassing architecture communication overhead distinctive feature arbitrary goto statement general alignment traditional data-flow analysis suitable modification data access pattern redundancy elimination conditional statement message vectorization entire program block-cyclic distribution message coalescing nested loop several benchmark linear algebra framework previous approach structured program experimental result

DMCA