On the public citation graph

Experience in the automatic parallelization of four Perfect-Benchmark programs

0 signed · 92 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/cpe.4330050704openalex-snapshot
Restructuring Fortran programs for Cedar
inferredcites →https://doi.org/10.1007/978-1-4684-6894-6openalex-snapshot
Dependence Analysis for Supercomputing
inferredcites →https://doi.org/10.1007/bf00162342openalex-snapshot
Cedar Fortran and other vector and parallel Fortran dialects
inferredcites →https://doi.org/10.1109/tse.1987.233477openalex-snapshot
A Scheme to Enforce Data Dependence on Large Multiprocessor Systems
inferredcites →https://doi.org/10.1126/science.231.4741.967openalex-snapshot
Parallel Supercomputing Today and the Cedar Approach
inferredcites →https://doi.org/10.1145/109025.109051openalex-snapshot
Compiler algorithms for event variable synchronization
inferredcites →https://doi.org/10.1145/255129.255163openalex-snapshot
Supercomputer performance evaluation and the Perfect Benchmarks
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/77726.255163openalex-snapshot
Supercomputer performance evaluation and the Perfect Benchmarks
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.4330050704openalex-snapshot
Restructuring Fortran programs for Cedar
inferred← citeshttps://doi.org/10.1002/cpe.5168openalex-snapshot
A study on popular auto‐parallelization frameworks
inferred← citeshttps://doi.org/10.1007/11596110_13openalex-snapshot
Parallel Reductions: An Application of Adaptive Algorithm Selection
inferred← citeshttps://doi.org/10.1007/3-540-35767-x_27openalex-snapshot
Polynomial Time Array Dataflow Analysis
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_7openalex-snapshot
Interprocedural Analysis Based on Guarded Array Regions
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_8openalex-snapshot
Automatic Array Privatization
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_7openalex-snapshot
Extending Scalar Optimizations for Arrays
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_13openalex-snapshot
Beyond Arrays — A Container-Centric Approach for Parallelization of Real-World Symbolic Applications
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_63openalex-snapshot
Data dependence and data-flow analysis of arrays
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_69openalex-snapshot
Symbolic program analysis and optimization for parallelizing compilers
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_29openalex-snapshot
Automatic array privatization
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_32openalex-snapshot
Symbolic analysis: A basis for parallelization, optimization, and scheduling of programs
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_35openalex-snapshot
Speculative Parallelization of Loops
inferred← citeshttps://doi.org/10.1007/978-3-322-87865-6_9openalex-snapshot
Subspace Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_5openalex-snapshot
Array Replication to Increase Parallelism in Applications Mapped to Configurable Architectures
inferred← citeshttps://doi.org/10.1007/bf02577866openalex-snapshot
A scalable method for run-time loop parallelization
inferred← citeshttps://doi.org/10.1007/bfb0002859openalex-snapshot
A limitation study into access decoupling
inferred← citeshttps://doi.org/10.1007/bfb0025876openalex-snapshot
Polaris: Improving the effectiveness of parallelizing compilers
inferred← citeshttps://doi.org/10.1007/s10766-015-0362-9openalex-snapshot
Locality-Aware Automatic Parallelization for GPGPU with OpenHMPP Directives
inferred← citeshttps://doi.org/10.1007/s11227-009-0340-3openalex-snapshot
Region-based parallelization of irregular reductions on explicitly managed memory hierarchies
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90195-qopenalex-snapshot
An empirical study of automatic restructuring of vision programs for simd machines
inferred← citeshttps://doi.org/10.1016/j.parco.2013.04.003openalex-snapshot
A novel compiler support for automatic parallelization on multicore systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00024-6openalex-snapshot
Run-time parallelization: Its time has come
inferred← citeshttps://doi.org/10.1023/a:1015460304860openalex-snapshot
Achieving Scalable Locality with Time Skewing
inferred← citeshttps://doi.org/10.1109/32.842950openalex-snapshot
Efficient interprocedural array data-flow analysis for automatic program parallelization
inferred← citeshttps://doi.org/10.1109/71.180621openalex-snapshot
Performance analysis pf parallelizing compilers on the Perfect Benchmarks programs
inferred← citeshttps://doi.org/10.1109/71.655238openalex-snapshot
On the automatic parallelization of the Perfect Benchmarks(R)
inferred← citeshttps://doi.org/10.1109/71.737695openalex-snapshot
Nonlinear and symbolic data dependence testing
inferred← citeshttps://doi.org/10.1109/71.752782openalex-snapshot
The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization
inferred← citeshttps://doi.org/10.1109/access.2022.3147846openalex-snapshot
A Survey of Performance Tuning Techniques and Tools for Parallel Applications
inferred← citeshttps://doi.org/10.1109/apdc.1997.574064openalex-snapshot
The design considerations and test results of AFT-a new generation parallelizing compiler
inferred← citeshttps://doi.org/10.1109/hicss.1994.323280openalex-snapshot
Extended SSA with factored use-def chains to support optimization and parallelism
inferred← citeshttps://doi.org/10.1109/hicss.1996.495467openalex-snapshot
Run-time parallelization for loops
inferred← citeshttps://doi.org/10.1109/icpp.1994.59openalex-snapshot
An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks
inferred← citeshttps://doi.org/10.1109/icppw.1996.538601openalex-snapshot
Restructuring programs for high-speed computers with Polaris
inferred← citeshttps://doi.org/10.1109/ipps.1997.580840openalex-snapshot
An efficient technique of instruction scheduling on a superscalar-based multiprocessor
inferred← citeshttps://doi.org/10.1109/ipps.1997.580952openalex-snapshot
On privatization of variables for data-parallel execution
inferred← citeshttps://doi.org/10.1109/isca.1993.698562openalex-snapshot
The Cedar System And An Initial Performance Study
inferred← citeshttps://doi.org/10.1109/iwia.2001.955200openalex-snapshot
An efficient algorithm for pointer-to-array access conversion for compiling and optimizing DSP applications
inferred← citeshttps://doi.org/10.1109/jproc.2004.840306openalex-snapshot
SPIRAL: Code Generation for DSP Transforms
inferred← citeshttps://doi.org/10.1109/pact.2001.953304openalex-snapshot
Architectural support for parallel reductions in scalable shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1109/sc.1998.10053openalex-snapshot
Techniques for Speculative Run-Time Parallelization of Loops
inferred← citeshttps://doi.org/10.1109/shpcc.1992.232630openalex-snapshot
On the influence of programming models on shared memory computer performance
inferred← citeshttps://doi.org/10.1109/superc.1994.344316openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
inferred← citeshttps://doi.org/10.1109/tpds.2006.131openalex-snapshot
An Adaptive Algorithm Selection Framework for Reduction Parallelization
inferred← citeshttps://doi.org/10.1145/1006209.1006226openalex-snapshot
A unified framework for nonlinear dependence testing and symbolic analysis
inferred← citeshttps://doi.org/10.1145/1274971.1275004openalex-snapshot
Active memory operations
inferred← citeshttps://doi.org/10.1145/143095.143131openalex-snapshot
Beyond induction variables
inferred← citeshttps://doi.org/10.1145/155332.155336openalex-snapshot
Experiences using the ParaScope Editor
inferred← citeshttps://doi.org/10.1145/156668.156692openalex-snapshot
Array privatization for shared and distributed memory machines (extended abstract)
inferred← citeshttps://doi.org/10.1145/158511.158515openalex-snapshot
Array-data flow analysis and its use in array privatization
inferred← citeshttps://doi.org/10.1145/165123.165157openalex-snapshot
The cedar system and an initial performance study
inferred← citeshttps://doi.org/10.1145/165939.165948openalex-snapshot
Toward a methodology of optimizing programs for high-performance computers
inferred← citeshttps://doi.org/10.1145/174675.177911openalex-snapshot
Lazy array data-flow dependence analysis
inferred← citeshttps://doi.org/10.1145/181181.181254openalex-snapshot
The privatizing DOALL test
inferred← citeshttps://doi.org/10.1145/183432.183525openalex-snapshot
Static analysis of upper and lower bounds on dependences and parallelism
inferred← citeshttps://doi.org/10.1145/197405.197406openalex-snapshot
Compiler transformations for high-performance computing
inferred← citeshttps://doi.org/10.1145/1993316.1993500openalex-snapshot
Commutative set
inferred← citeshttps://doi.org/10.1145/200994.201003openalex-snapshot
Beyond induction variables
inferred← citeshttps://doi.org/10.1145/2063348.2063374openalex-snapshot
A survey of the practice of computational science
inferred← citeshttps://doi.org/10.1145/207110.207148openalex-snapshot
The LRPD test
inferred← citeshttps://doi.org/10.1145/224170.224318openalex-snapshot
Symbolic array dataflow analysis for array privatization and program parallelization
inferred← citeshttps://doi.org/10.1145/224538.224553openalex-snapshot
Run-time methods for parallelizing partially parallel loops
inferred← citeshttps://doi.org/10.1145/224538.224655openalex-snapshot
Idiom recognition in the Polaris parallelizing compiler
inferred← citeshttps://doi.org/10.1145/231379.231390openalex-snapshot
Commutativity analysis
inferred← citeshttps://doi.org/10.1145/2491956.2462182openalex-snapshot
General data structure expansion for multi-threading
inferred← citeshttps://doi.org/10.1145/2591635.2667166openalex-snapshot
Array privatization for parallel execution of loops
inferred← citeshttps://doi.org/10.1145/2591635.2667180openalex-snapshot
Adaptive reduction parallelization techniques
inferred← citeshttps://doi.org/10.1145/267959.269969openalex-snapshot
Commutativity analysis
inferred← citeshttps://doi.org/10.1145/291889.291900openalex-snapshot
Constraint-based array dependence analysis
inferred← citeshttps://doi.org/10.1145/301104.301108openalex-snapshot
SUIF Explorer
inferred← citeshttps://doi.org/10.1145/335231.335238openalex-snapshot
Adaptive reduction parallelization techniques
inferred← citeshttps://doi.org/10.1145/602770.602858openalex-snapshot
The range test
inferred← citeshttps://doi.org/10.21236/ada554687openalex-snapshot
Adaptive Environment for Supercompiling with Optimized Parallelism (AESOP)
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2770openalex-snapshot
On-the-fly tracing for data-centric computing : parallelization, workflow and applications
inferred← citeshttps://doi.org/10.3233/jec-2012-0110openalex-snapshot
Parallelization of multimedia applications on the multi-level computing architecture
inferred← citeshttps://doi.org/10.5555/1025127.1026016openalex-snapshot
An Adaptive Algorithm Selection Framework
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.5555/645988.674301openalex-snapshot
Architectural Support for Parallel Reductions in Scalable Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96011openalex-snapshot
SIMD@OpenMP : a programming model approach to leverage SIMD features
inferred← citeshttps://doi.org/10.6083/hq37vn90nopenalex-snapshot
Detecting induction variables using SSA form
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.