2924 search results - page 5 / 585 » Lower Bounds in Distributed Computing |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Gossiping is an information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
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...
TON
2010
13 years 2 months ago
2010
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...