Sciweavers

4037 search results - page 208 / 808
» Routing without ordering
Sort
View
101
Voted
ICCD
1992
IEEE
82views Hardware» more  ICCD 1992»
15 years 4 months ago
A Comparison of Self-Timed Design Using FPGA, CMOS, and GaAs Technologies
Asynchronous or self-timed systems that do not rely on a global clock to keep system components synchronized can offer significant advantages over traditional clocked circuits in ...
Erik Brunvand, Nick Michell, Kent F. Smith
128
Voted
STACS
1995
Springer
15 years 4 months ago
Optimal Average Case Sorting on Arrays
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, ...
112
Voted
AINA
2008
IEEE
15 years 2 months ago
3MOKAN: A Novel Mobility Management Mechanism Based on Keeping Alternative Nodes
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a r...
Mahmood Hasanlou, Ebrahim Fazli, Ali Movaghar, Hos...
96
Voted
FPGA
2008
ACM
155views FPGA» more  FPGA 2008»
15 years 2 months ago
A novel FPGA logic block for improved arithmetic performance
To improve FPGA performance for arithmetic circuits, this paper proposes a new architecture for FPGA logic cells that includes a 6:2 compressor. The new cell features additional f...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
115
Voted
NETWORKING
2010
15 years 2 months ago
Handling Transient Link Failures Using Alternate Next Hop Counters
In this paper, we propose a routing technique to alleviate packet loss due to transient link failures, which are major causes of disruption in the Internet. The proposed technique ...
Suksant Sae Lor, Raul Landa, Redouane Ali, Miguel ...