On the public citation graph
Fine-grain compilation for pipelined machines
0 signed · 25 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/3-540-18991-2_23openalex-snapshot
Scheduling sequential loops on parallel processors
inferredcites →https://doi.org/10.1007/3-540-19027-9_15openalex-snapshot
Perfect pipelining: A new loop parallelization technique
inferredcites →https://doi.org/10.1016/0743-7315(88)90002-0openalex-snapshot
Estimating interlock and improving balance for pipelined architectures
inferredcites →https://doi.org/10.1016/s0022-0000(75)80008-0openalex-snapshot
NP-complete scheduling problems
inferredcites →https://doi.org/10.1109/mc.1986.1663324openalex-snapshot
Peak vs. Sustained Performance in Highly Concurrent Vector Machines
inferredcites →https://doi.org/10.1145/255305.255317openalex-snapshot
A compilation technique for software pipelining of loops with conditional jumps
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/567067.567085openalex-snapshot
Conversion of control dependence to data dependence
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.1993.1113openalex-snapshot
An Efficient Hybrid Dataflow Architecture Model
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_462openalex-snapshot
A polynomial time method for optimal software pipelining
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_20openalex-snapshot
Extending software pipelining techniques for scheduling nested loops
inferred← citeshttps://doi.org/10.1007/978-1-4613-9668-0_33openalex-snapshot
Parallelism, Compiler Optimization, and Deterministic Scheduling Theory
inferred← citeshttps://doi.org/10.1007/978-1-4615-4002-1_4openalex-snapshot
Compiling Issues of Monolithic Arrays
inferred← citeshttps://doi.org/10.1007/bf02407086openalex-snapshot
Rate-optimal schedule for multi-rate DSP computations
inferred← citeshttps://doi.org/10.1109/71.476167openalex-snapshot
Resource-constrained software pipelining
inferred← citeshttps://doi.org/10.1109/71.544355openalex-snapshot
A framework for resource-constrained rate-optimal software pipelining
inferred← citeshttps://doi.org/10.1109/pccc.1990.101718openalex-snapshot
Dataflow software pipelining: a case study
inferred← citeshttps://doi.org/10.1145/113445.113463openalex-snapshot
A timed Petri-net model for fine-grain loop scheduling
inferred← citeshttps://doi.org/10.1145/113446.113463openalex-snapshot
A timed Petri-net model for fine-grain loop scheduling
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.