Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David I. Dill

dblp:314/5070 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 67% Integrated circuit design · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design
asynchronous circuit design
0.011999
Min-max timing analysis and an application to asynchronous circuits · Proc. IEEE 1999
Electronic design automation
timing analysis
0.011999
Min-max timing analysis and an application to asynchronous circuits · Proc. IEEE 1999
Electronic design automation › hardware verification and test › timing verification
timing constraint verification
0.011999
Min-max timing analysis and an application to asynchronous circuits · Proc. IEEE 1999

Methods — techniques the papers use, named apart from their topics

reconvergent fanout analysis · 0.0bounded delay model · 0.0abstract waveform algebra · 0.0
YearPublicationVenuePosition
1999 Min-max timing analysis and an application to asynchronous circuits
abstract
Modern high-performance asynchronous circuits depend on timing constraints for correct operation, so timing analyzers are essential asynchronous design tools. In this paper we present a 13-valued abstract waveform algebra and a polynomial-time min-max timing simulation algorithm for use in efficient, approximate timing analysis of asynchronous circuits with bounded component delays. Unlike several previous approaches, our algorithm computes separate propagation delay bounds from each circuit input to each internal gate. This is useful for analyzing asynchronous circuits, where the relative transition times of the inputs may not be known a priori, unlike synchronous circuits. We also describe an efficient reconvergent fanout analysis technique that helps in increasing the accuracy of simulation. We have applied our algorithm to build an efficient timing analysis tool for extended burst-mode circuits (a class of timing-dependent asynchronous circuits) implemented in the 30 design style. Our tool analyzes gate-level 30 circuits assuming bounded component delays and determines safe timing constraints for correct operation. Although our results represent conservative approximations to the true timing requirements in the worst case, experiments indicate that our technique is efficient and fairly accurate in practice.
Supratik Chakraborty, David I. Dill, Kenneth Y. Yun
Proc. IEEE2