Sciweavers

1017 search results - page 96 / 204
» A routing algorithm for flip-chip design
Sort
View
ANCS
2007
ACM
14 years 29 days ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
TIT
2010
101views Education» more  TIT 2010»
13 years 3 months ago
Separation principles in wireless networking
A general wireless networking problem is formulated whereby end-to-end user rates, routes, link capacities, transmitpower, frequency and power resources are jointly optimized acros...
Alejandro Ribeiro, Georgios B. Giannakis
DATE
2004
IEEE
158views Hardware» more  DATE 2004»
14 years 21 days ago
Bandwidth-Constrained Mapping of Cores onto NoC Architectures
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...
Srinivasan Murali, Giovanni De Micheli
COR
2007
112views more  COR 2007»
13 years 9 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
SAC
2005
ACM
14 years 2 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...