检索结果-内蒙古大学图书馆

In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement

10th International Conference on Principles of Distributed Systems

作者： Raynal, Michel Travers, Corentin Univ Rennes 1 IRISA Campus Beaulieu F-35042 Rennes France

ISBN: (纸本)9783540499909

asynchronous failure detector-based set agreement algorithms proposed so far assume that all the processes participate in the algorithm. This means that (at least) the processes that do not crash propose a value and consequently execute the algorithm. It follows that these algorithms can block forever (preventing the correct processes from terminating) when there are correct processes that do not participate in the algorithm. This paper investigates the wait-free set agreement problem, i.e., the case where the correct participating processes have to decide a value whatever the behavior of the other processes (i.e., the processes that crash and the processes that are correct but do not participate in the algorithm). The paper presents a wait-free set agreement algorithm. This algorithm is based on a leader failure detector class that takes into account the notion of participating processes. Interestingly, this algorithm enjoys a first class property, namely, design simplicity.

关键词： asynchronous algorithm asynchronous system atomic register consensus leader oracle participating process set agreement shared object wait-free algorithm

来源：评论

学校读者我要写书评

暂无评论

Simulating Aggregation algorithms for Empirical Verification of Resilient and Adaptive Federated Learning 7

Simulating Aggregation Algorithms for Empirical Verification...

引用

7th IEEE/ACM International Conference on Big Data Computing, Applications and Technologies (BDCAT)

作者： Jin, Hongwei Yan, Ning Mortazavi, Masood Univ Illinois Chicago IL 60607 USA Futurewei Technol Inc Santa Clara CA USA

ISBN: (纸本)9780738123967

Federated learning (FL) environments are dynamic: Users are recruited to participate, may drop out of participation, may vary in their availability and speed, and may suffer bandwidth variations. As such, production environments demand a resilient and adaptive design. Insisting on synchronous FL, with potentially millions or hundreds of thousands of clients, will lead to various issues bursts in processing and communication loads, complicated procedures to handle laggards, and special protocols to manage client failures. In this paper, we focus on asynchronous, adaptive, and resilient operating environments for FL. We develop a simulation scheme and a set of associated aggregation algorithms as a method for investigating the soundness of asynchronous and adaptive system designs and operational principles. Our simulation model can capture the statistical impact of FL clients' intermittent operations. We also propose an aggregation algorithm usable when clients' participation and refresh rates vary. We suggest an approach for identifying valid and adaptive operating configurations including those that can be used to trade-off computational load and convergence speeds in FL programs.

关键词： Federated machine learning Federated system simulation asynchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

MobiBar: Barrier Coverage with Mobile Sensors

MobiBar: Barrier Coverage with Mobile Sensors

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Silvestri, Simone Sapienza Univ Rome Dept Comp Sci Rome Italy

ISBN: (纸本)9781424492688

Critical homeland security applications such as monitoring zones contaminated by chemical or biological attacks and monitoring the spread of forest fires, require the timely creation of barrier of sensors along the border to be monitored. The strict time requirements and the hazardous nature of these contexts impede manual sensor positioning. Mobile Wireless Sensor Networks have the potential to meet the desired coverage requirements, by exploiting the device locomotion capabilities. In this paper we propose MOBIBAR, a distributed and asynchronous algorithm for k-barrier coverage with mobile sensors. We formally prove that MOBIBAR terminates in a finite time and that the final deployment provides the maximum level of barrier coverage with the available sensors. We compare MOBIBAR to a recent virtual force-based approach by means of simulations, which show the superiority of our solution. Furthermore, we show the self-healing capability of MOBIBAR to quickly recover from sudden sensor faults.

关键词： Distributed algorithms MobiBar Mobile communication Monitoring Peer to peer computing Protocols Sensors Wireless sensor networks asynchronous algorithm biological attacks chemical attacks critical homeland security distributed algorithm distributed algorithms forest fires k-barrier coverage mobile sensors mobile wireless sensor networks monitoring zones sensor positioning wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Hybrid HLA Time Management algorithm Based on Both Conditional and Unconditional Information 08

