Sciweavers

1017 search results - page 161 / 204
» Throughput-centric routing algorithm design
Sort
View
SIGCOMM
2005
ACM
14 years 2 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
DAC
2003
ACM
14 years 9 months ago
Dynamic hardware/software partitioning: a first approach
Partitioning an application among software running on a microprocessor and hardware co-processors in on-chip configurable logic has been shown to improve performance and energy co...
Greg Stitt, Roman L. Lysecky, Frank Vahid
MOBIHOC
2009
ACM
14 years 9 months ago
Multicasting in delay tolerant networks: a social network perspective
Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used ...
Wei Gao, Qinghua Li, Bo Zhao, Guohong Cao
VLSID
2005
IEEE
128views VLSI» more  VLSID 2005»
14 years 9 months ago
On-Line Synthesis for Partially Reconfigurable FPGAs
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
Renqiu Huang, Ranga Vemuri
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
14 years 5 months ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata