Yuval Emek
ABSTRACT
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that provides an abstraction for managing the consumption of a global resource in a distributed dynamic network. We establish new bounds on the message complexity of this tool based on a surprising connection between the controller problem and the monotonic labeling problem.
- Y. Afek, B. Awerbuch, S.A. Plotkin and M. Saks. Local management of a global resource in a communication network. J. ACM, 43:1--19, 1996. Google Scholar
Digital Library
- Y. Afek and M. Ricklin. Sparser: a paradigm for running distributed algorithms. J. Algorithms, 14(2):316--328, 1993. Google ScholarDigital Library
- A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In SWAT, pages 111--121, 1990. Google ScholarDigital Library
- M.A. Bender, R. Cole, E.D. Demaine, M. Farach-Colton and J. Zito. Two simplified algorithms for maintaining order in a list. In ESA, pages 152--164, 2002. Google ScholarDigital Library
- P. F. Dietz. Maintaining Order in a Linked List. In STOC, pages 122--127, 1982. Google ScholarDigital Library
- P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for online monotonic list labeling. SIAM J. Discrete Math. 18(3):626--637, 2004. Google ScholarDigital Library
- P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In STOC, pages 365--372, 1987. Google ScholarDigital Library
- P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, pages 173--180, 1990. Google ScholarDigital Library
- A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In ICALP, pages 417--431, 1981. Google ScholarDigital Library
- A. Korman and S. Kutten. Controller and estimator for dynamic networks. In PODC, pages 175--184, 2007. Google ScholarDigital Library
- A. K. Tsakalidis. Maintaining order in a generalized linked list. Acta Inform., 21:101--112, 1984. Google ScholarDigital Library
- D. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, pages 114--121, 1982. Google ScholarDigital Library
Index Terms
- Brief announcement: new bounds for the controller problem
Recommendations
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingWe study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingWe give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our ...
Comments