On the public citation graph

TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications

https://doi.org/10.15439/2015f34

0 signed · 30 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.1007/3-540-57659-2_31openalex-snapshot

An exact method for analysis of value-based array data dependences

inferredcites →https://doi.org/10.1007/978-1-4612-1362-8openalex-snapshot

Scheduling and Automatic Parallelization

inferredcites →https://doi.org/10.1007/978-3-319-15147-2_26openalex-snapshot

Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph

inferredcites →https://doi.org/10.1007/978-3-540-78791-4_9openalex-snapshot

Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model

inferredcites →https://doi.org/10.1007/978-3-642-11970-5_16openalex-snapshot

The Polyhedral Model Is More Widely Applicable Than You Think

inferredcites →https://doi.org/10.1007/978-3-642-17458-2_10openalex-snapshot

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations

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/bf03356760openalex-snapshot

Transitive Closure of Infinite Graphs and Its Applications

inferredcites →https://doi.org/10.1007/bfb0014196openalex-snapshot

Transitive closure of infinite graphs and its applications

inferredcites →https://doi.org/10.1007/bfb0025873openalex-snapshot

Communication-free parallelization via affine transformations

inferredcites →https://doi.org/10.1016/0743-7315(92)90027-kopenalex-snapshot

Tiling multidimensional iteration spaces for multicomputers

inferredcites →https://doi.org/10.1016/j.parco.2010.12.005openalex-snapshot

Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations

inferredcites →https://doi.org/10.1016/j.parco.2012.06.001openalex-snapshot

Free scheduling for statement instances of parameterized arbitrarily nested affine loops

inferredcites →https://doi.org/10.1109/pact.2004.1342537openalex-snapshot

Code generation in the polyhedral model is easier than you think

inferredcites →https://doi.org/10.1142/s1793830912500115openalex-snapshot

AN ITERATIVE ALGORITHM OF COMPUTING THE TRANSITIVE CLOSURE OF A UNION OF PARAMETRIZED AFFINE INTEGER TUPLE RELATIONS

inferredcites →https://doi.org/10.1145/1375581.1375595openalex-snapshot

A practical automatic polyhedral parallelizer and locality optimizer

inferredcites →https://doi.org/10.1145/263580.263637openalex-snapshot

Iteration space slicing and its application to communication optimization

inferredcites →https://doi.org/10.1145/305138.305197openalex-snapshot

An affine partitioning algorithm to maximize parallelism and minimize communication

inferredcites →https://doi.org/10.1175/1520-0469(1995)052<2675:saaotd>2.0.co;2openalex-snapshot

Simulation and Analysis of Tornado Development and Decay within a Three-Dimensional Supercell Thunderstorm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_1openalex-snapshot

Distributing and Parallelizing Non-canonical Loops

inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_29openalex-snapshot

Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph

inferred← citeshttps://doi.org/10.1007/978-3-319-91262-2_19openalex-snapshot

Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment

inferred← citeshttps://doi.org/10.1007/s00607-017-0576-3openalex-snapshot

Generation of parallel synchronization-free tiled code

inferred← citeshttps://doi.org/10.1007/s11227-018-2678-xopenalex-snapshot

Insight into tiles generated by means of a correction technique

inferred← citeshttps://doi.org/10.1109/sbac-padw.2016.16openalex-snapshot

Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops

inferred← citeshttps://doi.org/10.1145/3674735openalex-snapshot

A Survey of General-purpose Polyhedral Compilers

inferred← citeshttps://doi.org/10.1515/amcs-2016-0065openalex-snapshot

Tiling arbitrarily nested loops by means of the transitive

inferred← citeshttps://doi.org/10.15439/2016f48openalex-snapshot

An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming

inferred← citeshttps://doi.org/10.7494/csci.2017.18.2.195openalex-snapshot

DYNAMIC TILE FREE SCHEDULING FOR CODE WITH ACYCLIC INTER-TILE DEPENDENCE GRAPHS

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.