On the public citation graph
ATM: Approximate Task Memoization in the Runtime System
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.
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/978-3-662-48096-0_2openalex-snapshot
Runtime-Aware Architectures
inferredcites →https://doi.org/10.1109/cgo.2015.7054203openalex-snapshot
HELIX-UP: Relaxing program semantics to unleash parallelization
inferredcites →https://doi.org/10.1109/micro.1997.645815openalex-snapshot
The predictability of data values
inferredcites →https://doi.org/10.1109/micro.1998.742782openalex-snapshot
Understanding the differences between value prediction and instruction reuse
inferredcites →https://doi.org/10.1109/micro.2012.48openalex-snapshot
Neural Acceleration for General-Purpose Approximate Programs
inferredcites →https://doi.org/10.1109/pact.2015.26openalex-snapshot
Runtime-Guided Management of Scratchpad Memories in Multicore Architectures
inferredcites →https://doi.org/10.1109/pact.2015.29openalex-snapshot
Runtime Value Numbering: A Profiling Technique to Pinpoint Redundant Computations
inferredcites →https://doi.org/10.1109/tc.2005.119openalex-snapshot
Fuzzy Memoization for Floating-Point Multimedia Applications
inferredcites →https://doi.org/10.1142/s0129626411000151openalex-snapshot
OmpSs: A PROPOSAL FOR PROGRAMMING HETEROGENEOUS MULTI-CORE ARCHITECTURES
inferredcites →https://doi.org/10.1145/2025113.2025133openalex-snapshot
Managing performance vs. accuracy trade-offs with loop perforation
inferredcites →https://doi.org/10.1145/225058.225140openalex-snapshot
Polynomial time approximation schemes for dense instances of NP -hard problems
inferredcites →https://doi.org/10.1145/237090.237173openalex-snapshot
Value locality and load value prediction
inferredcites →https://doi.org/10.1145/248209.237173openalex-snapshot
Value locality and load value prediction
inferredcites →https://doi.org/10.14529/jsfi140102openalex-snapshot
Runtime-Aware Architectures: A First Approach
inferredcites →https://doi.org/10.5555/266800.266824openalex-snapshot
The predictability of data values
inferredcites →https://doi.org/10.5555/290940.290983openalex-snapshot
Understanding the differences between value prediction and instruction reuse
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-21867-5_6openalex-snapshot
Effects of Approximate Computing on Workload Characteristics
inferred← citeshttps://doi.org/10.1109/access.2024.3467375openalex-snapshot
Approximate Computing: Concepts, Architectures, Challenges, Applications, and Future Directions
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916468openalex-snapshot
Application of Approximate Matrix Multiplication to Neural Networks and Distributed SLAM
inferred← citeshttps://doi.org/10.1109/islped.2019.8824846openalex-snapshot
A2M: Approximate Algebraic Memory Using Polynomials Rings
inferred← citeshttps://doi.org/10.1109/lca.2024.3505075openalex-snapshot
A Case for Hardware Memoization in Server CPUs
inferred← citeshttps://doi.org/10.1109/mm.2018.043191126openalex-snapshot
Temporal Approximate Function Memoization
inferred← citeshttps://doi.org/10.1109/pmbs.2018.8641651openalex-snapshot
Approximating a Multi-Grid Solver
inferred← citeshttps://doi.org/10.1109/sc.2018.00038openalex-snapshot
Runtime-Assisted Cache Coherence Deactivation in Task Parallel Programs
inferred← citeshttps://doi.org/10.1109/sc41404.2022.00085openalex-snapshot
TD-NUCA: Runtime Driven Management of NUCA Caches in Task Dataflow Programming Models
inferred← citeshttps://doi.org/10.1145/3445814.3446717openalex-snapshot
MERCI: efficient embedding reduction on commodity hardware via sub-query memoization
inferred← citeshttps://doi.org/10.1145/3711683openalex-snapshot
Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and Applications
inferred← citeshttps://doi.org/10.5821/dissertation-2117-134618openalex-snapshot
Towards resource-aware computing for task-based runtimes and parallel architectures
inferred← citeshttps://doi.org/10.5821/dissertation-2117-134744openalex-snapshot
Parallel architectures and runtime systems co-design for task-based programming models
inferred← citeshttps://doi.org/10.5821/dissertation-2117-166153openalex-snapshot
Exploiting task-based programming models for resilience
inferred← citeshttps://doi.org/10.5821/dissertation-2117-335422openalex-snapshot
Runtime-assisted optimizations in the on-chip memory hierarchy
inferred← citeshttps://doi.org/10.5821/dissertation-2117-336238openalex-snapshot
Runtime-assisted coherent caching
inferred← citeshttps://doi.org/10.5821/dissertation-2117-367546openalex-snapshot
Exploiting data locality in cache-coherent NUMA systems
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.