Sciweavers

283 search results - page 12 / 57
» The Price of Routing in FPGAs
Sort
View
TVLSI
2008
111views more  TVLSI 2008»
13 years 7 months ago
GlitchLess: Dynamic Power Minimization in FPGAs Through Edge Alignment and Glitch Filtering
This paper describes Glitchless, a circuit-level technique for reducing power in FPGAs by eliminating unnecessary logic transitions called glitches. This is done by adding program...
Julien Lamoureux, Guy G. Lemieux, Steven J. E. Wil...
INFOCOM
2010
IEEE
13 years 6 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
IATA
1999
Springer
13 years 11 months ago
Market-Based Call Routing in Telecommunications Networks Using Adaptive Pricing and Real Bidding
We present a market-based approach to call routing in telecommunications networks. A system architecture is described that allows self-interested agents, representing various netwo...
M. A. Gibney, Nicholas R. Jennings, N. J. Vriend, ...
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 29 days ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
ARC
2007
Springer
169views Hardware» more  ARC 2007»
14 years 1 months ago
Designing Heterogeneous FPGAs with Multiple SBs
Abstract. The novel design of high-speed and low-energy FPGA routing architecture consisting of appropriate wire segments and multiple Switch Boxes is introduced. For that purpose,...
Kostas Siozios, Stelios Mamagkakis, Dimitrios Soud...