On the public citation graph
A scalable method for run-time loop parallelization
0 signed · 101 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/3-540-57502-2_63openalex-snapshot
Data dependence and data-flow analysis of arrays
inferredcites →https://doi.org/10.1007/3-540-57659-2_29openalex-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/bf00129843openalex-snapshot
Automatic generation of nested, fork-join parallelism
inferredcites →https://doi.org/10.1007/bf00162342openalex-snapshot
Cedar Fortran and other vector and parallel Fortran dialects
inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot
Efficient parallel algorithms for graph problems
inferredcites →https://doi.org/10.1007/bfb0025896openalex-snapshot
Autoscheduling in a distributed shared-memory environment
inferredcites →https://doi.org/10.1007/bfb0038658openalex-snapshot
Experience in the automatic parallelization of four Perfect-Benchmark programs
inferredcites →https://doi.org/10.1109/12.2249openalex-snapshot
Compiler optimizations for enhancing parallelism and their impact on architecture design
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/ipps.1995.395955openalex-snapshot
Parallelizing while loops for multiprocessor systems
inferredcites →https://doi.org/10.1109/superc.1988.44644openalex-snapshot
Cedar Fortran and other vector and parallel Fortran dialects
inferredcites →https://doi.org/10.1109/tc.1987.5009499openalex-snapshot
Compiler Algorithms for Synchronization
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.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/143369.143426openalex-snapshot
Array privatization for parallel execution of loops
inferredcites →https://doi.org/10.1145/155332.155341openalex-snapshot
Improving the performance of runtime parallelization
inferredcites →https://doi.org/10.1145/173284.155341openalex-snapshot
Improving the performance of runtime parallelization
inferredcites →https://doi.org/10.1145/175276.175279openalex-snapshot
Massively parallel methods for engineering and science problems
inferredcites →https://doi.org/10.1145/224538.224553openalex-snapshot
Run-time methods for parallelizing partially parallel loops
inferredcites →https://doi.org/10.1145/2591635.2667166openalex-snapshot
Array privatization for parallel execution of loops
inferredcites →https://doi.org/10.1145/356810.356813openalex-snapshot
Experience Using Multiprocessor Systems—A Status Report
inferredcites →https://doi.org/10.1145/55364.55420openalex-snapshot
An approach to synchronization for parallel computing
inferredcites →https://doi.org/10.1145/567532.567555openalex-snapshot
Dependence graphs and compiler optimizations
inferredcites →https://doi.org/10.1145/602770.602857openalex-snapshot
An efficient algorithm for the run-time parallelization of DOACROSS loops
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
inferredcites →https://doi.org/10.1147/rd.111.0025openalex-snapshot
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
inferredcites →https://doi.org/10.1177/109434208900300302openalex-snapshot
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
inferredcites →https://doi.org/10.1349/ddlp.3270openalex-snapshot
Parallel algorithms for graph problems.
inferredcites →https://doi.org/10.5555/602770.602857openalex-snapshot
An efficient algorithm for the run-time parallelization of DOACROSS loops
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-40889-4_22openalex-snapshot
Speculative Parallelization of Partially Parallel Loops
inferred← citeshttps://doi.org/10.1007/3-540-44467-x_3openalex-snapshot
An Efficient Run-Time Scheme for Exploiting Parallelism on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_6openalex-snapshot
SmartApps: An Application Centric Approach to High Performance Computing
inferred← citeshttps://doi.org/10.1007/3-540-46423-9_16openalex-snapshot
Techniques for Reducing the Overhead of Run-Time Parallelization
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_21openalex-snapshot
Principles of Speculative Run—Time Parallelization
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_35openalex-snapshot
Speculative Parallelization of Loops
inferred← citeshttps://doi.org/10.1007/978-1-4614-3296-8_11openalex-snapshot
CPU-GPU System Designs for High Performance Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-319-17473-0_9openalex-snapshot
An Approach for Proving the Correctness of Inspector/Executor Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-31832-3_7openalex-snapshot
The ParaWise Expert Assistant – Widening Accessibility to Efficient and Scalable Tool Generated OpenMP Code
inferred← citeshttps://doi.org/10.1007/978-3-540-49051-7_13openalex-snapshot
Implementation Issues of Loop-Level Speculative Run-Time Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_4openalex-snapshot
Double Inspection for Run-Time Loop Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_5openalex-snapshot
A Hybrid Approach to Proving Memory Reference Monotonicity
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_1openalex-snapshot
Just in Time Load Balancing
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_5openalex-snapshot
Set and Relation Manipulation for the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1007/bfb0032691openalex-snapshot
The SPNT test: A new technology for run-time speculative parallelization of loops
inferred← citeshttps://doi.org/10.1016/j.ins.2005.01.003openalex-snapshot
Predecessor/successor approach for high-performance run-time wavefront scheduling
inferred← citeshttps://doi.org/10.1016/j.parco.2005.03.008openalex-snapshot
Generating OpenMP code using an interactive parallelization environment
inferred← citeshttps://doi.org/10.1016/s0164-1212(00)00060-1openalex-snapshot
A practical run-time technique for exploiting loop-level parallelism
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00024-6openalex-snapshot
Run-time parallelization: Its time has come
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00109-xopenalex-snapshot
EXPLORER: Supporting run-time parallelization of DOACROSS loops on general networks of workstations
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00081-7openalex-snapshot
Worker–checker – A framework for run-time parallelization on multiprocessors
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/71.926166openalex-snapshot
Time stamp algorithms for runtime parallelization of DOACROSS loops with dynamic dependences
inferred← citeshttps://doi.org/10.1109/ase.2013.6693108openalex-snapshot
The potential of polyhedral optimization: An empirical study
inferred← citeshttps://doi.org/10.1109/cgo.2013.6494992openalex-snapshot
Runtime dependence computation and execution of loops on heterogeneous systems
inferred← citeshttps://doi.org/10.1109/cgo.2013.6495001openalex-snapshot
Automatically exploiting cross-invocation parallelism using runtime information
inferred← citeshttps://doi.org/10.1109/hpcc-css-icess.2015.29openalex-snapshot
JolokiaC++: Optimizing Irregular Accesses for GPGPU
inferred← citeshttps://doi.org/10.1109/iccad.2011.6105317openalex-snapshot
Cooperative parallelization
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327909openalex-snapshot
Non-uniform dependences partitioned by recurrence chains
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015493openalex-snapshot
The R-LRPD test: speculative parallelization of partially parallel loops
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016572openalex-snapshot
Smartapps, an application centric approach to high performance computing: compiler-assisted software and hardware support for reduction operations
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.14openalex-snapshot
Redesigning OP2 Compiler to Use HPX Runtime Asynchronous Techniques
inferred← citeshttps://doi.org/10.1109/ipps.1999.760559openalex-snapshot
Hyperplane partitioning: an approach to global data partitioning for distributed memory machines
inferred← citeshttps://doi.org/10.1109/jproc.2018.2857721openalex-snapshot
The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code
inferred← citeshttps://doi.org/10.1109/pact.2009.10openalex-snapshot
Exploiting Parallelism with Dependence-Aware Scheduling
inferred← citeshttps://doi.org/10.1109/sc.2016.40openalex-snapshot
Automating Wavefront Parallelization for Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1145/1583991.1584050openalex-snapshot
A lightweight in-place implementation for software thread-level speculation
inferred← citeshttps://doi.org/10.1145/1993316.1993516openalex-snapshot
Automatic CPU-GPU communication management and optimization
inferred← citeshttps://doi.org/10.1145/1993498.1993516openalex-snapshot
Automatic CPU-GPU communication management and optimization
inferred← citeshttps://doi.org/10.1145/2254064.2254124openalex-snapshot
Logical inference techniques for loop parallelization
inferred← citeshttps://doi.org/10.1145/2259016.2259038openalex-snapshot
Dynamically managed data for CPU-GPU architectures
inferred← citeshttps://doi.org/10.1145/2345156.2254124openalex-snapshot
Logical inference techniques for loop parallelization
inferred← citeshttps://doi.org/10.1145/2491956.2462182openalex-snapshot
General data structure expansion for multi-threading
inferred← citeshttps://doi.org/10.1145/2499370.2462182openalex-snapshot
General data structure expansion for multi-threading
inferred← citeshttps://doi.org/10.1145/2688500.2688515openalex-snapshot
Distributed memory code generation for mixed Irregular/Regular computations
inferred← citeshttps://doi.org/10.1145/2858788.2688515openalex-snapshot
Distributed memory code generation for mixed Irregular/Regular computations
inferred← citeshttps://doi.org/10.1145/2967938.2967959openalex-snapshot
Speculatively Exploiting Cross-Invocation Parallelism
inferred← citeshttps://doi.org/10.1145/3178487.3178515openalex-snapshot
Efficient parallel determinacy race detection for two-dimensional dags
inferred← citeshttps://doi.org/10.1145/3200691.3178515openalex-snapshot
Efficient parallel determinacy race detection for two-dimensional dags
inferred← citeshttps://doi.org/10.1145/3314221.3314646openalex-snapshot
Sparse computation data dependence simplification for efficient compiler-generated inspectors
inferred← citeshttps://doi.org/10.1145/3390523openalex-snapshot
A Conflict-free Scheduler for High-performance Graph Processing on Multi-pipeline FPGAs
inferred← citeshttps://doi.org/10.1145/3460944.3464309openalex-snapshot
Acceleration of lattice models for pricing portfolios of fixed-income derivatives
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4091openalex-snapshot
Compiler and Runtime Optimization Techniques for Implementation Scalable Parallel Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10852openalex-snapshot
Sparse Matrix Code Dependence Analysis Simplification at Compile Time
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01687openalex-snapshot
Report of the Workshop on Program Synthesis for Scientific Computing
inferred← citeshttps://doi.org/10.70675/520fb225zfd4dz4552zb4deza77c7ec8cc90openalex-snapshot
Fast and flexible compilation techniques for effective speculative polyhedral parallelization
inferred← citeshttps://doi.org/10.70675/95d71994z104dz4d0dz9835zf4a7adab2954openalex-snapshot
Optimisation dynamique de code binaire par des transformations vectorielles
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.