On the public citation graph
Modulo scheduling with cache reuse information
0 signed · 20 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/micro.1993.282750openalex-snapshot
Predictability of load/store instruction latencies
inferredcites →https://doi.org/10.1145/143365.143486openalex-snapshot
Reducing memory latency via non-blocking and prefetching caches
inferredcites →https://doi.org/10.1145/143365.143488openalex-snapshot
Design and evaluation of a compiler algorithm for prefetching
inferredcites →https://doi.org/10.1145/143371.143488openalex-snapshot
Design and evaluation of a compiler algorithm for prefetching
inferredcites →https://doi.org/10.1145/233561.233564openalex-snapshot
Improving data locality with loop transformations
inferredcites →https://doi.org/10.1145/960116.54022openalex-snapshot
Software pipelining: an effective scheduling technique for VLIW machines
inferredcites →https://doi.org/10.5555/255235.255275openalex-snapshot
Predictability of load/store instruction latencies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1553openalex-snapshot
Software Data Prefetching for Software Pipelined Loops
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_31openalex-snapshot
Load Scheduling with Profile Information
inferred← citeshttps://doi.org/10.1007/978-1-4757-3337-2_4openalex-snapshot
Improving Software Pipelining by Hiding Memory Latency with Combined Loads and Prefetches
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_16openalex-snapshot
Aligned Scheduling: Cache-Efficient Instruction Scheduling for VLIW Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-49051-7_19openalex-snapshot
Extending Modulo Scheduling with Memory Reference Merging
inferred← citeshttps://doi.org/10.1109/hpcc.2009.32openalex-snapshot
On Instruction-Level Method for Reducing Cache Penalties in Embedded VLIW Processors
inferred← citeshttps://doi.org/10.1109/micro.2001.991114openalex-snapshot
Graph-partitioning based instruction scheduling for clustered processors
inferred← citeshttps://doi.org/10.1145/309758.309784openalex-snapshot
Improving software pipelining with hardware support for self-spatial loads
inferred← citeshttps://doi.org/10.5555/563998.564019openalex-snapshot
Graph-partitioning based instruction scheduling for clustered processors
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93280openalex-snapshot
Smart memory management through locality analysis
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.