Lower Bound on Network Diameter for Distributed Function Computation
Parallel and distributed computing network-systems are modeled as graphs with vertices representing compute elements and adjacency-edges capturing their uni- or bi-directional communication. Distributed function computation covers a wide spectrum of major applications, such as quantized consensus and collaborative hypothesis testing, in distributed systems. Distributed computation over a network-system proceeds in a sequence of time-steps in which vertices update and/or exchange their values based on the underlying algorithm constrained by the time-(in)variant network-topology. For finite convergence of distributed information dissemination and function computation in the model, we study lower bounds on the number of time-steps for vertices to receive (initial) vertex-values of all vertices regardless of underlying protocol or algorithmics in time-invariant networks via the notion of vertex-eccentricity in a graph-theoretic framework. We prove a lower bound on the maximum vertex-eccentricity in terms of graph-order and -size in a strongly connected directed graph, and demonstrate its optimality via an explicitly constructed family of strongly connected directed graphs.
KeywordsDistributed function computation Linear iterative schemes Information dissemination Finite convergence Vertex-eccentricity
- 8.Katz, G., Piantanida, P., Debbah, M.: Collaborative distributed hypothesis testing. Computing Research Repository, abs/1604.01292 (2016)Google Scholar
- 12.Sundaram, S.: Linear iterative strategies for information dissemination and processing in distributed systems. Ph.D. thesis, University of Illinois at Urbana-Champaign (2009)Google Scholar
- 15.Toulouse, M., Minh, B.Q.: Applicability and resilience of a linear encoding scheme for computing consensus. In: Muñoz, V.M., Wills, G., Walters, R.J., Firouzi, F., Chang, V. (eds.) Proceedings of the Third International Conference on Internet of Things, Big Data and Security, IoTBDS 2018, Funchal, Madeira, Portugal, 19–21 March 2018, pp. 173–184. SciTePress (2018)Google Scholar
- 16.Toulouse, M., Minh, B.Q., Minh, Q.T.: Invariant properties and bounds on a finite time consensus algorithm. Trans. Large-Scale Data- Knowl.-Centered Syst. 41, 32–58 (2019)Google Scholar
- 19.Xu, A.: Information-theoretic limitations of distributed information processing. Ph.D. thesis, University of Illinois at Urbana-Champaign (2016)Google Scholar