Showing papers presented at "International Conference on Distributed Computing in 2012"
Proceedings Article•
01 Jan 2012TL;DR: A probabilistic algorithm is presented that requires an expected round complexity of $\mathcal{O}(n^{1/3}/(t^ {2/3]+1)$ rounds of communication, and t is the number of triangles in the graph, to solve the problem of subgraphs of diameter D in graphs of maximum degree Δ.
Abstract: Let G = (V,E) be an n-vertex graph and Md a d-vertex graph, for some constant d. Is Md a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(logn) bits. A simple deterministic algorithm that requires O(n(d−2)/d/ logn) communication rounds is presented. For the special case that Md is a triangle, we present a probabilistic algorithm that requires an expected O(n/(t + 1)) rounds of communication, where t is the number of triangles in the graph, and O(min{n log n/(t + 1), n}) with high probability. We also present deterministic algorithms that are specially suited for sparse graphs. In graphs of maximum degree ∆, we can test for arbitrary subgraphs of diameter D in O(∆/n) rounds. For triangles, we devise an algorithm featuring a round complexity of O((A log2+n/A2 n)/n), where A denotes the arboricity of G.
12 citations
Proceedings Article•
01 Jan 2012TL;DR: This paper presents the first randomized abortable mutual exclusion algorithm that achieves a sub-logarithmic expected RMR complexity and considers a standard asynchronous shared memory model with N processes, which allows atomic read, write and compare-and-swap operations.
4 citations
Proceedings Article•
01 Jan 2012
TL;DR: SplayNets as mentioned in this paper is a binary search tree based network that is self-adjusting to routing request, and it is shown that splaying algorithm has some interesting properties, e.g., it can be used to reduce the amortized routing cost.
Abstract: This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.
2 citations