On the public citation graph

Reuse-driven tiling for data locality

https://doi.org/10.1007/bfb0032681
0 signed · 47 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.1006/jpdc.1997.1310openalex-snapshot
Communication-Minimal Tiling of Uniform Dependence Loops
inferredcites →https://doi.org/10.1007/bf01593771openalex-snapshot
An algorithm for determining all extreme points of a convex polytope
inferredcites →https://doi.org/10.1007/bfb0017242openalex-snapshot
Cross-loop reuse analysis and its application to cache optimizations
inferredcites →https://doi.org/10.1007/bfb0017243openalex-snapshot
Locality analysis for distributed shared-memory multiprocessors
inferredcites →https://doi.org/10.1007/bfb0025880openalex-snapshot
Minimal data dependence abstractions for loop transformations
inferredcites →https://doi.org/10.1016/0167-8191(94)90002-7openalex-snapshot
Automating non-unimodular loop transformations for massive parallelism
inferredcites →https://doi.org/10.1016/0167-9260(94)90019-1openalex-snapshot
(Pen)-ultimate tiling?
inferredcites →https://doi.org/10.1016/0377-2217(88)90189-0openalex-snapshot
Theory of linear and integer programming
inferredcites →https://doi.org/10.1016/0743-7315(92)90027-kopenalex-snapshot
Tiling multidimensional iteration spaces for multicomputers
inferredcites →https://doi.org/10.1023/a:1025168022993openalex-snapshot
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
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/pact.1996.552676openalex-snapshot
Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs
inferredcites →https://doi.org/10.1109/superc.1992.236704openalex-snapshot
Compiler blockability of numerical algorithms
inferredcites →https://doi.org/10.1142/s0129626497000383openalex-snapshot
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling
inferredcites →https://doi.org/10.1142/s0129626497000401openalex-snapshot
On Tiling as a Loop Transformation
inferredcites →https://doi.org/10.1145/106972.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/207110.207162openalex-snapshot
Tile size selection using cache organization and data layout
inferredcites →https://doi.org/10.1145/224538.224571openalex-snapshot
Optimal tile size adjustment in compiling general DOACROSS loop nests
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/55364.55388openalex-snapshot
On the problem of optimizing data transfers for complex memory systems
inferredcites →https://doi.org/10.1145/73560.73588openalex-snapshot
Supernode partitioning
inferredcites →https://doi.org/10.1145/76263.76337openalex-snapshot
More iteration space tiling
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-45574-4_10openalex-snapshot
Experimental Evaluation of Energy Behavior of Iteration Space Tiling
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_13openalex-snapshot
Data Space Oriented Tiling
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_57openalex-snapshot
I/O-Conscious Tiling for Disk-Resident Data Sets
inferred← citeshttps://doi.org/10.1007/s11227-010-0522-zopenalex-snapshot
Optimizing modulo scheduling to achieve reuse and concurrency for stream processors
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00040-5openalex-snapshot
Generating efficient tiled code for distributed memory machines
inferred← citeshttps://doi.org/10.1023/a:1014156327748openalex-snapshot
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
inferred← citeshttps://doi.org/10.1109/12.947000openalex-snapshot
Data relation vectors: a new abstraction for data optimizations
inferred← citeshttps://doi.org/10.1109/date.2010.5456975openalex-snapshot
Reuse-aware modulo scheduling for stream processors
inferred← citeshttps://doi.org/10.1109/hpca.2002.995708openalex-snapshot
Let's study whole-program cache behaviour analytically
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173608openalex-snapshot
Efficient compile-time analysis of cache behaviour for programs with IF statements
inferred← citeshttps://doi.org/10.1109/icpp.2012.19openalex-snapshot
Automatic Parallelization of Tiled Loop Nests with Enhanced Fine-Grained Parallelism on GPUs
inferred← citeshttps://doi.org/10.1109/lpe.2005.195516openalex-snapshot
An evaluation of code and data optimizations in the context of disk power reduction
inferred← citeshttps://doi.org/10.1109/tc.2001.947008openalex-snapshot
Data relation vectors: a new abstraction for data optimizations
inferred← citeshttps://doi.org/10.1109/tpds.2007.70760openalex-snapshot
Compiler-Directed Code Restructuring for Improving Performance of MPSoCs
inferred← citeshttps://doi.org/10.1145/1067915.1067922openalex-snapshot
Data space-oriented tiling for enhancing locality
inferred← citeshttps://doi.org/10.1145/1077603.1077655openalex-snapshot
An evaluation of code and data optimizations in the context of disk power reduction
inferred← citeshttps://doi.org/10.1145/1324969.1324973openalex-snapshot
Data cache locking for tight timing calculations
inferred← citeshttps://doi.org/10.1145/1454115.1454121openalex-snapshot
Exploiting loop-dependent stream reuse for stream processors
inferred← citeshttps://doi.org/10.1145/1839667.1839673openalex-snapshot
Exploiting the reuse supplied by loop-dependent stream references for stream processors
inferred← citeshttps://doi.org/10.4230/dagsemproc.07361.5openalex-snapshot
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures
inferred← citeshttps://doi.org/10.5555/1870926.1871197openalex-snapshot
Reuse-aware modulo scheduling for stream processors
inferred← citeshttps://doi.org/10.5555/517554.825768openalex-snapshot
Data Relation Vectors: A New Abstraction for Data Optimizations
inferred← citeshttps://doi.org/10.5555/942806.943842openalex-snapshot
Optimizing program locality through CMEs and GAs
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.