On the public citation graph
Polaris: Improving the effectiveness of parallelizing compilers
0 signed · 90 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45403-9_8openalex-snapshot
Automatic Array Privatization
inferredcites →https://doi.org/10.1007/978-1-4684-6894-6openalex-snapshot
Dependence Analysis for Supercomputing
inferredcites →https://doi.org/10.1007/bf01379099openalex-snapshot
Data dependence and its application to parallel processing
inferredcites →https://doi.org/10.1007/bf02577778openalex-snapshot
The polaris internal representation
inferredcites →https://doi.org/10.1007/bfb0038658openalex-snapshot
Experience in the automatic parallelization of four Perfect-Benchmark programs
inferredcites →https://doi.org/10.1016/0743-7315(91)90019-6openalex-snapshot
On the accuracy of the Banerjee test
inferredcites →https://doi.org/10.1109/12.88484openalex-snapshot
Run-time parallelization and scheduling of loops
inferredcites →https://doi.org/10.1109/71.180621openalex-snapshot
Performance analysis pf parallelizing compilers on the Perfect Benchmarks programs
inferredcites →https://doi.org/10.1109/icpp.1994.59openalex-snapshot
An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks
inferredcites →https://doi.org/10.1145/125826.126055openalex-snapshot
Interprocedural transformations for parallel code generation
inferredcites →https://doi.org/10.1145/165939.165961openalex-snapshot
Static and dynamic evaluation of data dependence analysis
inferredcites →https://doi.org/10.1177/109434208900300302openalex-snapshot
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
inferredcites →https://doi.org/10.5555/602770.602858openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(200002/03)12:2/3<125::aid-cpe469>3.0.co;2-hopenalex-snapshot
A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
inferred← citeshttps://doi.org/10.1007/11532378_20openalex-snapshot
MSA: Multiphase Specifically Shared Arrays
inferred← citeshttps://doi.org/10.1007/11596110_19openalex-snapshot
Performance Analysis of Symbolic Analysis Techniques for Parallelizing Compilers
inferred← citeshttps://doi.org/10.1007/3-540-44854-3_8openalex-snapshot
PolyAPM: Parallel Programming via Stepwise Refinement with Abstract Parallel Machines
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_24openalex-snapshot
Designing the Agassiz Compiler for Concurrent Multithreaded Architectures
inferred← citeshttps://doi.org/10.1007/3-540-45306-7_9openalex-snapshot
Efficient Symbolic Analysis for Optimizing Compilers
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_16openalex-snapshot
Advanced Code Generation for High Performance Fortran
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_8openalex-snapshot
Automatic Array Privatization
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_13openalex-snapshot
Adaptive Load Balancing for MPI Programs
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_21openalex-snapshot
Principles of Speculative Run—Time Parallelization
inferred← citeshttps://doi.org/10.1007/3-540-49530-4_4openalex-snapshot
On the Automatic Parallelization of Sparse and Irregular Fortran Programs
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_29openalex-snapshot
Automatic array privatization
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_20openalex-snapshot
Loop Selection for Thread-Level Speculation
inferred← citeshttps://doi.org/10.1007/978-3-642-03644-6_30openalex-snapshot
Parallelization Strategies for Mixed Regular-Irregular Applications on Multicore-Systems
inferred← citeshttps://doi.org/10.1007/bfb0014197openalex-snapshot
Demand-driven, symbolic range propagation
inferred← citeshttps://doi.org/10.1007/bfb0017258openalex-snapshot
Automatic parallelization for non-cache coherent multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0017282openalex-snapshot
Automatic data and computation partitioning on scalable shared memory multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0032695openalex-snapshot
Simplifying control flow in compiler-generated parallel code
inferred← citeshttps://doi.org/10.1007/bfb0097989openalex-snapshot
A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
inferred← citeshttps://doi.org/10.1007/s10766-012-0229-2openalex-snapshot
Extensible Recognition of Algorithmic Patterns in DSP Programs for Automatic Parallelization
inferred← citeshttps://doi.org/10.1007/s10766-021-00722-1openalex-snapshot
Enhancing the Effectiveness of Inlining in Automatic Parallelization
inferred← citeshttps://doi.org/10.1016/j.cl.2006.03.002openalex-snapshot
Costing stepwise refinements of parallel programs
inferred← citeshttps://doi.org/10.1016/j.scico.2011.06.004openalex-snapshot
Parallel execution of Java loops on Graphics Processing Units
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1023/a:1015781018449openalex-snapshot
High-level Language Support for User-defined Reductions
inferred← citeshttps://doi.org/10.1023/a:1018743102645openalex-snapshot
Quantitative Evaluation of Register Pressure on Software Pipelined Loops
inferred← citeshttps://doi.org/10.1023/a:1018776615791openalex-snapshot
Simplifying Control Flow in Compiler-Generated Parallel Code
inferred← citeshttps://doi.org/10.1109/40.502406openalex-snapshot
Multiprocessors from a software perspective
inferred← citeshttps://doi.org/10.1109/71.577265openalex-snapshot
Fusion of loops for parallelism and locality
inferred← citeshttps://doi.org/10.1109/71.629489openalex-snapshot
Vienna-Fortran/HPF extensions for sparse and irregular problems and their compilation
inferred← citeshttps://doi.org/10.1109/71.737695openalex-snapshot
Nonlinear and symbolic data dependence testing
inferred← citeshttps://doi.org/10.1109/71.888633openalex-snapshot
A unified symbolic evaluation framework for parallelizing compilers
inferred← citeshttps://doi.org/10.1109/aero.2011.5747449openalex-snapshot
The design of a fault-tolerant, real-time, multi-core computer system
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370332openalex-snapshot
Progressive Raising in Multi-level IR
inferred← citeshttps://doi.org/10.1109/csit.2014.6805991openalex-snapshot
An analytical model for estimating execution cost of 1D array expressions
inferred← citeshttps://doi.org/10.1109/hicss.1996.495467openalex-snapshot
Run-time parallelization for loops
inferred← citeshttps://doi.org/10.1109/hpc.2000.843593openalex-snapshot
A comparison based tool for checking parallelized large sequential programs
inferred← citeshttps://doi.org/10.1109/hpcc.2008.145openalex-snapshot
Discovering Maximum Parallelization Using Advanced Data Dependence Analysis
inferred← citeshttps://doi.org/10.1109/iccae.2010.5451995openalex-snapshot
Recursive symbolic bound analysis in loop structure
inferred← citeshttps://doi.org/10.1109/icpp.1997.622557openalex-snapshot
Automatic partitioning of data and computations on scalable shared memory multiprocessors
inferred← citeshttps://doi.org/10.1109/icpp.2010.12openalex-snapshot
Gossamer: A Lightweight Approach to Using Multicore Machines
inferred← citeshttps://doi.org/10.1109/icpp.2011.68openalex-snapshot
Enhancing the Role of Inlining in Effective Interprocedural Parallelization
inferred← citeshttps://doi.org/10.1109/isca.2003.1207020openalex-snapshot
The Jrpm system for dynamically parallelizing Java programs
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.89openalex-snapshot
Communication-Aware Parallelization Strategies for High Performance Applications
inferred← citeshttps://doi.org/10.1109/iwia.1997.670416openalex-snapshot
OSCAR multi-grain architecture and its evaluation
inferred← citeshttps://doi.org/10.1109/iwia.2004.10018openalex-snapshot
Array Data Dependence Testing with the Chains of Recurrences Algebra
inferred← citeshttps://doi.org/10.1109/pact.1997.644011openalex-snapshot
Interprocedural array remapping
inferred← citeshttps://doi.org/10.1109/spdp.1996.570326openalex-snapshot
A heterogeneous hierarchical solution to cost-efficient high performance computing
inferred← citeshttps://doi.org/10.1109/tse.2005.26openalex-snapshot
Retargeting sequential image-processing programs for data parallel execution
inferred← citeshttps://doi.org/10.1134/s0361768809020066openalex-snapshot
Automatic reconstruction of data types in the decompilation problem
inferred← citeshttps://doi.org/10.1145/1057387.1057388openalex-snapshot
Symbolic bounds analysis of pointers, array indices, and accessed memory regions
inferred← citeshttps://doi.org/10.1145/1113830.1113835openalex-snapshot
Compiler-directed high-level energy estimation and optimization
inferred← citeshttps://doi.org/10.1145/1596655.1596670openalex-snapshot
Automatic parallelization for graphics processing units
inferred← citeshttps://doi.org/10.1145/2038698.2038730openalex-snapshot
Localizing globals and statics to make C programs thread-safe
inferred← citeshttps://doi.org/10.1145/209936.209952openalex-snapshot
Compiler optimizations for eliminating barrier synchronization
inferred← citeshttps://doi.org/10.1145/2134243.2134253openalex-snapshot
Limits of parallelism using dynamic dependency graphs
inferred← citeshttps://doi.org/10.1145/224170.224337openalex-snapshot
Detecting coarse-grain parallelism using an interprocedural parallelizing compiler
inferred← citeshttps://doi.org/10.1145/224538.224546openalex-snapshot
Unified compilation techniques for shared and distributed address space machines
inferred← citeshttps://doi.org/10.1145/224538.224648openalex-snapshot
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers
inferred← citeshttps://doi.org/10.1145/224538.224655openalex-snapshot
Idiom recognition in the Polaris parallelizing compiler
inferred← citeshttps://doi.org/10.1145/237578.237627openalex-snapshot
A MATLAB to Fortran 90 translator and its effectiveness
inferred← citeshttps://doi.org/10.1145/237578.237635openalex-snapshot
Improving single-process performance with multithreaded processors
inferred← citeshttps://doi.org/10.1145/3563349openalex-snapshot
Veracity: declarative multicore programming with commutativity
inferred← citeshttps://doi.org/10.1145/3649308openalex-snapshot
Homeostasis: Design and Implementation of a Self-Stabilizing Compiler
inferred← citeshttps://doi.org/10.1145/377792.377831openalex-snapshot
Computer aided hand tuning (CAHT)
inferred← citeshttps://doi.org/10.1145/859618.859668openalex-snapshot
The Jrpm system for dynamically parallelizing Java programs
inferred← citeshttps://doi.org/10.1145/871656.859668openalex-snapshot
The Jrpm system for dynamically parallelizing Java programs
inferred← citeshttps://doi.org/10.1155/1999/108763openalex-snapshot
On the Automatic Parallelization of Sparse and Irregular Fortran Programs
inferred← citeshttps://doi.org/10.3390/computers15090606openalex-snapshot
An Automated Evolutionary Modularization Approach for Performance-Aware Parallelization of Sequential Source Code
inferred← citeshttps://doi.org/10.47749/t/unicamp.2024.1379182openalex-snapshot
Source matching and rewriting for MLIR using string-based automata
inferred← citeshttps://doi.org/10.5555/602770.602858openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
inferred← citeshttps://doi.org/10.70675/eb0f178czd7a4z429cz8c3bz1c08386111b2openalex-snapshot
Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.