On the public citation graph
Automatic parallelization ofwhile-loops using speculative execution
0 signed · 57 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-55895-0_467openalex-snapshot
Unimodularity considered non-essential (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
inferredcites →https://doi.org/10.1007/3-540-57877-3_11openalex-snapshot
Delayed exceptions — Speculative execution of trapping instructions
inferredcites →https://doi.org/10.1007/3-540-58430-7_59openalex-snapshot
On scanning space-time mapped while loops
inferredcites →https://doi.org/10.1007/bf00127840openalex-snapshot
Parallelization of WHILE loops on pipelined architectures
inferredcites →https://doi.org/10.1007/bf01205181openalex-snapshot
Instruction-level parallel processing: History, overview, and perspective
inferredcites →https://doi.org/10.1007/bf01379315openalex-snapshot
A join algorithm for combining AND parallel solutions in AND/OR parallel systems
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1016/0167-8191(89)90028-8openalex-snapshot
Pipelined iterative methods for shared memory machines
inferredcites →https://doi.org/10.1016/0167-8191(90)90055-eopenalex-snapshot
Optimal code parallelization using unimodular transformations
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/71.159040openalex-snapshot
Requirements for optimal execution of loops with tests
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1109/shpcc.1994.296675openalex-snapshot
Space-time transformation of while-loops using speculative execution
inferredcites →https://doi.org/10.1109/spdp.1993.395490openalex-snapshot
An algorithm to automate non-unimodular transformations of loop nests
inferredcites →https://doi.org/10.1142/s0129626495000394openalex-snapshot
CONSTRUCTION OF DO LOOPS FROM SYSTEMS OF AFFINE CONSTRAINTS
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/109626.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/115865.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferredcites →https://doi.org/10.1145/115866.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferredcites →https://doi.org/10.1145/139669.139702openalex-snapshot
Limits of control flow on parallelism
inferredcites →https://doi.org/10.1145/143365.143534openalex-snapshot
Efficient superscalar performance through boosting
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/55364.55387openalex-snapshot
Requirements for optimal execution of oops with tests
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
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-44905-1_14openalex-snapshot
Application of the Polytope Model to Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_64openalex-snapshot
Classifying loops for space-time mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_16openalex-snapshot
The Polyhedral Model Is More Widely Applicable Than You Think
inferred← citeshttps://doi.org/10.1007/bf02577774openalex-snapshot
A communication scheme for the distributed execution of loop nests withwhile loops
inferred← citeshttps://doi.org/10.1007/bf03356758openalex-snapshot
Interprocedural Array Region Analyses
inferred← citeshttps://doi.org/10.1007/bfb0014191openalex-snapshot
Interprocedural array region analyses
inferred← citeshttps://doi.org/10.1007/bfb0017246openalex-snapshot
Exploiting monotone convergence functions in parallel programs
inferred← citeshttps://doi.org/10.1007/bfb0020474openalex-snapshot
Generation of synchronous code for automatic parallelization of while loops
inferred← citeshttps://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
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:1007904422322openalex-snapshot
The Static Parallelization of Loops and Recursions
inferred← citeshttps://doi.org/10.1080/17445760.2015.1104681openalex-snapshot
Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform
inferred← citeshttps://doi.org/10.1109/aispas.1995.401360openalex-snapshot
On the parallelization of loop nests containing while loops
inferred← citeshttps://doi.org/10.1109/ase.2013.6693108openalex-snapshot
The potential of polyhedral optimization: An empirical study
inferred← citeshttps://doi.org/10.1109/date.2011.5763118openalex-snapshot
Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems
inferred← citeshttps://doi.org/10.1109/estimedia.2011.6088516openalex-snapshot
Automatic derivation of polyhedral process networks from while-loop affine programs
inferred← citeshttps://doi.org/10.1109/hpcc-css-icess.2015.158openalex-snapshot
Extraction of Kahn Process Networks from While Loops in Embedded Software
inferred← citeshttps://doi.org/10.1109/synasc.2008.33openalex-snapshot
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
inferred← citeshttps://doi.org/10.1109/tcc.2016.2607708openalex-snapshot
Loop Parallelism Maximization for Multimedia Data Processing in Mobile Vehicular Clouds
inferred← citeshttps://doi.org/10.1145/2838734openalex-snapshot
The Polyhedral Model of Nonlinear Loops
inferred← citeshttps://doi.org/10.1145/3178372.3179509openalex-snapshot
A polyhedral compilation framework for loops with dynamic data-dependent bounds
inferred← citeshttps://doi.org/10.2200/s00340ed1v01y201201cac019openalex-snapshot
Automatic Parallelization: An Overview of Fundamental Compiler Techniques
inferred← citeshttps://doi.org/10.3390/a19050375openalex-snapshot
The Arithmetic Jump: A Branch-Free Index Inversion for 3D Arrays
inferred← citeshttps://doi.org/10.70675/0d9eb0daz75bbz48c4zbe0cza9519ab8daf0openalex-snapshot
Application de la métaprogrammation template à la conception de bibliothèques actives de parallélisation assistée
inferred← citeshttps://doi.org/10.70675/9a4b7e14za7f4z4a6ezb5f1z795b20080783openalex-snapshot
A combined language and polyhedral approach to heterogeneous parallelism
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.