Interprocedural framework for determining efficient data redistributions in distributed memory machines

Sandeep Gupta, S. Krishnamurthy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

This paper presents a framework to find good distributions for the global arrays at different program points in the presence of procedure calls. The distributions are chosen for their ability to offset the redistribution overheads by contributing significantly towards increasing the performance gains. The algorithm uses interprocedural analysis and dynamic programming techniques. The working of the algorithm has been demonstrated for a CFD kernel.

Original languageEnglish (US)
Title of host publicationFrontiers of Massively Parallel Computation - Conference Proceedings
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherIEEE
Pages233-240
Number of pages8
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 6th Symposium on the Frontiers of Massively Parallel Computing, Frontiers'96 - Annapolis, MD, USA
Duration: Oct 27 1996Oct 31 1996

Other

OtherProceedings of the 1996 6th Symposium on the Frontiers of Massively Parallel Computing, Frontiers'96
CityAnnapolis, MD, USA
Period10/27/9610/31/96

    Fingerprint

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Gupta, S., & Krishnamurthy, S. (1996). Interprocedural framework for determining efficient data redistributions in distributed memory machines. In Anon (Ed.), Frontiers of Massively Parallel Computation - Conference Proceedings (pp. 233-240). Los Alamitos, CA, United States: IEEE.