Sciweavers

89 search results - page 1 / 18
» Hierarchical random-walk algorithms for power grid analysis
Sort
View
DAC
2003
ACM
14 years 5 months ago
Random walks in a supply network
This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transien...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
ASPDAC
2007
ACM
112views Hardware» more  ASPDAC 2007»
13 years 8 months ago
Efficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid
Due to the extremely large sizes of power grids, IR drop analysis has become a computationally challenging problem both in terms of runtime and memory usage. It has been shown in [...
Yu Zhong, Martin D. F. Wong
ISPD
2004
ACM
161views Hardware» more  ISPD 2004»
13 years 10 months ago
Early-stage power grid analysis for uncertain working modes
High performance integrated circuits are now reaching the 100-plus watt regime, and power delivery and power grid signal integrity have become critical. Analyzing the performance ...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
MSWIM
2006
ACM
13 years 10 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
13 years 11 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He