Sciweavers

45 search results - page 4 / 9
» sirocco 2007
Sort
View
SIROCCO
2001
14 years 11 months ago
Efficient Condition-Based Consensus
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
SIROCCO
2004
14 years 11 months ago
Two-Hop Virtual Path Layout in Tori
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
Sébastien Choplin, Lata Narayanan, Jaroslav...
SIROCCO
2003
14 years 11 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
SIROCCO
1998
14 years 11 months ago
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Stefan Dobrev, Peter Ruzicka, Gerard Tel
SIROCCO
1998
14 years 11 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer