Concurrent Distributed Serving with Mobile Servers
This paper introduces a new resource allocation problem in distributed computing called distributed serving with mobile servers (DSMS). In DSMS, there are k identical mobile servers residing at the processors of a network. At arbitrary points of time, any subset of processors can invoke one or more requests. To serve a request, one of the servers must move to the processor that invoked the request. Resource allocation is performed in a distributed manner since only the processor that invoked the request initially knows about it. All processors cooperate by passing messages to achieve correct resource allocation. They do this with the goal to minimize the communication cost.
Routing servers in large-scale distributed systems requires a scalable location service. We introduce the distributed protocol Gnn that solves the DSMS problem on overlay trees. We prove that Gnn is starvation-free and correctly integrates locating the servers and synchronizing the concurrent access to servers despite asynchrony, even when the requests are invoked over time. Further, we analyze Gnn for "one-shot" executions, i.e., all requests are invoked simultaneously. We prove that when running Gnn on top of a special family of tree topologies - known as hierarchically well-separated trees (HSTs) - we obtain a randomized distributed protocol with an expected competitive ratio of O(log n) on general network topologies with n processors. From a technical point of view, our main result is that Gnn optimally solves the DSMS problem on HSTs for one-shot executions, even if communication is asynchronous. Further, we present a lower bound of Omega(max {k, log n/log log n}) on the competitive ratio for DSMS. The lower bound even holds when communication is synchronous and requests are invoked sequentially.
Distributed online resource allocation
Distributed directory
Asynchronous communication
Amortized analysis
Tree embeddings
Theory of computation~Online algorithms
Theory of computation~Distributed algorithms
Theory of computation~Graph algorithms analysis
Theory of computation~Discrete optimization
53:1-53:18
Regular Paper
This work is supported by the Deutsche Forschungsgemeinschaft (DFG), under grant DFG TU 221/6-3.
A full version of this paper is available at https://arxiv.org/abs/1902.07354 [Ghodselahi et al., 2019].
Abdolhamid
Ghodselahi
Abdolhamid Ghodselahi
Institute of Telematics, Hamburg University of Technology, Germany
Fabian
Kuhn
Fabian Kuhn
Department of Computer Science, University of Freiburg, Germany
Volker
Turau
Volker Turau
Institute of Telematics, Hamburg University of Technology, Germany
10.4230/LIPIcs.ISAAC.2019.53
N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In FOCS, 1992.
H. Attiya, V. Gramoli, and A. Milani. A provably starvation-free distributed directory protocol. In SSS, 2010.
B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 1995.
Y. Azar, A. Ganesh, R. Ge, and D. Panigrahi. Online Service with Delay. In STOC, 2017.
N. Bansal, N. Buchbinder, A. Madry, and J. S. Naor. A Polylogarithmic-Competitive Algorithm for the k-Server Problem. In FOCS, 2011.
Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In FOCS, 1996.
Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In STOC, 1992.
Y. Bartal and A. Rosen. The distributed k-server problem-a competitive distributed translator for k-server algorithms. In FOCS, 1992.
M. Bienkowski, A. Kraska, and P. Schmidt. Online Service with Delay on a Line. In SIROCCO, 2018.
M. J. Demmer and M. Herlihy. The arrow distributed directory protocol. In DISC, 1998.
J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In STOC, 2003.
M. Ghaffari and C. Lenzen. Near-optimal distributed tree embedding. In DISC, 2014.
A. Ghodselahi and F. Kuhn. Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks. In DISC, 2017.
Abdolhamid Ghodselahi, Fabian Kuhn, and Volker Turau. Concurrent Distributed Serving with Mobile Servers. arXiv, 2019. URL: http://arxiv.org/abs/1902.07354.
http://arxiv.org/abs/1902.07354
M. Herlihy, F. Kuhn, S. Tirthapura, and R. Wattenhofer. Dynamic analysis of the arrow distributed protocol. Theoretical Computer Science, 2006.
M. Herlihy, S. Tirthapura, and R. Wattenhofer. Competitive concurrent distributed queuing. In PODC, 2001.
P. Khanchandani and R. Wattenhofer. The Arvy Distributed Directory Protocol. In SPAA, 2019.
M. Manasse, L. McGeoch, and D. Sleator. Competitive algorithms for on-line problems. In STOC, 1988.
M. Naimi and M. Trehel. An Improvement of the log n Distributed Algorithm for Mutual Exclusion. In ICDCS, 1987.
D. Peleg. Distributed computing: a locality-sensitive approach. SIAM, 2000.
K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 1989.
J. L. van de Snepscheut. Fair mutual exclusion on a graph of processes. Distributed Computing, 1987.
J. Welch and J. Walter. Link reversal algorithms. Synthesis Lectures on Distributed Computing Theory, 2011.
B. Zhang and B. Ravindran. Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory. In IPDPS, 2010.
Abdolhamid Ghodselahi, Fabian Kuhn, and Volker Turau
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode