research-article

Local-on-average distributed tasks

Authors:

Shay SolomonAuthors Info & Claims

SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

Pages 220 - 239

Published: 10 January 2016 Publication History

Abstract

A distributed task is local if its time complexity is (nearly) constant, otherwise it is global. Unfortunately, local tasks are relatively scarce, and most distributed tasks require time at least logarithmic in the network size (and often higher than that). In a dynamic setting, i.e., when the network undergoes repeated and frequent topological changes, such as vertex and edge insertions and deletions, it is desirable to be able to perform a local update procedure around the modified part of the network, rather than running a static global algorithm from scratch following each change.

This paper makes a step towards establishing the hypothesis that many (statically) non-local distributed tasks are local-on-average in the dynamic setting, namely, their amortized time complexity is O(log* n).

Towards establishing the plausibility of this hypothesis, we propose a strategy for transforming static O(polylog(n)) time algorithms into dynamic O(log* n) amortized time update procedures. We then demonstrate the usefulness of our strategy by applying it to several fundamental problems whose static time complexity is logarithmic, including forest-decomposition, edge-orientation and coloring sparse graphs, and show that their amortized time complexity in the dynamic setting is indeed O(log* n).

References

[1]

C. N. A. Cornejo, S. Gilbert. Aggregation in dynamic networks. In Proc. PODC, pages 195--204, 2012.

Digital Library

[2]

Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. FOCS, pages 358--370, 1987.

Digital Library

[3]

Y. Afek, M. Ricklin, and E. Gafni. Upper and lower bounds for routing schemes in dynamic networks. In Proc. FOCS, pages 370--375, 1989.

Digital Library

[4]

N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844--856, 1995.

Digital Library

[5]

E. Anshelevich, D. Kempe, and J. Kleinberg. Stability of load balancing algorithms in dynamic adversarial systems. In Proc. STOC, pages 399--406, 2002.

Digital Library

[6]

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. E. Saks. Adapting to asynchronous dynamic networks. In Proc. STOC, pages 557--570, 1992.

Digital Library

[7]

B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. FOCS, pages 514--522, 1990.

Digital Library

[8]

B. Awerbuch and M. Sipser. Dynamic networks fast as static networks. In FOCS, pages 206--219, 1988.

Digital Library

[9]

L. Barenboim and M. Elkin. Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition. Distributed Computing, 22(5-6):363--379, 2010.

[10]

S. Baswana, K. Sumeet, and S. Soumojit. Fully dynamic randomized algorithms for graph spanners. ACM Trans. Alg., 8(4), 2012.

Digital Library

[11]

P. Berenbrink, T. Friedetzky, and R. A. Martin: Dynamic diffusion load balancing. In Proc. ICALP, pages 1386--1398, 2005.

Digital Library

[12]

G. S. Brodal and R. Fagerberg. Dynamic representation of sparse graphs. In WADS, pages 342--351, 1999.

Digital Library

[13]

M. L. M. R. C. Gőmez-Calzado, A. Lafuente. Fault-tolerant leader election in mobile dynamic distributed systems. In Proc. PRDC, pages 78--87, 2013.

Digital Library

[14]

J. A. Cain, P. Sanders, and N. C. Wormald. The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation. In Proc. SODA, pages 469--476, 2007.

Digital Library

[15]

K. Censor-Hillel, E. Haramaty, and Z. Karnin. Optimal Dynamic Distributed MIS. In CoRR abs/1507.04330, 2015.

[16]

M. Chrobak and D. Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci., 86(2):243--266, 1991.

Digital Library

[17]

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill, Boston, 2001.

Digital Library

[18]

S. Dolev, R. Segala, and A. A. Shvartsman. Dynamic load balancing with group communication. Theor. Comput. Sci., 369(1-3):348--360, 2006.

Digital Library

[19]

Z. Dvorak and V. Tuma. A dynamic data structure for counting subgraphs in sparse graphs. In Proc. WADS, pages 304--315, 2013.

Digital Library

[20]

D. L. Eager, E. D. Lazowska, and J. Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Eng., 12:229--243, 1986.

Digital Library

[21]

D. Eisenstat, P. N. Klein, and C. Mathieu. An efficient polynomial-time approximation scheme for steiner forest in planar graphs. In Proc. SODA, pages 626--638, 2012.

Digital Library

[22]

M. Elkin. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In Proc. PODC, pages 185--194, 2007.

Digital Library

[23]

D. Eppstein. All maximal independent sets and dynamic dominance for sparse graphs. ACM Trans. Alg., 5(4), 2009.

Digital Library

[24]

J. Erickson. http://www.cs.uiuc.edu/~jeffe/teaching/datastructures/2006/problems/Bill-arboricity.pdf, 2006. Retrieved Nov. 2013.

[25]

B. Haeupler and F. Kuhn. Lower bounds on information dissemination in dynamic networks. Distributed Computing, pages 166--180, 2012.

Digital Library

[26]

T. P. Hayes, J. Saia and Amitabh Trehan. The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 25.4:261--278, 2012.

[27]

M. He, G. Tang, and N. Zeh. Orienting dynamic graphs, with applications to maximal matchings and adjacency queries. In ISAAC, pages 128--140, 2014.

[28]

M. Henzinger, S. Krinninger and D. Nanongkai. Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. In Proc. ICALP, pages 607--619, 2013.

Digital Library

[29]

R. Ingram, P. Shields, J. E. Walter, and J. L. Welch An asynchronous leader election algorithm for dynamic networks. In Proc. IPDPS, pages 1--12, 2009.

