Sciweavers

1198 search results - page 169 / 240
» Compiling for EDGE Architectures
Sort
View
SIGCOMM
2000
ACM
15 years 7 months ago
A framework for scalable global IP-anycast (GIA)
This paper proposes GIA, a scalable architecture for global IPanycast. Existing designs for providing IP-anycast must either globally distribute routes to individual anycast group...
Dina Katabi, John Wroclawski
168
Voted
ICIAP
1999
ACM
15 years 7 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 7 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
134
Voted
SERP
2003
15 years 4 months ago
Memory Access Characteristics of Network Infrastructure Applications
Network infrastructure is composed of various devices located either in the core or at the edges of a wide-area network. These devices are required to deliver high transaction thr...
Abdul Waheed
CORR
2006
Springer
80views Education» more  CORR 2006»
15 years 3 months ago
Exact Failure Frequency Calculations for Extended Systems
This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product...
Annie Druault-Vicard, Christian Tanguy