On the public citation graph

A comparison of parallelization techniques for irregular reductions

0 signed · 40 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.1002/spe.4380250603openalex-snapshot
Runtime and language support for compiling adaptive irregular programs on distributed‐memory machines
inferredcites →https://doi.org/10.1006/jpdc.1994.1104openalex-snapshot
Communication Optimizations for Irregular Scientific Computations on Distributed Memory Architectures
inferredcites →https://doi.org/10.1007/3-540-40889-4_6openalex-snapshot
A Comparison of Locality Transformations for Irregular Codes
inferredcites →https://doi.org/10.1007/3-540-48311-x_56openalex-snapshot
On Automatic Parallelization of Irregular Reductions on Scalable Shared Memory Systems⋆
inferredcites →https://doi.org/10.1109/ipps.1998.669929openalex-snapshot
Memory hierarchy management for iterative graph structures
inferredcites →https://doi.org/10.1109/tc.1987.1676942openalex-snapshot
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
inferredcites →https://doi.org/10.1145/135226.135230openalex-snapshot
Compiling Fortran D for MIMD distributed-memory machines
inferredcites →https://doi.org/10.1145/169627.169747openalex-snapshot
Preliminary experiences with the Fortran D compiler
inferredcites →https://doi.org/10.1145/178243.178253openalex-snapshot
GIVE-N-TAKE—a balanced code placement framework
inferredcites →https://doi.org/10.1145/193209.193217openalex-snapshot
SUIF
inferredcites →https://doi.org/10.1145/224170.224337openalex-snapshot
Detecting coarse-grain parallelism using an interprocedural parallelizing compiler
inferredcites →https://doi.org/10.1145/2591635.2667180openalex-snapshot
Adaptive reduction parallelization techniques
inferredcites →https://doi.org/10.1145/277830.277870openalex-snapshot
The role of associativity and commutativity in the detection and transformation of loop-level parallelism
inferredcites →https://doi.org/10.1145/301618.301670openalex-snapshot
Improving cache performance in dynamic applications through data and computation reorganization at run time
inferredcites →https://doi.org/10.1145/305138.305228openalex-snapshot
Improving memory hierarchy performance for irregular applications
inferredcites →https://doi.org/10.1145/335231.335238openalex-snapshot
Adaptive reduction parallelization techniques
inferredcites →https://doi.org/10.1145/335231.335239openalex-snapshot
A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors
inferredcites →https://doi.org/10.5555/522344.825712openalex-snapshot
Improving compiler and run-time support for adaptive irregular codes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.769openalex-snapshot
Data partitioning‐based parallel irregular reductions
inferred← citeshttps://doi.org/10.1007/3-540-35767-x_11openalex-snapshot
Balanced, Locality-Based Parallel Irregular Reductions
inferred← citeshttps://doi.org/10.1007/3-540-35767-x_18openalex-snapshot
An Adaptive Scheme for Dynamic Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_7openalex-snapshot
Automated Synthesis of Asynchronizations
inferred← citeshttps://doi.org/10.1007/978-3-319-45550-1_24openalex-snapshot
Supporting Adaptive Privatization Techniques for Irregular Array Reductions in Task-Parallel Programming Models
inferred← citeshttps://doi.org/10.1016/j.parco.2008.01.003openalex-snapshot
An analytical model of locality-based parallel irregular reductions
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00057-2openalex-snapshot
Optimization techniques for parallel irregular reductions
inferred← citeshttps://doi.org/10.1109/empdp.2002.994330openalex-snapshot
On improving the performance of data partitioning oriented parallel irregular reductions
inferred← citeshttps://doi.org/10.1109/empdp.2004.1271420openalex-snapshot
Optimization techniques for irregular and pointer-based programs
inferred← citeshttps://doi.org/10.1109/hpec.2015.7322443openalex-snapshot
Boosting irregular array Reductions through In-lined Block-ordering on fast processors
inferred← citeshttps://doi.org/10.1109/icppw.2009.24openalex-snapshot
Efficient Parallel Implementation of Molecular Dynamics with Embedded Atom Method on Multi-core Platforms
inferred← citeshttps://doi.org/10.1109/ipdps.2013.63openalex-snapshot
Programmable and Scalable Reductions on Clusters
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00056openalex-snapshot
Spray: Sparse Reductions of Arrays in OPENMP
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470884openalex-snapshot
Experiences of using a dependence profiler to assist parallelization for multi-cores
inferred← citeshttps://doi.org/10.1145/3062341.3062355openalex-snapshot
Synthesis of divide and conquer parallelism for loops
inferred← citeshttps://doi.org/10.1145/3627535.3638493openalex-snapshot
Recurrence Analysis for Automatic Parallelization of Subscripted Subscripts
inferred← citeshttps://doi.org/10.1145/3725843.3756030openalex-snapshot
Delegato: Locality-Aware Atomic Memory Operations on Chiplets
inferred← citeshttps://doi.org/10.1145/582034.582072openalex-snapshot
Improving parallel irregular reductions using partial array expansion
inferred← citeshttps://doi.org/10.1360/zf2010-53-5-678openalex-snapshot
面向分布式存储系统结构的OpenMP 编译系统
inferred← citeshttps://doi.org/10.48550/arxiv.1701.08345openalex-snapshot
Automated Synthesis of Divide and Conquer Parallelism
inferred← citeshttps://doi.org/10.5821/dissertation-2117-111500openalex-snapshot
On algorithmic reductions in task-parallel programming models
inferred← citeshttps://doi.org/10.5821/dissertation-2117-335422openalex-snapshot
Runtime-assisted optimizations in the on-chip memory hierarchy
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.