On the public citation graph
Self-timed meshes are faster than synchronous
0 signed · 34 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/bf00925471openalex-snapshot
Comparison of tree and straight-line clocking for long systolic arrays
inferredcites →https://doi.org/10.1007/bf00935211openalex-snapshot
Bubbles can make self-timed pipelines fast
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0167-9260(91)90034-iopenalex-snapshot
On the analysis and optimization of selftimed processor arrays
inferredcites →https://doi.org/10.1016/0898-1221(77)90118-3openalex-snapshot
Queueing systems, volume II: computer applications
inferredcites →https://doi.org/10.1109/async.1997.587170openalex-snapshot
The design and verification of a high-performance low-control-overhead asynchronous differential equation solver
inferredcites →https://doi.org/10.1109/icassp.1991.150588openalex-snapshot
Comparison of tree and straight-line clocking for long systolic arrays
inferredcites →https://doi.org/10.1109/tc.1985.1676619openalex-snapshot
Synchronizing Large VLSI Processor Arrays
inferredcites →https://doi.org/10.13140/rg.2.1.4128.7843openalex-snapshot
Globally-Asynchronous Locally-Synchronous Systems
inferredcites →https://doi.org/10.21236/ada447734openalex-snapshot
Performance Analysis and Optimization of Asynchronous Circuits
inferredcites →https://doi.org/10.2307/2980979openalex-snapshot
An Introduction to Probability Theory and its Applications.
inferredcites →https://doi.org/10.7907/9qzd-kv20openalex-snapshot
Reactive-Process Programming and Distributed Discrete-Event Simulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-11802-9_5openalex-snapshot
Process Variation Aware Performance Analysis of Asynchronous Circuits Considering Spatial Correlation
inferred← citeshttps://doi.org/10.1007/s11265-015-0984-6openalex-snapshot
Properties of Self-Timed Ring Architectures for Deadlock-Free and Consistent Configuration Reaching Maximum Throughput
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.11.025openalex-snapshot
High performance asynchronous design flow using a novel static performance analysis method
inferred← citeshttps://doi.org/10.1016/j.jocs.2017.03.020openalex-snapshot
Synthesizing distributed pipelining systems with timing constraints via optimal functional unit assignment and communication selection
inferred← citeshttps://doi.org/10.1016/j.mejo.2009.12.013openalex-snapshot
Process variation-aware performance analysis of asynchronous circuits
inferred← citeshttps://doi.org/10.1109/async.2001.914084openalex-snapshot
How to achieve worst-case performance [self-timed circuit design]
inferred← citeshttps://doi.org/10.1109/async.2002.1000304openalex-snapshot
Design and performance analysis of buffers: a constructive approach
inferred← citeshttps://doi.org/10.1109/async.2009.20openalex-snapshot
Bottleneck Analysis and Alleviation in Pipelined Systems: A Fast Hierarchical Approach
inferred← citeshttps://doi.org/10.1109/async.2010.15openalex-snapshot
Automated Microarchitectural Exploration for Achieving Throughput Targets in Pipelined Asynchronous Systems
inferred← citeshttps://doi.org/10.1109/async.2012.27openalex-snapshot
Performance Bounds of Asynchronous Circuits with Mode-Based Conditional Behavior
inferred← citeshttps://doi.org/10.1109/async.2013.30openalex-snapshot
Deriving Performance Bounds for Conditional Asynchronous Circuits Using Linear Programing
inferred← citeshttps://doi.org/10.1109/camp.2000.875986openalex-snapshot
Examples of image processing to benefit from an asynchronous implementation
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681614openalex-snapshot
Performance estimation and slack matching for pipelined asynchronous architectures with choice
inferred← citeshttps://doi.org/10.1109/iscas.2000.857607openalex-snapshot
Designing a low-power (self-timed) router for a MIMD computer
inferred← citeshttps://doi.org/10.1109/isqed.2009.4810310openalex-snapshot
Statistical static performance analysis of asynchronous circuits considering process variation
inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910511openalex-snapshot
On self-timed ring for consistent mapping and maximum throughput
inferred← citeshttps://doi.org/10.1145/1084834.1084892openalex-snapshot
Efficient performance analysis of asynchronous systems based on periodicity
inferred← citeshttps://doi.org/10.5555/1509456.1509560openalex-snapshot
Performance estimation and slack matching for pipelined asynchronous architectures with choice
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.