On the public citation graph

Scheduling Arithmetic and Load Operations in Parallel with No Spilling

0 signed · 31 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.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1109/tc.1984.1676395openalex-snapshot
VLSI Processor Architecture
inferredcites →https://doi.org/10.1145/321607.321620openalex-snapshot
The Generation of Optimal Code for Arithmetic Expressions
inferredcites →https://doi.org/10.1145/321958.321970openalex-snapshot
Optimal Code Generation for Expression Trees
inferredcites →https://doi.org/10.1145/321958.321971openalex-snapshot
Code Generation for a One-Register Machine
inferredcites →https://doi.org/10.1145/321992.322001openalex-snapshot
Code Generation for Expressions with Common Subexpressions
inferredcites →https://doi.org/10.1145/359327.359336openalex-snapshot
The CRAY-1 computer system
inferredcites →https://doi.org/10.1145/362848.362859openalex-snapshot
On arithmetic expressions and trees
inferredcites →https://doi.org/10.1145/363534.363549openalex-snapshot
On compiling algorithms for arithmetic expressions
inferredcites →https://doi.org/10.1147/rd.273.0237openalex-snapshot
The 801 Minicomputer

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118625446.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/cpe.1175openalex-snapshot
Classification and generation of schedules for VLIW processors
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_88openalex-snapshot
Scheduling expression DAGs for minimal register need
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/s10766-005-6466-xopenalex-snapshot
Register Saturation in Instruction Level Parallelism
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90032-vopenalex-snapshot
Heuristic chaining in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/0096-0551(95)00001-kopenalex-snapshot
Scheduling expression trees with reusable registers on delayed-load architectures
inferred← citeshttps://doi.org/10.1016/0165-6074(94)90102-3openalex-snapshot
Scheduliing expression trees with register variables on delayed-load architectures
inferred← citeshttps://doi.org/10.1016/s0096-0551(98)00002-2openalex-snapshot
Scheduling expression DAGs for minimal register need
inferred← citeshttps://doi.org/10.1109/icppw.2004.1328069openalex-snapshot
On the optimality of register saturation
inferred← citeshttps://doi.org/10.1109/icppw.2004.64openalex-snapshot
On the optimality of register saturation
inferred← citeshttps://doi.org/10.1109/micro.1995.476819openalex-snapshot
Spill-free parallel scheduling of basic blocks
inferred← citeshttps://doi.org/10.1137/s009753979834610xopenalex-snapshot
Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads
inferred← citeshttps://doi.org/10.1145/113445.113466openalex-snapshot
Global instruction scheduling for superscalar machines
inferred← citeshttps://doi.org/10.1145/113445.113467openalex-snapshot
Linear-time, optimal code scheduling for delayed-load architectures
inferred← citeshttps://doi.org/10.1145/113446.113466openalex-snapshot
Global instruction scheduling for superscalar machines
inferred← citeshttps://doi.org/10.1145/113446.113467openalex-snapshot
Linear-time, optimal code scheduling for delayed-load architectures
inferred← citeshttps://doi.org/10.1145/12276.13311openalex-snapshot
Optimal chaining in expression trees
inferred← citeshttps://doi.org/10.1145/13310.13311openalex-snapshot
Optimal chaining in expression trees
inferred← citeshttps://doi.org/10.1145/213978.213987openalex-snapshot
Efficient instruction scheduling for delayed-load architectures
inferred← citeshttps://doi.org/10.5555/225160.225182openalex-snapshot
Spill-free parallel scheduling of basic blocks
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.