6105 search results - page 430 / 1221 » A Parallel Algorithm for Bound-Smoothing |
202
click to vote
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
166
click to vote
SPAA
2004
ACM
16 years 9 days ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
187
click to vote
SPAA
2003
ACM
16 years 3 days ago
2003
ACM
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...
147
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
189
click to vote
ISPAN
1999
IEEE
15 years 11 months ago
1999
IEEE
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...