A Hybrid HLA Time Management Algorithm Based on Both Conditi...

引用

22nd International Workshop on Principles of Advanced and Distributed Simulation

作者： Pan, Ke Turner, Stephen John Cai, Wentong Li, Zengxiang Nanyang Technol Univ Parallel & Distributed Comp Ctr Sch Comp Engn Singapore 639798 Singapore

ISBN: (纸本)9780769531595

The High-Level Architecture (HLA), which is the IEEE standard for distributed simulation, defines six service groups. The Time Management (TM) service group ensures a Time-Stamp-Ordered (TSO) message delivery sequence and correct time advancement of each simulation component (federate) in a HLA-based distributed simulation application (federation). To control time advancement of a federation, a distributed TM algorithm requires each regulating federate to periodically propagate its local time information to all constrained federates for their respective calculation of the Greatest Available Logical Time (GALT). The time information propagated is called conditional information or unconditional information depending on whether it can be guaranteed to be true conditionally or unconditionally. A traditional distributed TM algorithm can be either synchronous or asynchronous. In general, a synchronous algorithm utilizes conditional information while an asynchronous algorithm utilizes unconditional information. However, both synchronous and asynchronous algorithms have their own drawbacks and thus cannot be used for all federation scenarios. To resolve the drawback of each algorithm, this paper proposes a hybrid TM algorithm by combining synchronous and asynchronous algorithms. The three algorithms have been incorporated into a Run-Time Infrastructure (RTI) and experimental results show that the hybrid algorithm effectively combines the advantages of both synchronous and asynchronous algorithms. We also compare the proposed hybrid TM algorithm with the TM algorithm implemented in the Federated Simulations Development Kit (FDK), which also uses both conditional and unconditional information. The hybrid TM algorithm is more scalable than FDK's TM algorithm with respect to the total number of federates in a federation, because FDK's TM algorithm has the overhead of redundant GALT calculations.

关键词： distributed simulation high-level architecture time management synchronous algorithm asynchronous algorithm hybrid algorithm conditional information unconditional information

来源：评论

学校读者我要写书评

暂无评论

FedHe: Heterogeneous Models and Communication-Efficient Federated Learning 17

FedHe: Heterogeneous Models and Communication-Efficient Fede...

引用

17th IEEE International Conference on Mobility, Sensing and Networking (MSN)

作者： Chan, Yun Hin Ngai, Edith C. H. Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China

ISBN: (纸本)9781665406680

Federated learning (FL) is able to manage edge devices to cooperatively train a model while maintaining the training data local and private. One common assumption in FL is that all edge devices share the same machine learning model in training, for example, identical neural network architecture. However, the computation and store capability of different devices may not be the same. Moreover, reducing communication overheads can improve the training efficiency though it is still a challenging problem in FL. In this paper, we propose a novel FL method, called FedHe, inspired by knowledge distillation, which can train heterogeneous models and support asynchronous training processes with significantly reduced communication overheads. Our analysis and experimental results demonstrate that the performance of our proposed method is better than the state-of-the-art algorithms in terms of communication overheads and model accuracy.

关键词： federated learning communication efficiency heterogeneous models knowledge distillation asynchronous algorithm

来源：评论

学校读者我要写书评

暂无评论

asynchronous Distributed Principal Component Analysis Using Stochastic Approximation

Asynchronous Distributed Principal Component Analysis Using ...

引用

IEEE Annual Conference on Decision and Control

作者： Gemma Morral Pascal Bianchi Jeremie Jakubowicz Institut Telecom - CNRS/LTCI (UMR 5141) - Telecom Paristech Institut Telecom and CNRS/SAMOVAR (UMR 5157) - Telecom SudParis

ISBN: (纸本)9781467320658

In this paper we address the problem of asynchronous distributed principal component analysis. We provide several algorithms coping with different situations according to the underlying graph structure. A general enough framework allows us to analyze all these algorithms at the same time. Convergence is proved with probability 1 under suitable assumptions, and numerical experiments illustrate their good behavior.

