A Parallelism Profiler with What-If Analyses for OpenMP Programs

被引:0
|
作者
Boushehrinejadmoradi, Nader [1 ]
Yoga, Adarsh [1 ]
Nagarakatte, Santosh [1 ]
机构
[1] Rutgers State Univ, Dept Comp Sci, Piscataway, NJ 08854 USA
关键词
Parallel programming; Performance analysis;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes OMP-WHIP, a profiler that measures inherent parallelism in the program for a given input and provides what-if analyses to estimate improvements in parallelism. We propose a novel OpenMP series-parallel graph representation (OSPG) that precisely captures series-parallel relations induced by various directives between different fragments of dynamic execution. OMP-WHIP constructs the OSPG and measures the computation performed by each dynamic fragment using hardware performance counters. This series-parallel representation along with measurement of computation is a performance model of the program for a given input, which enables computation of inherent parallelism. This novel performance model also enables what-if analyses where a programmer can estimate improvements in parallelism when bottlenecks are addressed. We have used OMP-WHIP to identify parallelism bottlenecks in more than forty applications and then designed strategies to improve the speedup in seven applications.
引用
收藏
页数:14
相关论文
共 50 条
  • [11] The What-If Scenario
    不详
    [J]. FORTUNE, 2008, 158 (10) : 4 - 4
  • [12] The science of 'what-if?'
    Ravetz, JR
    [J]. FUTURES, 1997, 29 (06) : 533 - 539
  • [13] Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs
    Herodotou, Herodotos
    Babu, Shivnath
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (11): : 1111 - 1122
  • [14] Flexible control structures for parallelism in OpenMP
    Shah, S
    Haab, G
    Petersen, P
    Throop, J
    [J]. CONCURRENCY-PRACTICE AND EXPERIENCE, 2000, 12 (12): : 1219 - 1239
  • [15] Parallelism for free: Efficient and optimal bitvector analyses for parallel programs
    Knoop, J
    Steffen, B
    Vollmer, J
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1996, 18 (03): : 268 - 299
  • [16] THE WHAT-IF OF COUNTING
    SHIPLEY, EF
    SHEPPERSON, B
    [J]. COGNITION, 1990, 36 (03) : 285 - 289
  • [17] Efficient dynamic parallelism with OpenMP on Linux SMPs
    Antonopoulos, CD
    Venetis, IE
    Nikolopoulos, DS
    Papatheodorou, TS
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 2507 - 2513
  • [18] Support of multidimensional parallelism in the OpenMP programming model
    Jin, HQ
    Jost, G
    [J]. HIGH PERFORMANCE COMPUTING, 2003, 2858 : 511 - 522
  • [19] Load balancing and OpenMP implementation of nested parallelism
    Blikberg, R
    Sorevik, T
    [J]. PARALLEL COMPUTING, 2005, 31 (10-12) : 984 - 998
  • [20] An improvement of OpenMP pipeline parallelism with the BatchQueue algorithm
    Preud'homme, Thomas
    Sopena, Julien
    Thomas, Gael
    Folliot, Bertil
    [J]. PROCEEDINGS OF THE 2012 IEEE 18TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2012), 2012, : 348 - 355