Sciweavers

1912 search results - page 7 / 383
» Optimizing interconnection policies
Sort
View
GLOBECOM
2006
IEEE
14 years 3 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Kevin Ross, Nicholas Bambos
UAI
1998
13 years 10 months ago
An Anytime Algorithm for Decision Making under Uncertainty
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
Michael C. Horsch, David Poole
ISCAS
2005
IEEE
119views Hardware» more  ISCAS 2005»
14 years 2 months ago
Analysis of power consumption in VLSI global interconnects
Abstract— The analysis of effects induced by interconnects become increasingly important as the scale of process technologies steadily shrinks. While most analyses focus on the t...
Youngsoo Shin, Hyung-Ock Kim
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 3 months ago
Optimal Scheduling Policy Determination for High Speed Downlink Packet Access
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
14 years 2 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu