On the public citation graph
Optimizing overall loop schedules using prefetching and partitioning
0 signed · 46 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/bf02106824openalex-snapshot
Resource-constrained loop list scheduler for DSP algorithms
inferredcites →https://doi.org/10.1109/71.395402openalex-snapshot
Sequential hardware prefetching in shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.544356openalex-snapshot
Achieving full parallelism using multidimensional retiming
inferredcites →https://doi.org/10.1109/71.689444openalex-snapshot
Modeled and measured instruction fetching performance for superscalar microprocessors
inferredcites →https://doi.org/10.1109/92.736145openalex-snapshot
Scheduling of uniform multidimensional systems under resource constraints
inferredcites →https://doi.org/10.1109/icpp.1997.622560openalex-snapshot
Combining loop fusion with prefetching on shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/icpp.1997.622659openalex-snapshot
Hybrid compiler/hardware prefetching for multiprocessors using low-overhead cache miss traps
inferredcites →https://doi.org/10.1109/icpp.1997.622660openalex-snapshot
An adaptive sequential prefetching scheme in shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/isca.1994.288147openalex-snapshot
A performance study of software and hardware data prefetching schemes
inferredcites →https://doi.org/10.1109/micro.1994.717449openalex-snapshot
Data relocation and prefetching for programs with large data sets
inferredcites →https://doi.org/10.1109/micro.1995.476832openalex-snapshot
Cache miss heuristics and preloading techniques for general-purpose programs
inferredcites →https://doi.org/10.1109/micro.1996.566456openalex-snapshot
Modulo scheduling of loops in control-intensive non-numeric programs
inferredcites →https://doi.org/10.1109/micro.1996.566463openalex-snapshot
Tango: a hardware-based data prefetching technique for superscalar processors
inferredcites →https://doi.org/10.1109/micro.1996.566468openalex-snapshot
Combining loop transformations considering caches and scheduling
inferredcites →https://doi.org/10.1109/pccc.1995.472508openalex-snapshot
Loop based scheduling for high level synthesis
inferredcites →https://doi.org/10.1145/191995.192030openalex-snapshot
A performance study of software and hardware data prefetching schemes
inferredcites →https://doi.org/10.1145/192724.192740openalex-snapshot
Data relocation and prefetching for programs with large data sets
inferredcites →https://doi.org/10.1145/237090.237151openalex-snapshot
Thread scheduling for cache locality
inferredcites →https://doi.org/10.1145/277830.277925openalex-snapshot
Data prefetching for software DSMs
inferredcites →https://doi.org/10.5555/225160.225199openalex-snapshot
Cache miss heuristics and preloading techniques for general-purpose programs
inferredcites →https://doi.org/10.5555/243846.243879openalex-snapshot
Modulo scheduling of loops in control-intensive non-numeric programs
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-030-42234-9_10openalex-snapshot
Write Mode Aware Loop Tiling for High-Performance Low-Power Volatile PCM in Embedded Systems
inferred← citeshttps://doi.org/10.1007/s11265-009-0362-3openalex-snapshot
Variable Partitioning and Scheduling for MPSoC with Virtually Shared Scratch Pad Memory
inferred← citeshttps://doi.org/10.1007/s11265-010-0465-xopenalex-snapshot
Loop Distribution and Fusion with Timing and Code Size Optimization
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.004openalex-snapshot
Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.02.001openalex-snapshot
Minimizing write operation for multi-dimensional DSP applications via a two-level partition technique with complete memory latency hiding
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102799openalex-snapshot
Loop interchange and tiling for multi-dimensional loops to minimize write operations on NVMs
inferred← citeshttps://doi.org/10.1023/a:1014982819342openalex-snapshot
Reducing Cache Conflicts by Multi-Level Cache Partitioning and Array Elements Mapping
inferred← citeshttps://doi.org/10.1109/asp-dac52403.2022.9712532openalex-snapshot
Optimal Loop Tiling for Minimizing Write Operations on NVMs with Complete Memory Latency Hiding
inferred← citeshttps://doi.org/10.1109/dac.2014.6881433openalex-snapshot
Write mode aware loop tiling for high performance low power volatile PCM
inferred← citeshttps://doi.org/10.1109/date.2008.4484842openalex-snapshot
Effective Loop Partitioning and Scheduling under Memory and Register Dual Constraints
inferred← citeshttps://doi.org/10.1109/dsd.2011.80openalex-snapshot
Hybrid Code-Data Prefetch-Aware Multiprocessor Task Graph Scheduling
inferred← citeshttps://doi.org/10.1109/icpads.2000.857699openalex-snapshot
Reducing cache conflicts by multi-level cache partitioning and array elements mapping
inferred← citeshttps://doi.org/10.1109/icpads.2006.58openalex-snapshot
Loop scheduling with complete memory latency hiding on multi-core architecture
inferred← citeshttps://doi.org/10.1109/icpads.2009.132openalex-snapshot
Energy Minimization and Latency Hiding for Heterogeneous Parallel Memory
inferred← citeshttps://doi.org/10.1109/npc.2009.13openalex-snapshot
Energy Aware Loop Scheduling for High Performance Multi-Module Memory
inferred← citeshttps://doi.org/10.1109/sips.2013.6674537openalex-snapshot
Optimal data allocation algorithm for loop-centric applications on scratch-PAD memories
inferred← citeshttps://doi.org/10.1109/tc.2015.2479605openalex-snapshot
Write Mode Aware Loop Tiling for High Performance Low Power Volatile PCM in Embedded Systems
inferred← citeshttps://doi.org/10.1109/tcad.2018.2803624openalex-snapshot
Checkpointing-Aware Loop Tiling for Energy Harvesting Powered Nonvolatile Processors
inferred← citeshttps://doi.org/10.1145/1366110.1366149openalex-snapshot
Energy saving for memory with loop scheduling and prefetching
inferred← citeshttps://doi.org/10.1145/1403375.1403667openalex-snapshot
Effective loop partitioning and scheduling under memory and register dual constraints
inferred← citeshttps://doi.org/10.1145/1698772.1698780openalex-snapshot
Iterational retiming with partitioning
inferred← citeshttps://doi.org/10.1145/2593069.2593244openalex-snapshot
Write Mode Aware Loop Tiling for High Performance Low Power Volatile PCM
inferred← citeshttps://doi.org/10.1145/581199.581232openalex-snapshot
Optimal code size reduction for software-pipelined and unfolded loops
inferred← citeshttps://doi.org/10.1145/950162.950168openalex-snapshot
Code size reduction technique and implementation for software-pipelined DSP applications
inferred← citeshttps://doi.org/10.6100/ir759498openalex-snapshot
Model-driven scheduling of dynamic streaming applications on MPSoCs
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.