Sciweavers

343 search results - page 4 / 69
» Estimating routing congestion using probabilistic analysis
Sort
View
SPAA
2005
ACM
14 years 27 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
ISVLSI
2007
IEEE
150views VLSI» more  ISVLSI 2007»
14 years 1 months ago
Minimum-Congestion Placement for Y-interconnects: Some studies and observations
— Y -interconnects for VLSI chips are based on the use of global and semi-global wiring in only 0◦ , 60◦ , and 120◦ . Though X-interconnects are fast replacing the traditio...
Tuhina Samanta, Prasun Ghosal, Hafizur Rahaman, Pa...
DEDS
2002
90views more  DEDS 2002»
13 years 7 months ago
Perturbation Analysis for Stochastic Fluid Queueing Systems
Recent study for congestion control in high speed networks indicates that the derivative information for the congestion at the common buffer for multiple sources could be useful i...
Yong Liu, Weibo Gong
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
14 years 4 months ago
FastRoute: a step to integrate global routing into placement
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Min Pan, Chris C. N. Chu
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
14 years 23 days ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja