Sciweavers

625 search results - page 90 / 125
» Semi-preemptive routing on trees
Sort
View
ISPD
1999
ACM
127views Hardware» more  ISPD 1999»
14 years 24 days ago
Buffer insertion for clock delay and skew minimization
 Buffer insertion is an effective approach to achieve both minimal clock signal delay and skew in high speed VLSI circuit design. In this paper, we develop an optimal buffer ins...
X. Zeng, D. Zhou, Wei Li
COMCOM
2008
100views more  COMCOM 2008»
13 years 8 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
QUESTA
2008
96views more  QUESTA 2008»
13 years 8 months ago
Reduction of a polling network to a single node
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
Paul Beekhuizen, Dee Denteneer, Jacques Resing
ICCAD
2010
IEEE
141views Hardware» more  ICCAD 2010»
13 years 6 months ago
Local clock skew minimization using blockage-aware mixed tree-mesh clock network
Clock network construction is one key problem in high performance VLSI design. Reducing the clock skew variation is one of the most important objectives during clock network synthe...
Linfu Xiao, Zigang Xiao, Zaichen Qian, Yan Jiang, ...
HPSR
2011
105views more  HPSR 2011»
12 years 8 months ago
Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA
Abstract—This paper describes the implementation of ARPPath (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA ...
Guillermo Ibáñez, Bart De Schuymer, ...