• Home
  • Search
  • Using integer sets for data-parallel program analysis and optimization
  • Cite Icon76
  • https://doi.org/10.1145/277650.277721Copy DOI Icon

Using integer sets for data-parallel program analysis and optimization

  • May 1, 1998
  • Vikram Adve +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we describe our experience with using an abstract integer-set framework to develop the Rice dHPF compiler, a compiler for High Performance Fortran. We present simple, yet general formulations of the major computation partitioning and communication analysis tasks as well as a number of important optimizations in terms of abstract operations on sets of integer tuples. This approach has made it possible to implement a comprehensive collection of advanced optimizations in dHPF, and to do so in the context of a more general computation partitioning model than previous compilers. One potential limitation of the approach is that the underlying class of integer set problems is fundamentally unable to represent HPF data distributions on a symbolic number of processors. We describe how we extend the approach to compile codes for a symbolic number of processors, without requiring any changes to the set formulations for the above optimizations. We show experimentally that the set re...

Similar Papers
  • Research Article
  • Citations4

Using integer sets for data-parallel program analysis and optimization

  • May 01, 1998
  • ACM SIGPLAN Notices
  • Vikram Adve +1
  • Conference Article

Distributed compilation metrics (abstract)

  • Jan 01, 1990
  • Donal Gotterbarn +1
  • Conference Article
  • Citations90

Cache aware optimization of stream programs

  • Jun 15, 2005
  • Janis Sermulins +3
  • Research Article
  • Citations20

Cache aware optimization of stream programs

  • Jun 15, 2005
  • ACM SIGPLAN Notices
  • Janis Sermulins +3
  • Conference Article
  • Citations6

Source Code Partitioning in Program Optimization

  • Dec 01, 2011
  • Murat Bolat +3
  • Single Report

Investigate Methods to Decrease Compilation Time-AX-Program Code Group Computer Science R& D Project

  • Jun 11, 2003
  • T Cottom
  • Research Article
  • Citations1

The efficient computation of ownership sets in HPF

  • Jan 01, 2001
  • IEEE Transactions on Parallel and Distributed Systems
  • P.G Joisha +1
  • Book Chapter
  • Citations10

Compiling HPF for Distributed Memory MIMD Computers

  • Jan 01, 1994
  • Zeki Bozkus +4
  • Research Article
  • Citations83

Compiling Fortran 90D/HPF for Distributed Memory MIMD Computers

  • Apr 01, 1994
  • Journal of Parallel and Distributed Computing
  • Z Bozkus +5
  • Conference Article
  • Citations3

Intelligent Task Mapping Using Machine Learning

  • Dec 01, 2010
  • Dirk Tetzlaff +1
  • Research Article
  • Citations1

Results on set representations of graphs

  • Jan 01, 2012
  • University of Alberta Library
  • Lorna Stewart +1
  • Research Article
  • Citations15

Flow analysis of dynamic logic programs

  • Sep 01, 1989
  • The Journal of Logic Programming
  • Saumya K Debray
  • Supplementary Content
  • Citations2

Algorithms for Network Design and Routing Problems

  • Apr 20, 2009
  • AMS Dottorato Institutional Doctoral Theses Repository (University of Bologna)
  • Enrico Bartolini
  • Research Article
  • Citations12

Integer linear programming vs. graph-based methods in code generation

  • Jan 01, 1998
  • Publications of the UdS (Saarland University)
  • Daniel L Kastner +1
  • PDF
  • Research Article
  • Citations254

Milepost GCC: Machine Learning Enabled Self-tuning Compiler

  • Jan 07, 2011
  • International Journal of Parallel Programming
  • Grigori Fursin +16
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.