Sciweavers

1017 search results - page 100 / 204
» Throughput-centric routing algorithm design
Sort
View
DAC
2006
ACM
14 years 11 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
JCP
2008
162views more  JCP 2008»
13 years 10 months ago
A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
Youyao Liu, Jungang Han, Huimin Du
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 6 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
ADHOC
2007
122views more  ADHOC 2007»
13 years 10 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
12 years 5 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...