Sciweavers

FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
13 years 10 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
AINA
2005
IEEE
13 years 10 months ago
A Biologically Inspired QoS Routing Algorithm for Mobile Ad Hoc Networks
— This paper presents an Emergent Ad hoc Routing Algorithm with QoS provision (EARA-QoS). This ad hoc QoS routing algorithm is based on a swarm intelligence inspired routing infr...
Zhenyu Liu, Marta Z. Kwiatkowska, Costas C. Consta...
SASN
2006
ACM
13 years 10 months ago
Achieving privacy in mesh networks
Mesh network is vulnerable to privacy attacks because of the open medium property of wireless channel, the fixed topology, and the limited network size. Traditional anonymous rou...
Xiaoxin Wu, Ninghui Li
DAC
2006
ACM
13 years 10 months ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone
IPPS
2006
IEEE
13 years 10 months ago
Dynamic power saving in fat-tree interconnection networks using on/off links
Current trends in high-performance parallel computers show that fat-tree interconnection networks are one of the most popular topologies. The particular characteristics of this to...
Marina Alonso, Salvador Coll, Juan Miguel Mart&iac...
INFOCOM
2006
IEEE
13 years 10 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
DSD
2006
IEEE
159views Hardware» more  DSD 2006»
13 years 10 months ago
Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions
Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as pr...
Rickard Holsmark, Maurizio Palesi, Shashi Kumar
PDCAT
2007
Springer
13 years 10 months ago
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...
Yamin Li, Shietung Peng, Wanming Chu
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
13 years 10 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan
ICDCIT
2007
Springer
13 years 10 months ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...