Reducing Parallel Program Simulation Complexity by Static Analysis

  • Authors:
  • Rocco Aversa;Beniamino Di Martino;Nicola Mazzocca;Umberto Villano

  • Affiliations:
  • Facoltà di Ingegneria, Dipartimento di Ingegneria dell' Informazione, Second University of Naples, Italy rocco.aversa@unina2.it;Facoltà di Ingegneria, Dipartimento di Ingegneria dell' Informazione, Second University of Naples, Italy beniamino.dimartino@unina.it;Facoltà di Ingegneria, Dipartimento di Ingegneria dell' Informazione, Second University of Naples, Italy n.mazzocca@unina.it;Facoltà di Ingegneria Informatica, Università del Sannio, Italy villano@unisannio.it

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a novel approach, based on the integration of static program analysis and simulation techniques, for the performance prediction of message passing programs. PS, a simulator of PVM applications developed in the last years by our research group, is fed with traces collected by executing the parallel program to be analyzed in quasi-concurrent mode on a single workstation. Since this process is typically a non negligible part of the simulation complexity, we have devised a technique based on static analysis and code restructuring for significantly speeding up the trace generation. We show how, by statically analyzing and restructuring the program, it is possible to obtain a simplified code (shrinked code) to be run for collecting a reduced version of the traces.