Sciweavers

145 search results - page 9 / 29
» Parallel Global Routing Algorithms for Standard Cells
Sort
View
HPCC
2007
Springer
14 years 1 months ago
Improving a Fault-Tolerant Routing Algorithm Using Detailed Traffic Analysis
Currently, some coarse measures like global network latency are used to compare routing protocols. These measures do not provide enough insight of traffic distribution among networ...
Abbas Nayebi, Arash Shamaei, Hamid Sarbazi-Azad
ISPD
2005
ACM
221views Hardware» more  ISPD 2005»
14 years 1 months ago
Kraftwerk: a versatile placement approach
During the ispd05 placement contest, we employed the forcedirected approach Kraftwerk for global placement complemented by the network-flow based final placer Domino. These powe...
Bernd Obermeier, Hans Ranke, Frank M. Johannes
COSIT
2007
Springer
103views GIS» more  COSIT 2007»
13 years 9 months ago
Scale-Dependent Simplification of 3D Building Models Based on Cell Decomposition and Primitive Instancing
Abstract. The paper proposes a novel approach for a scale-dependent geometric simplification of 3D building models that are an integral part of virtual cities. In contrast to real-...
Martin Kada
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
12 years 3 months ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
SPAA
2004
ACM
14 years 25 days ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...