Article thumbnail
Location of Repository

A Performance Estimator for Parallel Programs



1 Introduction Software providers with large production codes have always been concerned with measuring and enhancing the performance of their codes, since a faster, more memory efficient code is commercially advantageous. Even so there has never been a performance prediction tool available, even for sequential codes, that can reliably predict absolute performance. Consequently code optimisation is done by hand for particular codes using particular compilers and running on particular machines. With parallel codes the problem might seem worse but if one settles for knowing the relative merits of one parallelisation strategy compared with another before embarking on a full scale parallel version of a code then considerable effort can be saved. In view of this our philosophy is to ignore the details of the sequential code and effect a simulation scheme that reproduces the communication pattern of the code on simplified architectures so that the speed of different parallel code versions can be assessed. This approach can also detect deadlock and provide information on the optimal scheduling for small embedded systems

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.