Digital Library

[30]

T. Kopelowitz, R. Krauthgamer, E. Porat, and S. Solomon. Orienting fully dynamic graphs with worst-case time bounds. In Proc. ICALP, pages 532--543, 2014.

[31]

A. Korman. General compact labeling schemes for dynamic trees. Distr. Comput., 20(3):179--193, 2007.

[32]

A. Korman. Improved compact routing schemes for dynamic trees. In Proc. PODC, pages 185--194, 2008.

Digital Library

[33]

A. Korman and D. Peleg. Labeling schemes for weighted dynamic trees. In Proc. ICALP, pages 369--383, 2003.

Digital Library

[34]

A. Korman and D. Peleg. Compact separator decompositions in dynamic trees and applications to labeling schemes. ACM Trans. Alg., pages 313--327, 2007.

[35]

A. Korman and D. Peleg. Dynamic routing schemes for graphs with low local density. ACM Trans. Alg., 4(4), 2008.

Digital Library

[36]

A. Korman, D. Peleg, and Y. Rodeh. Labeling schemes for dynamic tree networks. Theory of Computing Systems, 37(1):49--75, 2004.

[37]

L. Kowalik. Adjacency queries in dynamic sparse graphs. Inf. Process. Lett., 102(5):191--195, 2007.

Digital Library

[38]

L. Kowalik and M. Kurowski. Oracles for bounded-length shortest paths in planar graphs. ACM Trans. Alg., 2(3):335--363, 2006.

Digital Library

[39]

F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. STOC, pages 513--522, 2010.

Digital Library

[40]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. Local computation: Lower and upper bounds. CoRR, abs/1011.5470, 2010.

[41]

N. Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193--201, 1992.

Digital Library

[42]

O. Michail, I. Chatzigiannakis, and P. G. Spirakis. Naming and counting in anonymous unknown dynamic networks. In Proc. SSS, pages 281--295, 2013.

Digital Library

[43]

M. Mitzenmacher. On the analysis of randomized load balancing schemes. Theory of Computing Systems, 32(3):361--386, 1999.

[44]

S. Muthukrishnan and R. Rajaraman. An adversarial model for distributed dynamic load balancing. In Proc. SPAA, 1998.

Digital Library

[45]

M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259--1277, 1995.

Digital Library

[46]

C. Nash-Williams. Decomposition of finite graphs into forests. J. London Math. Soc., 39(1):12, 1964.

[47]

O. Neiman and S. Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In Proc. STOC, pages 745--754, 2013.

Digital Library

[48]

D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.

Digital Library

[49]

D. Peleg and E. Upfal. The token distribution problem. SIAM J. computing, 18(2):229--243, 1989.

Digital Library

[50]

G. Pandurangan and A. Trehan. Xheal: Localized Self-healing using expanders. In Proc. PODC, pages 301--310, 2011.

Digital Library

[51]

G. Pandurangan, P. Robinson and A. Trehan. DEX: Self-Healing Expanders. In Proc. IPDPS, pages 702--711, 2014.

Digital Library

Cited By

Censor-Hillel KKolobov VSchwartzman GAgrawal KAzar Y(2021)Finding Subgraphs in Highly Dynamic NetworksProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461788(140-150)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461788
Barenboim LTzur YHansdah RKrishnaswamy DVaidya N(2019)Distributed symmetry-breaking with improved vertex-averaged complexityProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288601(31-40)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288601
Barenboim LTzur YScheideler CFineman J(2018)Brief AnnouncementProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210660(223-226)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210660
Show More Cited By

Local-on-average distributed tasks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation

Recommendations

On the Use of Randomness in Local Distributed Graph Algorithms
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it:
- We first ask the question of how much randomness is needed to obtain efficient randomized algorithms. ...
Local Distributed Decision
FOCS '11: Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

A central theme in distributed network algorithms concerns understanding and coping with the issue of {\em locality}. Despite considerable progress, research efforts in this direction have not yet resulted in a solid basis in the form of a fundamental ...
A lower bound for the distributed Lovász local lemma
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires Omega(log log n) communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of d = ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

January 2016

2114 pages

ISBN:9781611974331

Editor:
Robert Kraughgamer
Weizmann Institute of Science, Rehovot, Israel

Sponsors

SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 10 January 2016

Check for updates

Qualifiers

Research-article

Conference

SODA '16

Sponsor:

SIGACT

SODA '16: Symposium on Discrete Algorithms

January 10 - 12, 2016

Virginia, Arlington

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
76
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Censor-Hillel KKolobov VSchwartzman GAgrawal KAzar Y(2021)Finding Subgraphs in Highly Dynamic NetworksProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461788(140-150)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461788
Barenboim LTzur YHansdah RKrishnaswamy DVaidya N(2019)Distributed symmetry-breaking with improved vertex-averaged complexityProceedings of the 20th International Conference on Distributed Computing and Networking10.1145/3288599.3288601(31-40)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1145/3288599.3288601
Barenboim LTzur YScheideler CFineman J(2018)Brief AnnouncementProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210660(223-226)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210660
Kaplan HSolomon SScheideler CFineman J(2018)Dynamic Representations of Sparse Distributed NetworksProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210397(33-42)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210397
Assadi SOnak KSchieber BSolomon SDiakonikolas IKempe DHenzinger M(2018)Fully dynamic maximal independent set with sublinear update timeProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188922(815-826)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188922

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents