Suchergebnisse - asynchronous randomized algorithms

  1. 1

    Asynchronous Approximation of a Single Component of the Solution to a Linear System von Ozdaglar, Asuman, Shah, Devavrat, Yu, Christina Lee

    ISSN: 2327-4697, 2334-329X
    Veröffentlicht: Piscataway IEEE 01.07.2020
    “… We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations <inline-formula><tex-math …”
    Volltext
    Journal Article
  2. 2

    Primal-Dual Fixed Point Algorithms Based on Adapted Metric for Distributed Optimization von Li, Huaqing, Zheng, Zuqing, Lu, Qingguo, Wang, Zheng, Gao, Lan, Wu, Guo-Cheng, Ji, Lianghao, Wang, Huiwei

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Veröffentlicht: United States IEEE 01.06.2023
    “… Furthermore, by incorporating a randomized coordinate activation mechanism, we propose a randomized asynchronous iterative distributed algorithm that allows each agent to randomly and independently …”
    Volltext
    Journal Article
  3. 3

    An Asynchronous Parallel Randomized Kaczmarz Algorithm von Liu, Ji, Wright, Stephen J, Sridhar, Srikrishna

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 07.06.2014
    Veröffentlicht in arXiv.org (07.06.2014)
    “… We describe an asynchronous parallel variant of the randomized Kaczmarz (RK) algorithm for solving the linear system \(Ax=b …”
    Volltext
    Paper
  4. 4

    Asynchronous Adaptive Task Allocation von Kentros, Sotirios, Kari, Chadi, Kiayias, Aggelos, Russell, Alexander

    ISSN: 1063-6927
    Veröffentlicht: IEEE 01.06.2015
    “… We present a randomized algorithm for asynchronous task allocation, also known as the write-all or do …”
    Volltext
    Tagungsbericht Journal Article
  5. 5

    A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm von Crain, Tyler

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 09.02.2020
    Veröffentlicht in arXiv.org (09.02.2020)
    “… This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm …”
    Volltext
    Paper
  6. 6

    Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with \(t < n/3\) and \(O(n^2)\) Messages and \(O(1)\) Round Expected Termination von Crain, Tyler

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.02.2020
    Veröffentlicht in arXiv.org (20.02.2020)
    “… This work describes two randomized, asynchronous, round based, Binary Byzantine faulty tolerant consensus algorithms based on the algorithms of [25] and [26 …”
    Volltext
    Paper
  7. 7

    On the complexity of asynchronous agreement against powerful adversaries von Lewko, Allison, Lewko, Mark

    ISSN: 0178-2770, 1432-0452
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015
    Veröffentlicht in Distributed computing (01.12.2015)
    “… We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries …”
    Volltext
    Journal Article
  8. 8

    Verification of randomized consensus algorithms under round-rigid adversaries von Bertrand, Nathalie, Konnov, Igor, Lazić, Marijana, Widder, Josef

    ISSN: 1433-2779, 1433-2787
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
    “… We extend threshold automata to model randomized consensus algorithms that perform an unbounded number of asynchronous rounds …”
    Volltext
    Journal Article
  9. 9

    Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model von Mashreghi, Ali, King, Valerie

    ISSN: 0178-2770, 1432-0452
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021
    Veröffentlicht in Distributed computing (01.08.2021)
    “… We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with o ( m …”
    Volltext
    Journal Article
  10. 10

    Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case von Albouy, Timothé, Frey, Davide, Raynal, Michel, Taïani, François

    ISSN: 0178-2770, 1432-0452
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024
    Veröffentlicht in Distributed computing (01.06.2024)
    “… This time plays a crucial role in the performance of practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms …”
    Volltext
    Journal Article
  11. 11

    DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization von Lin, Xiao, Adams, Wei Yu, Lin, Qihang, Chen, Weizhu

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 13.10.2017
    Veröffentlicht in arXiv.org (13.10.2017)
    “… In this paper, we focus on distributed optimization of large linear models with convex loss functions, and propose a family of randomized primal-dual block coordinate algorithms that are especially …”
    Volltext
    Paper
  12. 12

    IIR Filtering on Graphs With Random Node-Asynchronous Updates von Teke, Oguzhan, Vaidyanathan, Palghat P.

    ISSN: 1053-587X, 1941-0476
    Veröffentlicht: New York IEEE 2020
    Veröffentlicht in IEEE transactions on signal processing (2020)
    “… To overcome this limitation, this study proposes a node-asynchronous implementation of rational filters on arbitrary graphs …”
    Volltext
    Journal Article
  13. 13

    Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks von Franceschelli, Mauro, Giua, Alessandro, Seatzu, Carla

    ISSN: 1751-570X
    Veröffentlicht: Elsevier Ltd 01.11.2017
    Veröffentlicht in Nonlinear analysis. Hybrid systems (01.11.2017)
    “… The main contribution of this paper is a novel distributed algorithm based on asynchronous and randomized local interactions, i.e …”
    Volltext
    Journal Article
  14. 14

    The correctness proof of Ben-Or’s randomized consensus algorithm von Aguilera, Marcos K., Toueg, Sam

    ISSN: 0178-2770, 1432-0452
    Veröffentlicht: Berlin/Heidelberg Springer-Verlag 01.10.2012
    Veröffentlicht in Distributed computing (01.10.2012)
    “… In a ground-breaking paper that appeared in 1983, Ben-Or presented the first randomized algorithm to solve consensus in an asynchronous message-passing system where processes can fail by crashing …”
    Volltext
    Journal Article
  15. 15

    Distributed Primal-Dual Splitting Algorithm for Multiblock Separable Optimization Problems von Li, Huaqing, Wu, Xiangzhao, Wang, Zheng, Huang, Tingwen

    ISSN: 0018-9286, 1558-2523
    Veröffentlicht: New York IEEE 01.08.2022
    Veröffentlicht in IEEE transactions on automatic control (01.08.2022)
    “… Meanwhile, we develop the asynchronous version of the algorithm in light of the randomized block-coordinate method (A-DPDS …”
    Volltext
    Journal Article
  16. 16

    Decentralized Dual Proximal Gradient Algorithms for Non-Smooth Constrained Composite Optimization Problems von Li, Huaqing, Hu, Jinhui, Ran, Liang, Wang, Zheng, Lu, Qingguo, Du, Zhenyuan, Huang, Tingwen

    ISSN: 1045-9219, 1558-2183
    Veröffentlicht: New York IEEE 01.10.2021
    “… Decentralized dual methods play significant roles in large-scale optimization, which effectively resolve many constrained optimization problems in machine …”
    Volltext
    Journal Article
  17. 17

    Randomized consensus with regular registers von Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

    ISSN: 0020-0190, 1872-6119
    Veröffentlicht: Elsevier B.V 01.03.2022
    Veröffentlicht in Information processing letters (01.03.2022)
    “… The well-known randomized consensus algorithm by Aspnes and Herlihy (1990) for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption that the registers that it uses are atomic …”
    Volltext
    Journal Article
  18. 18

    Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks von Zeng, Yanyan, Mills, K. Alex, Gokhale, Shreyas, Mittal, Neeraj, Venkatesan, S., Chandrasekaran, R.

    ISSN: 0743-7315, 1096-0848
    Veröffentlicht: Elsevier Inc 01.05.2016
    Veröffentlicht in Journal of parallel and distributed computing (01.05.2016)
    “… An important first step when deploying a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can …”
    Volltext
    Journal Article
  19. 19

    A New Insight into Local Coin-Based Randomized Consensus von Mostefaoui, Achour, Perrin, Matthieu, Raynal, Michel

    ISSN: 2473-3105
    Veröffentlicht: IEEE 01.12.2019
    “… This paper presents a binary randomized consensus algorithm for n-process asynchronous message-passing systems in which (1) up to t …”
    Volltext
    Tagungsbericht
  20. 20

    A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization von Zhou, Yuan, Guo, Luyao, Shi, Xinli, Cao, Jinde

    ISSN: 2325-5870, 2372-2533
    Veröffentlicht: Piscataway IEEE 01.03.2025
    Veröffentlicht in IEEE transactions on control of network systems (01.03.2025)
    “… In this article, we address a composite optimization problem in a distributed network. Each agent in the network possesses a private local convex function …”
    Volltext
    Journal Article