Sciweavers

283 search results - page 27 / 57
» The Price of Routing in FPGAs
Sort
View
FPGA
2005
ACM
90views FPGA» more  FPGA 2005»
14 years 1 months ago
Using bus-based connections to improve field-programmable gate array density for implementing datapath circuits
Abstract—As the logic capacity of field-programmable gate arrays (FPGAs) increases, they are increasingly being used to implement large arithmetic-intensive applications, which ...
Andy Gean Ye, Jonathan Rose
DAC
2009
ACM
14 years 7 days ago
GRIP: scalable 3D global routing using integer programming
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
INFOCOM
2006
IEEE
14 years 1 months ago
Using Repeated Games to Design Incentive-Based Routing Systems
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
Michael Afergan
ISCAS
2002
IEEE
89views Hardware» more  ISCAS 2002»
14 years 14 days ago
On segmented channel routability
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...
William N. N. Hung, Xiaoyu Song, Alan J. Coppola, ...
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
14 years 1 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail