On the public citation graph

Concurrency extraction via hardware methods executing the static instruction stream

0 signed · 55 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.1002/spe.4380010203openalex-snapshot
An empirical study of FORTRAN programs
inferredcites →https://doi.org/10.1007/3-540-18991-2_21openalex-snapshot
Incremental performance contributions of hardware concurrency extraction techniques
inferredcites →https://doi.org/10.1109/12.2247openalex-snapshot
A VLIW architecture for a trace scheduling compiler
inferredcites →https://doi.org/10.1109/12.83637openalex-snapshot
Distributed instruction set computer architecture
inferredcites →https://doi.org/10.1109/12.90247openalex-snapshot
A theory of reduced and minimal procedural dependencies
inferredcites →https://doi.org/10.1109/2.19820openalex-snapshot
The Cydra 5 departmental supercomputer: design philosophies, decisions, and trade-offs
inferredcites →https://doi.org/10.1109/40.87564openalex-snapshot
The Metaflow architecture
inferredcites →https://doi.org/10.1109/mc.1982.1654133openalex-snapshot
A VLSI RISC
inferredcites →https://doi.org/10.1109/mc.1984.1658962openalex-snapshot
Supercomputing
inferredcites →https://doi.org/10.1109/micro.1988.639239openalex-snapshot
Modelling The Effects Of Instruction Queue Loading On A Static Instruction Stream Micro-architecture
inferredcites →https://doi.org/10.1109/pgec.1966.264565openalex-snapshot
Analysis of Programs for Parallel Processing
inferredcites →https://doi.org/10.1109/t-c.1972.223501openalex-snapshot
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
inferredcites →https://doi.org/10.1109/t-c.1972.223514openalex-snapshot
The Inhibition of Potential Parallelism by Conditional Jumps
inferredcites →https://doi.org/10.1109/tc.1973.5009154openalex-snapshot
Representation of Concurrency with Ordering Matrices
inferredcites →https://doi.org/10.1109/tc.1981.1675827openalex-snapshot
Trace Scheduling: A Technique for Global Microcode Compaction
inferredcites →https://doi.org/10.1109/tc.1983.1676253openalex-snapshot
The Piecewise Data Flow Architecture: Architectural Concepts
inferredcites →https://doi.org/10.1109/tc.1986.1676841openalex-snapshot
An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors
inferredcites →https://doi.org/10.1145/106972.106991openalex-snapshot
Limits of instruction-level parallelism
inferredcites →https://doi.org/10.1145/115952.115979openalex-snapshot
IMPACT
inferredcites →https://doi.org/10.1145/115952.115980openalex-snapshot
Single instruction stream parallelism is greater than two
inferredcites →https://doi.org/10.1145/115952.115981openalex-snapshot
Exploiting fine-grained parallelism through a combination of hardware and software techniques
inferredcites →https://doi.org/10.1145/139669.140497openalex-snapshot
Data path issues in a highly concurrent machine (abstract)
inferredcites →https://doi.org/10.1145/144965.145010openalex-snapshot
Data path issues in a highly concurrent machine
inferredcites →https://doi.org/10.1145/1464039.1464045openalex-snapshot
Parallel operation in the control data 6600
inferredcites →https://doi.org/10.1145/17356.17391openalex-snapshot
HPSm, a high performance restricted data flow architecture having minimal functionality
inferredcites →https://doi.org/10.1145/18906.18916openalex-snapshot
HPS, a new microarchitecture: rationale and introduction
inferredcites →https://doi.org/10.1145/18927.18916openalex-snapshot
HPS, a new microarchitecture: rationale and introduction
inferredcites →https://doi.org/10.1145/255305.255331openalex-snapshot
On the combination of hardware and software concurrency extraction methods
inferredcites →https://doi.org/10.1145/285930.285985openalex-snapshot
Very long instruction work architectures and the ELI-512
inferredcites →https://doi.org/10.1145/285930.285989openalex-snapshot
HPSm, a high performance restricted data flow architecture having minimal functionality
inferredcites →https://doi.org/10.1145/355602.361319openalex-snapshot
Algorithm 428: Hu-Tucker minimum redundancy alphabetic coding method [Z]
inferredcites →https://doi.org/10.1145/358274.358283openalex-snapshot
Dhrystone
inferredcites →https://doi.org/10.1145/36204.36201openalex-snapshot
A VLIW architecture for a trace scheduling compiler
inferredcites →https://doi.org/10.1145/362588.362602openalex-snapshot
Algorithm 410: Partial sorting
inferredcites →https://doi.org/10.1145/800046.801649openalex-snapshot
Very Long Instruction Word architectures and the ELI-512
inferredcites →https://doi.org/10.1147/rd.111.0008openalex-snapshot
The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling
inferredcites →https://doi.org/10.1147/rd.111.0025openalex-snapshot
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
inferredcites →https://doi.org/10.5555/62504.62509openalex-snapshot
Modelling The Effects Of Instruction Queue Loading On A Static Instruction Stream Micro-architecture

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bfb0100636openalex-snapshot
Exploiting speculative thread-level parallelism on a SMT processor
inferred← citeshttps://doi.org/10.1109/12.90247openalex-snapshot
A theory of reduced and minimal procedural dependencies
inferred← citeshttps://doi.org/10.1109/71.159040openalex-snapshot
Requirements for optimal execution of loops with tests
inferred← citeshttps://doi.org/10.1109/eurmic.1998.711819openalex-snapshot
Data speculative multithreaded architecture
inferred← citeshttps://doi.org/10.1109/isca.1999.765936openalex-snapshot
Dynamic vectorization: a mechanism for exploiting far-flung ILP in ordinary programs
inferred← citeshttps://doi.org/10.1109/isca.2002.1003585openalex-snapshot
Speculative dynamic vectorization
inferred← citeshttps://doi.org/10.1109/micro.1992.697006openalex-snapshot
Data Path Issues In A Highly Concurrent Machine
inferred← citeshttps://doi.org/10.1109/micro.1995.476841openalex-snapshot
Disjoint eager execution: an optimal form of speculative execution
inferred← citeshttps://doi.org/10.1145/144965.145010openalex-snapshot
Data path issues in a highly concurrent machine
inferred← citeshttps://doi.org/10.1145/152479.152481openalex-snapshot
Extraction of massive instruction level parallelism
inferred← citeshttps://doi.org/10.1145/152835.152836openalex-snapshot
Extraction of massive instruction level parallelism
inferred← citeshttps://doi.org/10.1145/264107.264119openalex-snapshot
Improving superscalar instruction dispatch and issue by exploiting dynamic code sequences
inferred← citeshttps://doi.org/10.1145/277830.277850openalex-snapshot
Speculative multithreaded processors
inferred← citeshttps://doi.org/10.1145/307338.300981openalex-snapshot
Dynamic vectorization
inferred← citeshttps://doi.org/10.1145/384286.264119openalex-snapshot
Improving superscalar instruction dispatch and issue by exploiting dynamic code sequences
inferred← citeshttps://doi.org/10.1145/545214.545246openalex-snapshot
Speculative dynamic vectorization
inferred← citeshttps://doi.org/10.5555/225160.225208openalex-snapshot
Disjoint eager execution: an optimal form of speculative execution
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.