Sciweavers

283 search results - page 22 / 57
» The Price of Routing in FPGAs
Sort
View
WICON
2008
13 years 9 months ago
Quality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
Costas Busch, Rajgopal Kannan, Athanasios V. Vasil...
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 11 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
SAINT
2008
IEEE
14 years 1 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
DAC
2006
ACM
14 years 8 months ago
A new hybrid FPGA with nanoscale clusters and CMOS routing
In this paper we propose a hybrid FPGA using nanoscale clusters with an architecture similar to clusters of traditional CMOS FPGAs. The proposed cluster is made of a crossbar of n...
Reza M. Rad, Mohammad Tehranipoor