Sciweavers

49 search results - page 3 / 10
» Timing Analysis with Implicitly Specified False Paths
Sort
View
DAC
2002
ACM
14 years 6 months ago
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
Jing-Jia Liou, Angela Krstic, Li-C. Wang, Kwang-Ti...
MICRO
2006
IEEE
107views Hardware» more  MICRO 2006»
13 years 5 months ago
Dataflow Predication
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitecture...
Aaron Smith, Ramadass Nagarajan, Karthikeyan Sanka...
INFOCOM
2010
IEEE
13 years 3 months ago
Safeguarding Data Delivery by Decoupling Path Propagation and Adoption
—False routing announcements are a serious security problem, which can lead to widespread service disruptions in the Internet. A number of detection systems have been proposed an...
Mingui Zhang, Bin Liu, Beichuan Zhang
LCTRTS
1998
Springer
13 years 9 months ago
Integrating Path and Timing Analysis Using Instruction-Level Simulation Techniques
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
Thomas Lundqvist, Per Stenström
IPL
2007
89views more  IPL 2007»
13 years 5 months ago
On the longest path algorithm for reconstructing trees from distance matrices
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
Lev Reyzin, Nikhil Srivastava