• Home
  • Search
  • A Transformation Framework for Optimizing Task-Parallel Programs
  • Cite Icon35
  • https://doi.org/10.1145/2450136.2450138Copy DOI Icon

A Transformation Framework for Optimizing Task-Parallel Programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Task parallelism has increasingly become a trend with programming models such as OpenMP 3.0, Cilk, Java Concurrency, X10, Chapel and Habanero-Java (HJ) to address the requirements of multicore programmers. While task parallelism increases productivity by allowing the programmer to express multiple levels of parallelism, it can also lead to performance degradation due to increased overheads. In this article, we introduce a transformation framework for optimizing task-parallel programs with a focus on task creation and task termination operations. These operations can appear explicitly in constructs such as async, finish in X10 and HJ, task, taskwait in OpenMP 3.0, and spawn, sync in Cilk, or implicitly in composite code statements such as foreach and ateach loops in X10, forall and foreach loops in HJ, and parallel loop in OpenMP. Our framework includes a definition of data dependence in task-parallel programs, a happens-before analysis algorithm, and a range of program transformations for optimizing task parallelism. Broadly, our transformations cover three different but interrelated optimizations: (1) finish-elimination , (2) forall-coarsening , and (3) loop-chunking . Finish-elimination removes redundant task termination operations, forall-coarsening replaces expensive task creation and termination operations with more efficient synchronization operations, and loop-chunking extracts useful parallelism from ideal parallelism. All three optimizations are specified in an iterative transformation framework that applies a sequence of relevant transformations until a fixed point is reached. Further, we discuss the impact of exception semantics on the specified transformations, and extend them to handle task-parallel programs with precise exception semantics. Experimental results were obtained for a collection of task-parallel benchmarks on three multicore platforms: a dual-socket 128-thread (16-core) Niagara T2 system, a quad-socket 16-core Intel Xeon SMP, and a quad-socket 32-core Power7 SMP. We have observed that the proposed optimizations interact with each other in a synergistic way, and result in an overall geometric average performance improvement between 6.28× and 10.30×, measured across all three platforms for the benchmarks studied.

Similar Papers
  • Conference Article
  • Citations39

Characterizing and mitigating work time inflation in task parallel programs

  • Nov 10, 2012
  • Stephen L Olivier +3
  • Conference Article
  • Citations21

Parallel data race detection for task parallel programs with locks

  • Nov 01, 2016
  • Adarsh Yoga +2
  • Research Article
  • Citations2

JPF Verification of Habanero Java Programs using Gradual Type Permission Regions

  • Feb 06, 2015
  • ACM SIGSOFT Software Engineering Notes
  • Peter Anderson +3
  • Conference Article
  • Citations9

TFProf: Profiling Large Taskflow Programs with Modern D3 and C++

  • Nov 01, 2021
  • Tsung-Wei Huang
  • Conference Article
  • Citations31

Machine-Learning-based Performance Heuristics for Runtime CPU/GPU Selection

  • Sep 08, 2015
  • Akihiro Hayashi +3
  • Conference Article

A Quest for Unified, Global View Parallel Programming Models for Our Future

  • Jun 01, 2016
  • Kenjiro Taura
  • Conference Article
  • Citations55

A work-stealing scheduler for X10's task parallelism with suspension

  • Feb 25, 2012
  • Olivier Tardieu +2
  • Conference Article
  • Citations95

Integrating Asynchronous Task Parallelism with MPI

  • May 01, 2013
  • Sanjay Chatterjee +7
  • Conference Article
  • Citations37

Communication and memory requirements as the basis for mapping task and data parallel programs

  • Nov 14, 1994
  • Jaspal Subhlok +4
  • Conference Article
  • Citations1

Array Bounds Check Elimination for Java Based on Sparse Representation

  • Jan 01, 2009
  • Keqiao Yang +2
  • Conference Article
  • Citations56

Automatic parallelization for graphics processing units

  • Aug 27, 2009
  • Alan Leung +2
  • Book Chapter
  • Citations110

Hierarchical Place Trees: A Portable Abstraction for Task Parallelism and Data Movement

  • Jan 01, 2010
  • Yonghong Yan +3
  • Book Chapter
  • Citations33

Dynamic Task Parallelism with a GPU Work-Stealing Runtime System

  • Jan 01, 2013
  • Sanjay Chatterjee +3
  • Conference Article
  • Citations4

Parallelization of FIVE method on multicore embedded system

  • May 01, 2018
  • Roland Bartok +1
  • Book Chapter
  • Citations4

Performance Evaluation of Compiler Controlled Power Saving Scheme

  • Sep 07, 2005
  • Jun Shirako +7
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.