Data-Flow Analysis for MPI Programs

Citations Over TimeTop 10% of 2006 papers

Abstract

Message passing via MPI is widely used in single-program, multiple-data (SPMD) parallel programs. Existing data-flow frameworks do not model the semantics of message-passing SPMD programs, which can result in less precise and even incorrect analysis results. We present a data-flow analysis framework for performing interprocedural analysis of message-passing SPMD programs. The framework is based on the MPI-ICFG representation, which is an interprocedural control-flow graph (ICFG) augmented with communication edges between possible send and receive pairs and partial context sensitivity. We show how to formulate nonseparable data-flow analyses within our framework using reaching constants as a canonical example. We also formulate and provide experimental results for the nonseparable analysis, activity analysis. Activity analysis is a domain-specific analysis used to reduce the computation and storage requirements for automatically differentiated MPI programs. Automatic differentiation is important for application domains such as climate modeling, electronic device simulation, oil reservoir simulation, medical treatment planning and computational economics to name a few. Our experimental results show that using the MPI-ICFG data-flow analysis framework improves the precision of activity analysis and as a result significantly reduces memory requirements for the automatically differentiated versions of a set of parallel benchmarks, including some of the NAS parallel benchmarks

Related Papers

• → Efficient and precise modeling of exceptions for the analysis of Java programs(1999)134 cited
• → Efficient and precise modeling of exceptions for the analysis of Java programs(1999)13 cited
• → Applying Dataflow Analysis to Detecting Software Vulnerability(2008)10 cited
• → Modeling software for accurate data flow representation(1993)8 cited
• An Approach of Data-Flow Analysis Based on Exception Propagation Analysis(2007)