On the public citation graph

Increasing the size of atomic instruction blocks using control flow assertions

0 signed · 28 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.1007/bf02577867openalex-snapshot
Enhancing instruction scheduling with a block-structured ISA
inferredcites →https://doi.org/10.1016/s0304-3975(00)00051-7openalex-snapshot
DyC: an expressive annotation-directed dynamic compiler for C
inferredcites →https://doi.org/10.1109/12.752661openalex-snapshot
Evaluation of design options for the trace cache fetch mechanism
inferredcites →https://doi.org/10.1109/isca.1998.694786openalex-snapshot
Improving trace cache effectiveness with branch promotion and trace packing
inferredcites →https://doi.org/10.1109/micro.1996.566447openalex-snapshot
Trace cache: a low latency approach to high bandwidth instruction fetching
inferredcites →https://doi.org/10.1109/tc.1981.1675827openalex-snapshot
Trace Scheduling: A Technique for Global Microcode Compaction
inferredcites →https://doi.org/10.1145/123465.123475openalex-snapshot
Two-level adaptive training branch prediction
inferredcites →https://doi.org/10.1145/195473.195549openalex-snapshot
Improving the accuracy of static branch prediction using branch correlation
inferredcites →https://doi.org/10.1145/279358.279368openalex-snapshot
An analysis of correlation and predictability: what makes two-level branch predictors work
inferredcites →https://doi.org/10.1145/291069.291042openalex-snapshot
Variable length path branch prediction
inferredcites →https://doi.org/10.1145/339647.339655openalex-snapshot
A hardware mechanism for dynamic extraction and relayout of program hot spots

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.931894openalex-snapshot
An architectural framework for runtime optimization
inferred← citeshttps://doi.org/10.1109/12.931895openalex-snapshot
rePLay: A hardware framework for dynamic optimization
inferred← citeshttps://doi.org/10.1109/cgo.2004.1281670openalex-snapshot
Specialized dynamic optimizations for high-performance energy-efficient microarchitecture
inferred← citeshttps://doi.org/10.1109/cgo.2013.6494980openalex-snapshot
Acceldroid: Co-designed acceleration of Android bytecode
inferred← citeshttps://doi.org/10.1109/iccd.2014.6974710openalex-snapshot
The heterogeneous block architecture
inferred← citeshttps://doi.org/10.1109/icpp.2003.1240629openalex-snapshot
Aggressive compiler optimization and parallelization with thread-level speculation
inferred← citeshttps://doi.org/10.1109/iiswc.2016.7581273openalex-snapshot
Rebalancing the core front-end through HPC code analysis
inferred← citeshttps://doi.org/10.1109/intera.2004.1299514openalex-snapshot
Reducing fetch architecture complexity using procedure inlining
inferred← citeshttps://doi.org/10.1109/isca.2003.1207003openalex-snapshot
Parallelism in the front-end
inferred← citeshttps://doi.org/10.1109/isca.2004.1310772openalex-snapshot
Power awareness through selective dynamically optimized traces
inferred← citeshttps://doi.org/10.1109/isca.2004.1310778openalex-snapshot
From sequences of dependent instructions to functions : an approach for improving performance without ilp or speculation
inferred← citeshttps://doi.org/10.1109/micro.2005.23openalex-snapshot
Incremental Commit Groups for Non-Atomic Trace Processing
inferred← citeshttps://doi.org/10.1109/pact.2001.953297openalex-snapshot
Code reordering and speculation support for dynamic optimization systems
inferred← citeshttps://doi.org/10.1109/pact.2011.69openalex-snapshot
Modeling and Performance Evaluation of TSO-Preserving Binary Optimization
inferred← citeshttps://doi.org/10.1109/tc.2008.170openalex-snapshot
DIA: A Complexity-Effective Decoding Architecture
inferred← citeshttps://doi.org/10.1145/859618.859645openalex-snapshot
Parallelism in the front-end
inferred← citeshttps://doi.org/10.18130/v3479copenalex-snapshot
Trace-Based Dynamic Binary Parallelization
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.