Sciweavers

4586 search results - page 829 / 918
» Computing stable models in parallel
Sort
View
SPAA
2006
ACM
15 years 7 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
SPAA
2005
ACM
15 years 7 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
PODC
2004
ACM
15 years 7 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
PODC
2003
ACM
15 years 7 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
124
Voted
ISORC
2002
IEEE
15 years 6 months ago
IKE 2-Implementing the Stateful Distributed Object Paradigm
— This paper describes IKE 2, which is distributed object computing middleware that supports the creation of interoperable realtime distributed applications. These applications a...
J. Russell Noseworthy