Automatic Array Privatization

No abstract is available for this paper.

• Publication year

  1993

• Venue

  Compiler Optimizations for Scalable Parallel Systems Languages

• Publication date

  1993-08-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-45403-9_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient building and placing of gating functions

  1995cited by this paper
• Beyond induction variables

  1995cited by this paper
• Polaris: Improving the Effectiveness of Parallelizing Compilers

  1994cited by this paper
• The range test: a dependence test for symbolic, non-linear expressions

  1994cited by this paper
• An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks

  1994cited by this paper
• Array privatization for shared and distributed memory machines (extended abstract)

  1993cited by this paper
• Construction of Thinned Gated Single-Assignment Form

  1993cited by this paper
• Array privatization for parallel execution of loops

  1992cited by this paper
• Beyond induction variables

  1992cited by this paper
• Data Dependence and Data-Flow Analysis of Arrays

  1992cited by this paper
• Symbolic Program Analysis and Optimization for Parallelizing Compilers

  1992cited by this paper
• Array privatization for parallel execution of loops

  1992cited by this paper
• Abstract Interpretation and Application to Logic Programs

  1992cited by this paper
• Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs

  1991cited by this paper
• Efficiently computing static single assignment form and the control dependence graph

  1991cited by this paper
• Constant propagation with conditional branches

  1991cited by this paper
• Supercompilers for parallel and vector computers

  1990cited by this paper
• The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages

  1990cited by this paper
• Automatic recognition of induction variables and recurrence relations by abstract interpretation

  1990cited by this paper
• Process decomposition through locality of reference

  1989cited by this paper
• Detecting equality of variables in programs

  1988cited by this paper
• Analysis of interprocedural side effects in a parallel programming environment

  1988cited by this paper
• Dependence analysis for supercomputing

  1988cited by this paper
• Global value numbers and redundant computations

  1988cited by this paper
• Array expansion

  1988cited by this paper
• SUPERB: A tool for semi-automatic MIMD/SIMD parallelization

  1988cited by this paper
• What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation

  1987cited by this paper
• A Scheme to Enforce Data Dependence on Large Multiprocessor Systems

  1987cited by this paper
• Advanced compiler optimizations for supercomputers

  1986cited by this paper
• Compilers: Principles, Techniques, and Tools

  1986cited by this paper
• Applications of symbolic evaluation

  1985cited by this paper
• The program dependence graph and its use in optimization

  1984cited by this paper
• Symbolic Evaluation and the Analysis of Programs

  1979cited by this paper
• Automatic discovery of linear restraints among variables of a program

  1978cited by this paper
• Subgoal induction

  1977cited by this paper

• Automatic and Interactive Program Parallelization Using the Cetus Source to Source Compiler Infrastructure v2.0

  2022cites this paper
• HPVM2FPGA: Enabling True Hardware-Agnostic FPGA Programming

  2022cites this paper
• A Sensible Approach to Speculative Automatic Parallelization

  2021cites this paper
• On the automatic parallelization of subscripted subscript patterns using array property analysis

  2021cites this paper
• Perspective: A Sensible Approach to Speculative Automatic Parallelization

  2020cites this paper
• Polyhedral Dataflow Graphs

  2019cites this paper
• A study on popular auto‐parallelization frameworks

  2019cites this paper
• Compile-time Parallelization of Subscripted Subscript Patterns

  2019cites this paper
• Source-to-source compilation targeting OpenMP-based automatic parallelization of C applications

  2019cites this paper
• A Structured Grid Solver with Polyhedral+Dataflow Representation

  2019cites this paper
• Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code

  2018cites this paper
• Tiramisu : A Polyhedral Compiler with A Scheduling Language for Targeting High Performance Systems Riyadh

  2018cites this paper
• Incremental Banerjee test conditions committing for robust parallelization framework

  2018cites this paper
• Programming Abstractions and Synthesis-Aided Compilation for Emerging Computing Platforms

  2018cites this paper
• Mejorando el rendimiento de la memoria transaccional para aplicaciones irregulares

  2018cites this paper
• Tiramisu: A Code Optimization Framework for High Performance Systems

  2018cites this paper
• Technical Report about Tiramisu: a Three-Layered Abstraction for Hiding Hardware Complexity from DSL Compilers

  2018cites this paper
• Application of the LLVM Compiler Infrastructure to the Program Analysis in SAPFOR

  2018cites this paper
• Accelerating Dynamically-Typed Languages on Heterogeneous Platforms Using Guards Optimization

  2018cites this paper
• The experience of using DVM and SAPFOR systems in semi automatic parallelization of an application for 3D modeling in geophysics

  2018cites this paper
• LLVM Based Approach to Static Analysis of C Programs in SAPFOR

  2018cites this paper
• POSTER: An Architecture and Programming Model for Accelerating Parallel Commutative Computations via Privatization

  2017cites this paper
• Runtime-adaptive generalized task parallelism

  2017cites this paper
• Flexible Support for Fast Parallel Commutative Updates

  2017cites this paper
• Discovering and exploiting parallelism in DOACROSS loops

  2016cites this paper
• Variable Liberalization

  2016cites this paper
• Introducing Task-Containers as an Alternative to Runtime-Stacking

  2016cites this paper
• Improving Transactional Memory Performance for Irregular Applications

  2015cites this paper
• Static Dependence Analysis in an Infrastructure for Automatic Parallelization

  2015cites this paper
• Generalized Task Parallelism

  2015cites this paper
• Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation. (Amélioration du tuilage, réduction du temps de compilation, et extension de l'utilisabilité de la compilation polyédrique)

  2015cites this paper
• Paralelización Automática Basada en Memoria Transaccional

  2014cites this paper
• Multiplex : Unifying Conventional and Speculative Thread-Level Parallelism on a Chip Multiprocessor

  2013cites this paper
• Improved loop tiling based on the removal of spurious false dependences

  2013cites this paper
• The Cetus Source-to-Source Compiler Infrastructure: Overview and Evaluation

  2013cites this paper
• General data structure expansion for multi-threading

  2013cites this paper
• Prywatyzacja zmiennych skalarnych dla wyznaczania równoległości w pętlach programowych

  2012cites this paper
• Automatic privatization for parallel execution of loops

  2012cites this paper
• Speculative separation for privatization and reductions

  2012influential citation
• Automatic Parallelization in the Paralax Compiler

  2011cites this paper
• Speculative Parallelization of Loops

  2011cites this paper
• Efficient search-based strategies for polyhedral compilation : algorithms and experience in a production compiler. (Stratégies exploratoires efficaces pour la compilation polyédrique : algorithmes et expérience dans un compilateur de production)

  2011cites this paper
• Trading Off Memory For Parallelism Quality

  2011cites this paper
• Compilation pour cibles hétérogènes : automatisation des analyses, transformations et décisions nécessaires

  2011cites this paper
• Compilation for Heterogeneous Computing: Automating Analyses, Transformations and Decisions

  2011cites this paper
• The paralax infrastructure: Automatic parallelization with a helping hand

  2010cites this paper
• IBM Research Report Parallelizing Loops in Parallel Programs

  2010cites this paper
• Parallelization spectroscopy: analysis of thread-level parallelism in hpc programs

  2009cites this paper
• Prefetching with Helper Threads for Loosely Coupled Multiprocessor Systems

  2009cites this paper
• Reducing memory requirements of resource-constrained applications

  2009cites this paper
• Cetus: A Source-to-Source Compiler Infrastructure for Multicores

  2009cites this paper
• Prefetching with Helper Threads for Loosely

  2009cites this paper
• Automatically Tuning Collective Communication for One-Sided Programming Models

  2009cites this paper
• Effective automatic parallelization and locality optimization using the polyhedral model

  2008cites this paper
• R-Stream 3.0 Compiler

  2008cites this paper
• Programming and compiling for embedded SIMD architectures

  2008cites this paper
• The velocity compiler: extracting efficient multicore execution from legacy sequential codes

  2008cites this paper
• Deep Jam: Conversion of Coarse-Grain Parallelism to Fine-Grain and Vector Parallelism

  2007cites this paper
• RUN-TIME METHODS FOR PARALLELIZING DO LOOPSy

  2007cites this paper
• Computational Alignment: A New, Uni ed Program Transformation for Local and Global Optimization

  2007cites this paper
• Code-size conscious pipelining of imperfectly nested loops

  2007cites this paper
• Traced Based Dependence Analysis for Speculative Loop Optimizations

  2007cites this paper
• Traced Based Dependence Analysis for Speculative Loop Optimizations Acknowledgements I Would like to Acknowledge the following People for Their Support in Completing

  2007cites this paper
• On the Machine-independent Target Language for Parallelizing Compilers

  2007cites this paper
• MPSoC memory optimization using program transformation

  2007cites this paper
• Run-Time Parallelization Requires Static Compiler Analysis

  2007cites this paper
• Run-time Parallelization Techniques for Sparse Applications

  2007cites this paper
• Multidimensional Blocking in UPC

  2007cites this paper
• System Support for Implicitly Parallel Programming

  2007cites this paper
• Contributions to the Design of Reliable and Programmable High-Performance Systems: Principles, Interfaces, Algorithms and Tools. (Contributions à la conception de systèmes à hautes performances, programmables et sûrs: principes, interfaces, algorithmes et outils)

  2007cites this paper
• Eecient Interprocedural Array Data--ow Analysis for Automatic Program Parallelization Accepted to Ieee Transactions on Software Engineering, the Special Issue on Architecture-independent Lan- Guages and Software Tools for Parallel Processing

  2007cites this paper
• Can Transactions Enhance Parallel Programs?

  2006cites this paper
• Exploiting reference idempotency to reduce speculative storage overflow

  2006cites this paper
• GRAPHITE : Polyhedral Analyses and Optimizations for GCC

  2006cites this paper
• An interblock VLIW-targeted instruction scheduler for GCC

  2006cites this paper
• Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies

  2006cites this paper
• BMDFM: a hybrid dataflow runtime parallelization environment for shared memory multiprocessors

  2006cites this paper
• Scientific Computing Optimizations for Alpha 44 DXML : A High-performance Scientific Subroutine

  2006cites this paper
• Region array SSA

  2006cites this paper
• On Extracting Coarse-Grained Function Parallelism From C Programs

  2006cites this paper
• On the performance potential of different types of speculative thread-level parallelism: The DL version of this paper includes corrections that were not made available in the printed proceedings

  2006cites this paper
• Scalable Array SSA and Array Data Flow Analysis

  2005cites this paper
• Joining dataflow with predicates

  2005cites this paper
• Interprocedural parallelization analysis in SUIF

  2005cites this paper
• Project-Team DaRT Dataparallelism for Real-Time Futurs

  2005cites this paper
• Deep jam: conversion of coarse-grain parallelism to instruction-level and vector parallelism for irregular applications

  2005cites this paper
• Array Replication to Increase Parallelism in Applications Mapped to Configurable Architectures

  2005cites this paper
• Applications of storage mapping optimization to register promotion

  2004cites this paper
• Major Subject: Computer ScienceROUTING ALGORITHMS FOR LARGE SCALE WIRELESS SENSOR NETWORKS

  2004cites this paper
• Performance of OSCAR Multigrain Parallelizing Compiler on SMP Servers

  2004cites this paper
• Loop Transformations for Reducing Data Space Requirements of Resource-Constrained Applications

  2003cites this paper
• SUDS: automatic parallelization for raw processors

  2003cites this paper
• Facilitating the Exploration of Compositions of Program Transformations

  2003cites this paper
• OpenMP and Compilation Issue in Embedded Applications

  2003cites this paper
• Compiler framework for the automatic detection of loop-level parallelism

  2003cites this paper
• Improving the Performance of OpenMP by Array Privatization

  2003cites this paper
• Redundant computation partition on distributed-memory systems

  2002cites this paper
• Automatic Compilation of Loops to Exploit Operator Parallelism on Configurable Arithmetic Logic Units

  2002cites this paper
• Multigrain automatic parallelization in Japanese Millennium Project IT21. Advanced Parallelizing Compiler

  2002cites this paper
• The R-LRPD test: speculative parallelization of partially parallel loops

  2002cites this paper