Sciweavers

165 search results - page 8 / 33
» Using Eigenvectors to Partition Circuits
Sort
View
EPEW
2005
Springer
14 years 2 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
ICCD
2005
IEEE
101views Hardware» more  ICCD 2005»
14 years 5 months ago
Three-Dimensional Cache Design Exploration Using 3DCacti
As technology scales, interconnects dominate the performance and power behavior of deep submicron designs. Three-dimensional integrated circuits (3D ICs) have been proposed as a w...
Yuh-Fang Tsai, Yuan Xie, Narayanan Vijaykrishnan, ...
ISCAS
2008
IEEE
115views Hardware» more  ISCAS 2008»
14 years 3 months ago
FSMD partitioning for low power using simulated annealing
— It is well known that significant power savings can be obtained by disabling or shutting down parts of a circuit during idle periods. One method is to use a high level partiti...
Nainesh Agarwal, Nikitas J. Dimopoulos
JSA
2006
67views more  JSA 2006»
13 years 8 months ago
Speedup of NULL convention digital circuits using NULL cycle reduction
A NULL Cycle Reduction (NCR) technique is developed to increase the throughput of NULL Convention Logic systems, by reducing the time required to flush complete DATA wavefronts, c...
S. C. Smith
VLSID
2003
IEEE
167views VLSI» more  VLSID 2003»
14 years 9 months ago
Timing Minimization by Statistical Timing hMetis-based Partitioning
In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing cri...
Cristinel Ababei, Kia Bazargan