An abstract semantically rich compiler collocative and interpretative model for openmp programs

Mohamed Mokbel, Robert D. Kent, Michael Wong

Research output: Contribution to journalArticle

Abstract

To understand the behavior of OpenMP programs, special tools and adaptive techniques are needed for performance analysis. However, these tools provide low-level profile information at the assembly and functions boundaries via instrumentation at the binary or code level, which are very hard to interpret. Moreover, to compare different OpenMP-enabled compilers, there is no systematic methodology that provides an easy comparison. Hence, in this paper, we propose a new model for OpenMP-enabled compilers that assesses the performance differences in well-defined formulations by dividing OpenMP program conditions into four distinct states which account for all the possible cases that an OpenMP program can take. The model works as a first-level inspector to reason about the effect of compiler performance on every state in an unobtrusive and informative way. In addition, an improved version of the standard performance metrics is proposed: speedup, overhead and efficiency based on the model categorization that is state's aware. The evaluation shows that the improved version is more accurate and insightful in terms of OpenMP implementation. Moreover, an algorithmic approach to find patterns between OpenMP compilers is proposed, which is verified along with the model formulations experimentally. We also show the mathematical model behind the optimum performance for any OpenMP program.

Original languageEnglish
Pages (from-to)1325-1343
Number of pages19
JournalComputer Journal
Volume54
Issue number8
DOIs
Publication statusPublished - 1 Aug 2011
Externally publishedYes

Fingerprint

Mathematical models

Keywords

  • compilers
  • OpenMP
  • optimization
  • parallel programming
  • performance analysis

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

An abstract semantically rich compiler collocative and interpretative model for openmp programs. / Mokbel, Mohamed; Kent, Robert D.; Wong, Michael.

In: Computer Journal, Vol. 54, No. 8, 01.08.2011, p. 1325-1343.

Research output: Contribution to journalArticle

@article{15d1711149de42f0b0acec58efef7805,
title = "An abstract semantically rich compiler collocative and interpretative model for openmp programs",
abstract = "To understand the behavior of OpenMP programs, special tools and adaptive techniques are needed for performance analysis. However, these tools provide low-level profile information at the assembly and functions boundaries via instrumentation at the binary or code level, which are very hard to interpret. Moreover, to compare different OpenMP-enabled compilers, there is no systematic methodology that provides an easy comparison. Hence, in this paper, we propose a new model for OpenMP-enabled compilers that assesses the performance differences in well-defined formulations by dividing OpenMP program conditions into four distinct states which account for all the possible cases that an OpenMP program can take. The model works as a first-level inspector to reason about the effect of compiler performance on every state in an unobtrusive and informative way. In addition, an improved version of the standard performance metrics is proposed: speedup, overhead and efficiency based on the model categorization that is state's aware. The evaluation shows that the improved version is more accurate and insightful in terms of OpenMP implementation. Moreover, an algorithmic approach to find patterns between OpenMP compilers is proposed, which is verified along with the model formulations experimentally. We also show the mathematical model behind the optimum performance for any OpenMP program.",
keywords = "compilers, OpenMP, optimization, parallel programming, performance analysis",
author = "Mohamed Mokbel and Kent, {Robert D.} and Michael Wong",
year = "2011",
month = "8",
day = "1",
doi = "10.1093/comjnl/bxr029",
language = "English",
volume = "54",
pages = "1325--1343",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "8",

}

TY - JOUR

T1 - An abstract semantically rich compiler collocative and interpretative model for openmp programs

AU - Mokbel, Mohamed

AU - Kent, Robert D.

AU - Wong, Michael

PY - 2011/8/1

Y1 - 2011/8/1

N2 - To understand the behavior of OpenMP programs, special tools and adaptive techniques are needed for performance analysis. However, these tools provide low-level profile information at the assembly and functions boundaries via instrumentation at the binary or code level, which are very hard to interpret. Moreover, to compare different OpenMP-enabled compilers, there is no systematic methodology that provides an easy comparison. Hence, in this paper, we propose a new model for OpenMP-enabled compilers that assesses the performance differences in well-defined formulations by dividing OpenMP program conditions into four distinct states which account for all the possible cases that an OpenMP program can take. The model works as a first-level inspector to reason about the effect of compiler performance on every state in an unobtrusive and informative way. In addition, an improved version of the standard performance metrics is proposed: speedup, overhead and efficiency based on the model categorization that is state's aware. The evaluation shows that the improved version is more accurate and insightful in terms of OpenMP implementation. Moreover, an algorithmic approach to find patterns between OpenMP compilers is proposed, which is verified along with the model formulations experimentally. We also show the mathematical model behind the optimum performance for any OpenMP program.

AB - To understand the behavior of OpenMP programs, special tools and adaptive techniques are needed for performance analysis. However, these tools provide low-level profile information at the assembly and functions boundaries via instrumentation at the binary or code level, which are very hard to interpret. Moreover, to compare different OpenMP-enabled compilers, there is no systematic methodology that provides an easy comparison. Hence, in this paper, we propose a new model for OpenMP-enabled compilers that assesses the performance differences in well-defined formulations by dividing OpenMP program conditions into four distinct states which account for all the possible cases that an OpenMP program can take. The model works as a first-level inspector to reason about the effect of compiler performance on every state in an unobtrusive and informative way. In addition, an improved version of the standard performance metrics is proposed: speedup, overhead and efficiency based on the model categorization that is state's aware. The evaluation shows that the improved version is more accurate and insightful in terms of OpenMP implementation. Moreover, an algorithmic approach to find patterns between OpenMP compilers is proposed, which is verified along with the model formulations experimentally. We also show the mathematical model behind the optimum performance for any OpenMP program.

KW - compilers

KW - OpenMP

KW - optimization

KW - parallel programming

KW - performance analysis

UR - http://www.scopus.com/inward/record.url?scp=80051745133&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051745133&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxr029

DO - 10.1093/comjnl/bxr029

M3 - Article

VL - 54

SP - 1325

EP - 1343

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 8

ER -