Sciweavers

12659 search results - page 459 / 2532
» The distributed breakout algorithms
Sort
View
SPAA
2003
ACM
16 years 28 days ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
TSP
2008
88views more  TSP 2008»
15 years 7 months ago
Statistical Performance of MUSIC-Like Algorithms in Resolving Noncircular Sources
Abstract--This paper addresses the resolution of the conventional and noncircular MUSIC algorithms for arbitrary circular and noncircular second-order distributions of two uncorrel...
Habti Abeida, Jean Pierre Delmas
PPOPP
2006
ACM
16 years 1 months ago
High-performance IPv6 forwarding algorithm for multi-core and multithreaded network processor
IP forwarding is one of the main bottlenecks in Internet backbone routers, as it requires performing the longest-prefix match at 10Gbps speed or higher. IPv6 forwarding further ex...
Xianghui Hu, Xinan Tang, Bei Hua
PPOPP
1999
ACM
15 years 12 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
SPAA
1990
ACM
15 years 11 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson