On the public citation graph
A fill-unit approach to multiple instruction issue
0 signed · 33 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/12.48865openalex-snapshot
Instruction issue logic for high-performance, interruptible, multiple functional unit, pipelined computers
inferredcites →https://doi.org/10.1109/32.6136openalex-snapshot
A development environment for horizontal microcode
inferredcites →https://doi.org/10.1109/40.127582openalex-snapshot
Organization of the Motorola 88110 superscalar RISC microprocessor
inferredcites →https://doi.org/10.1109/cmpcon.1992.186699openalex-snapshot
The SuperSPARC microprocessor
inferredcites →https://doi.org/10.1109/micro.1988.639255openalex-snapshot
Hardware Support For Large Atomic Units in Dynamically Scheduled Machines
inferredcites →https://doi.org/10.1109/micro.1992.697011openalex-snapshot
Interlock Collapsing ALU For Increased Instruction-level Parallelism
inferredcites →https://doi.org/10.1109/tc.1987.5009500openalex-snapshot
Checkpoint Repair for High-Performance Out-of-Order Execution Machines
inferredcites →https://doi.org/10.1145/139669.139709openalex-snapshot
Alternative implementations of two-level adaptive branch prediction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/12.737684openalex-snapshot
MPS: miss-path scheduling for multiple-issue processors
inferred← citeshttps://doi.org/10.1109/12.752652openalex-snapshot
A trace cache microarchitecture and evaluation
inferred← citeshttps://doi.org/10.1109/12.868027openalex-snapshot
Properties of rescheduling size invariance for dynamic rescheduling-based VLIW cross-generation compatibility
inferred← citeshttps://doi.org/10.1109/ecs.2014.6892626openalex-snapshot
Modified selective way based trace cache
inferred← citeshttps://doi.org/10.1109/eurmic.2000.874657openalex-snapshot
Improving binary compatibility in VLIW machines through compiler assisted dynamic rescheduling
inferred← citeshttps://doi.org/10.1109/hpca.2004.10012openalex-snapshot
Creating Converged Trace Schedules Using String Matching
inferred← citeshttps://doi.org/10.1109/iccd.1998.727106openalex-snapshot
Code coalescing unit: a mechanism to facilitate load store data communication
inferred← citeshttps://doi.org/10.1109/ipps.1999.760471openalex-snapshot
Dynamically scheduling the trace produced during program execution into VLIW instructions
inferred← citeshttps://doi.org/10.1109/isca.1998.694786openalex-snapshot
Improving trace cache effectiveness with branch promotion and trace packing
inferred← citeshttps://doi.org/10.1109/isca.2003.1207003openalex-snapshot
Parallelism in the front-end
inferred← citeshttps://doi.org/10.1109/lpe.2003.1231940openalex-snapshot
Exploiting compiler-generated schedules for energy savings in high-performance processors
inferred← citeshttps://doi.org/10.1109/micro.1995.476828openalex-snapshot
Dynamic rescheduling: a technique for object code compatibility in VLIW architectures
inferred← citeshttps://doi.org/10.1109/micro.1995.476829openalex-snapshot
Improving CISC instruction decoding performance using a fill unit
inferred← citeshttps://doi.org/10.1109/micro.1996.566445openalex-snapshot
A persistent rescheduled-page cache for low overhead object code compatibility in VLIW architectures
inferred← citeshttps://doi.org/10.1109/micro.1996.566447openalex-snapshot
Trace cache: a low latency approach to high bandwidth instruction fetching
inferred← citeshttps://doi.org/10.1109/micro.1997.645794openalex-snapshot
Alternative fetch and issue policies for the trace cache fetch mechanism
inferred← citeshttps://doi.org/10.1109/micro.1997.645795openalex-snapshot
Reducing the performance impact of instruction cache misses by writing instructions into the reservation stations out-of-order
inferred← citeshttps://doi.org/10.1109/micro.1997.645796openalex-snapshot
On high-bandwidth data cache design for multi-issue processors
inferred← citeshttps://doi.org/10.1109/micro.1998.742779openalex-snapshot
Putting the fill unit to work: dynamic optimizations for trace cache microprocessors
inferred← citeshttps://doi.org/10.1109/vtsa.1999.785995openalex-snapshot
A case for a multitrace cluster
inferred← citeshttps://doi.org/10.1145/339647.339702openalex-snapshot
Allowing for ILP in an embedded Java processor
inferred← citeshttps://doi.org/10.1145/3579371.3589067openalex-snapshot
An Algorithm and Architecture Co-design for Accelerating Smart Contracts in Blockchain
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.