Sciweavers

467 search results - page 16 / 94
» How much can hardware help routing
Sort
View
KI
2008
Springer
13 years 7 months ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
ICCAD
2001
IEEE
103views Hardware» more  ICCAD 2001»
14 years 4 months ago
Interconnect Resource-Aware Placement for Hierarchical FPGAs
In this paper, we utilize Rent’s rule as an empirical measure for efficient clustering and placement of circuits on hierarchical FPGAs. We show that careful matching of design c...
Amit Singh, Ganapathy Parthasarathy, Malgorzata Ma...
USS
2004
13 years 8 months ago
A Virtual Honeypot Framework
A honeypot is a closely monitored network decoy serving several purposes: it can distract adversaries from more valuable machines on a network, can provide early warning about new...
Niels Provos
ICC
2009
IEEE
103views Communications» more  ICC 2009»
14 years 2 months ago
FSA: A Fast Coordination Scheme for Opportunistic Routing
—Opportunistic Routing (OR) has been considered as one promising technique to overcome the unreliability of the wireless medium by collaborating multiple neighboring receivers/ca...
Zhenyu Yang, Kai Zeng, Wenjing Lou
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
14 years 21 days ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu