2084 search results - page 397 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
TWC
2011
14 years 4 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
EUROSYS
2011
ACM
14 years 1 months ago
2011
ACM
To improve data availability and resilience MapReduce frameworks use file systems that replicate data uniformly. However, analysis of job logs from a large production cluster show...
172
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
126
click to vote
SIGCOMM
2005
ACM
15 years 3 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
74
Voted
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...