关键词： Distributed algorithm asynchronous algorithm Principal Component Analysis Oja's algorithm Stochastic Approximation Wireless Sensor Network stochastic approximation distributed algorithms principal components analysis Wireless sensor networks asynchronous component analysis

来源：评论

学校读者我要写书评

暂无评论

Maximum Flow on Highly Dynamic Graphs

Maximum Flow on Highly Dynamic Graphs

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Luo, Juntong Sallinen, Scott Ripeanu, Matei The University of British Columbia Vancouver Canada

ISBN: (纸本)9798350324457

Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for relatively simple algorithms like PageRank, breadth-first search, and connected components. Expanding beyond this, we explore the maximum flow problem, a fundamental, yet more complex problem, in graph analytics. We propose a novel, distributed algorithm for max-flow on dynamic graphs, and implement it on top of an asynchronous vertex-centric abstraction. We show that our algorithm can process both additions and deletions of vertices and edges efficiently at scale on fast-evolving graphs, and provide a comprehensive analysis by evaluating, in addition to throughput, two criteria that are important when applied to real-world problems: result latency and solution stability. © 2023 IEEE.

关键词： asynchronous algorithm dynamic graph processing graph streaming maximum flow parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Novel Fully Distributed Robust Voltage/Var Control for High Proportion Distributed PV Networks 2

Novel Fully Distributed Robust Voltage/Var Control for High ...

引用

2nd IEEE International Power Electronics and Application Symposium, PEAS 2023

作者： Wang, Ling Bai, Hao Zhu, Yuanzhe Yao, Ruotian Du, Wanlin Li, Wei Institute of Electric Power Science Guangdong Power Grid Co. Ltd. Guangzhou China Electric Power Research Institute China Southern Power Grid Guangzhou China

ISBN: (纸本)9798350313765

Distributed robust voltage/var control (VVC) aims to regulate voltage, which adopts a more flexible control structure to effectively address voltage uncertainty when high proportion of distributed PV is connected to the distribution networks. For the distributed robust VVC, this paper proposes a novel fully distributed optimization algorithm based on the consensus alternating direction method of multipliers (ADMM). Meanwhile, acceleration strategy with restart is applied to enhance the algorithm convergence. In addition, in order to improve the efficiency of optimization, an asynchronous algorithm considering communication delay is proposed. Simulations verify the superiority of distributed algorithm with acceleration strategies, as well as the convergence and robustness of the algorithm in asynchronous form. © 2023 IEEE.

关键词： accelerated distributed algorithm asynchronous algorithm distributed PV distribution networks robust optimization voltage/var control

来源：评论

学校读者我要写书评

暂无评论

Multivariate Monotone Inclusions in Saddle Form

引用

MATHEMATICS OF OPERATIONS RESEARCH 2022年第2期47卷 1082-1109页

作者： Bui, Minh N. Combettes, Patrick L. North Carolina State Univ Dept Math Raleigh NC 27695 USA

We propose a novel approach to monotone operator splitting based on the notion of a saddle operator. Under investigation is a highly structured multivariate monotone inclusion problem involving a mix of set-valued, cocoercive, and Lipschitzian monotone operators, as well as various monotonicity-preserving operations among them. This model encompasses most formulations found in the literature. A limitation of existing primal-dual algorithms is that they operate in a product space that is too small to achieve full splitting of our problem in the sense that each operator is used individually. To circumvent this difficulty, we recast the problem as that of finding a zero of a saddle operator that acts on a bigger space. This leads to an algorithm of unprecedented flexibility, which achieves full splitting, exploits the specific attributes of each operator, is asynchronous, and requires to activate only blocks of operators at each iteration, as opposed to activating all of them. The latter feature is of critical importance in large-scale problems. The weak convergence of the main algorithm is established, aswell as the strong convergence of a variant. Various applications are discussed, and instantiations of the proposed framework in the context of variational inequalities and minimization problems are presented.

关键词： monotone inclusion monotone operator saddle form operator splitting block-iterative algorithm asynchronous algorithm strong convergence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：