On the public citation graph
Cacheminer: A runtime approach to exploit cache locality on SMP
0 signed · 37 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.1109/12.286299openalex-snapshot
False sharing and spatial locality in multiprocessor caches
inferredcites →https://doi.org/10.1109/71.273046openalex-snapshot
Using processor affinity in loop scheduling on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.569656openalex-snapshot
Adaptively scheduling parallel loops in distributed shared-memory systems
inferredcites →https://doi.org/10.1109/hicss.1994.323177openalex-snapshot
Performance optimizations, implementation, and verification of the SGI Challenge multiprocessor
inferredcites →https://doi.org/10.1109/icpp.1993.112openalex-snapshot
Locality and Loop Scheduling on NUMA Multiprocessors
inferredcites →https://doi.org/10.1109/icpp.1998.708484openalex-snapshot
A memory-layout oriented run-time technique for locality optimization on SMPs
inferredcites →https://doi.org/10.1109/isca.1995.524548openalex-snapshot
Dynamic self-invalidation: reducing coherence overhead in shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/mascot.1994.284422openalex-snapshot
MINT: a front end for efficient simulation of shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/tc.1987.5009495openalex-snapshot
Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers
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/155090.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines
inferredcites →https://doi.org/10.1145/155332.155358openalex-snapshot
Data locality and load balancing in COOL
inferredcites →https://doi.org/10.1145/207110.207162openalex-snapshot
Tile size selection using cache organization and data layout
inferredcites →https://doi.org/10.1145/209936.209954openalex-snapshot
Data and computation transformations for multiprocessors
inferredcites →https://doi.org/10.1145/209936.209955openalex-snapshot
Reducing false sharing on shared memory multiprocessors through compile time data transformations
inferredcites →https://doi.org/10.1145/233561.233564openalex-snapshot
Improving data locality with loop transformations
inferredcites →https://doi.org/10.1145/237090.237151openalex-snapshot
Thread scheduling for cache locality
inferredcites →https://doi.org/10.1145/237090.237161openalex-snapshot
A quantitative analysis of loop nest locality
inferredcites →https://doi.org/10.1145/244804.244807openalex-snapshot
Using the SimOS machine simulator to study complex computer systems
inferredcites →https://doi.org/10.1145/258915.258946openalex-snapshot
Data-centric multi-level blocking
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-981-13-2721-6_7openalex-snapshot
Data Similarity-Aware Computation Infrastructure for the Cloud
inferred← citeshttps://doi.org/10.1007/s11227-006-8324-zopenalex-snapshot
Auto-CFD-NOW: A pre-compiler for effectively parallelizing CFD applications on networks of workstations
inferred← citeshttps://doi.org/10.1109/cgiv.2007.22openalex-snapshot
Cache-Oblivious Scanline Algorithm Design
inferred← citeshttps://doi.org/10.1109/icppw.2001.951841openalex-snapshot
Run-time characterization of irregular accesses applied to parallelization of irregular reductions
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370498openalex-snapshot
A Key-based Adaptive Transactional Memory Executor
inferred← citeshttps://doi.org/10.1109/pdgc.2012.6449844openalex-snapshot
Reducing conflict misses using fraction associative mapping
inferred← citeshttps://doi.org/10.1109/simsym.2002.1000093openalex-snapshot
Statistical simulation of symmetric multiprocessor systems
inferred← citeshttps://doi.org/10.1109/tc.2013.111openalex-snapshot
Data Similarity-Aware Computation Infrastructure for the Cloud
inferred← citeshttps://doi.org/10.1137/s1064827599359709openalex-snapshot
Fast Bit-Reversals on Uniprocessors and Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1145/1272366.1272380openalex-snapshot
Feedback-directed thread scheduling with memory considerations
inferred← citeshttps://doi.org/10.1145/2442516.2442523openalex-snapshot
Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU
inferred← citeshttps://doi.org/10.1145/2517327.2442523openalex-snapshot
Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU
inferred← citeshttps://doi.org/10.1145/351827.384245openalex-snapshot
Improving memory performance of sorting algorithms
inferred← citeshttps://doi.org/10.1504/ijcse.2005.008906openalex-snapshot
Runtime characterisation of irregular accesses applied to parallelisation of irregular reductions
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.