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

3rd IFAC Workshop pn Cyber-Physical and Human Systems (CPHS)

作者： Parsegov, Sergei Kubentayeva, Samal Gryazina, Elena Gasnikov, Alexander Ibanez, Federico Skolkovo Inst Sci & Technol Moscow Russia Moscow Inst Phys & Technol Moscow Russia Russian Acad Sci AA Kharkevich Inst Informat Transmiss Problems Moscow Russia Adyghe State Univ Caucasus Math Ctr Maykop Russia

Recently, distributed algorithms for power system state estimation have attracted significant attention. Along with such advantages as decomposition, parallelization of the original problem and absence of a central computation unit, distributed state estimation may also serve for local information privacy reasons since the only information to be transferred is the boundary states of neighboring areas. In this paper, we propose some novel approaches for speeding up the ADMM-based distributed state estimation algorithms by utilizing some recent results in optimization theory. We also thoroughly analyze the theoretical and practical performance, concluding that accelerated approach outperforms the existing ones. The theoretical considerations are verified through the experiments on a scalable example. Copyright (C) 2020 The Authors.

关键词： distributed algorithms power system state estimation convex optimization ADMM accelerated ADMM

来源：评论

学校读者我要写书评

暂无评论

distributed Average Consensus under Quantized Communication via Event-Triggered Mass Splitting 21st

Distributed Average Consensus under Quantized Communication ...

引用

21st IFAC World Congress on Automatic Control - Meeting Societal Challenges

作者： Rikos, Apostolos, I Hadjicostis, Christoforos N. KTH Royal Inst Technol Div Decis & Control Syst SE-10044 Stockholm Sweden Univ Cyprus Dept Elect & Comp Engn Nicosia Cyprus

We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the agents, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze a distributed averaging algorithm which operates exclusively with quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). We characterize the properties of the proposed distributed averaging protocol and show that its execution, on any time-invariant and strongly connected digraph, will allow all agents to reach, in finite time, a common consensus value that is equal to the quantized average. We conclude with comparisons against existing quantized average consensus algorithms that illustrate the performance and potential advantages of the proposed algorithm. Copyright (C) 2020 The Authors.

关键词： Quantized average consensus event-triggered distributed algorithms quantization digraphs multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

distributed Scheduling Algorithm for Optimizing Age of Information in Wireless Networks 39

Distributed Scheduling Algorithm for Optimizing Age of Infor...

引用

39th IEEE International Performance Computing and Communications Conference (IPCCC)

作者： Yu, Dongxiao Duan, Xinpeng Li, Feng Liang, Yi Yang, Huan Yu, Jiguo Shandong Unaivers Sch Comp Sci & Technol Qingdao Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Qingdao Univ Coll Comp Sci & Technol Qingdao Peoples R China Qilu Univ Technol Sch Comp Sci & Technol Shandong Acad Sci Jinan Peoples R China Shandong Comp Sci Ctr Natl Supercomp Ctr Jinan Jinan Peoples R China

ISBN: (纸本)9781728198293

Age of Information (AoI) is an emerging concept to model information freshness from the perspective of destinations of information deliveries. Serving as a metric to characterize the data delivery timeliness, the peak age indicates the maximum value of the AoI prior to a data packet reception. In this paper, we present a distributed scheduling algorithm for peak age optimization in a wireless network where a number of sensor nodes attempt to deliver their sensed data to a data collector over a wireless channel. In particular, each sensor node accesses the channel for data delivery independently according to an adaptively tuned transmission probability. The beauty of our algorithm lies in that, even with neither centralized infrastructure nor coordinations among the sensor nodes, our algorithm asymptotically approximates the optimal solution by only a constant factor. We perform solid theoretical analysis and extensive simulations to verify the efficacy of our algorithm. To the best of our knowledge, it is the first fully distributed scheduling algorithm for AoI optimization in wireless networks.

关键词： distributed algorithms Age of Information Wireless Networks

来源：评论

学校读者我要写书评

暂无评论

Deterministic distributed Expander Decomposition and Routing with Applications in distributed Derandomization 61

Deterministic Distributed Expander Decomposition and Routing...

引用

61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Chang, Yi-Jun Saranurak, Thatchaphol ETH Inst Theoret Studies Zurich Switzerland Toyota Technol Inst Chicago Chicago IL USA

ISBN: (纸本)9781728196213

There is a recent exciting line of work in distributed graph algorithms in the CONGEST model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An (epsilon, phi)expander decomposition removes epsilon-fraction of the edges so that the remaining connected components have conductance at least phi, i.e., they are phi-expanders, and expander routing allows each vertex v in a phi-expander to very quickly exchange deg(v) messages with any other vertices, not just its local neighbors. In this paper, we give the first efficient deterministic distributed algorithms for both tools. We show that an (epsilon, phi)-expander decomposition can be deterministically computed in poly(epsilon(-1))n(o(1)) rounds for phi = poly(epsilon)n(-o(1)), and that expander routing can be performed deterministically in poly(phi(-1))n(o(1)) rounds. Both results match previous bounds of randomized algorithms by [Chang and Saranurak, PODC 2019] and [Ghaffari, Kuhn, and Su, PODC 2017] up to subpolynomial factors. Consequently, we derandomize existing distributed algorithms that exploit expanders. We show that a minimum spanning tree on n(-o(1))-expanders can be constructed deterministically in n(o(1)) rounds, and triangle detection and enumeration on general graphs can be solved deterministically in O(n(0.58)) and n(2/3+o(1)) rounds, respectively. Using similar techniques, we also give the first polylogarithmic-round randomized algorithm for constructing an (epsilon, phi)-expander decomposition in poly(epsilon(-1), log n) rounds for phi = 1/poly(epsilon(-1), log n). This algorithm is faster than the previous algorithm by [Chang and Saranurak, PODC 2019] in all regimes of parameters. The previous algorithm needs n(Omega(1)) rounds for any phi >= 1/poly log n.

关键词： distributed algorithms expander decomposition derandomization triangle enumeration

来源：评论

学校读者我要写书评

暂无评论

Automating the Design of Efficient distributed Behaviours for a Swarm of UAVs

Automating the Design of Efficient Distributed Behaviours fo...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Duflo, Gabriel Danoy, Gregoire Talbi, El-Ghazali Bouvry, Pascal Univ Luxembourg SnT Esch Sur Alzette Luxembourg Univ Luxembourg FSTM DCS Esch Sur Alzette Luxembourg Univ Lille Inria Lille CNRS CRIStAL Lille France

ISBN: (纸本)9781728125473

The usage of Unmanned Aerial Vehicles (UAVs) is gradually gaining momentum for commercial applications. The vast majority considers a single UAV, which comes with several constraints such as its range of operations or the number of sensors it can carry. Using multiple autonomous UAVs simultaneously as a swarm makes it possible to overcome these limitations. However, manually designing complex emerging behaviours like swarming is a difficult and tedious task especially for such distributed systems which performance is hardly predictable. This article therefore proposes to automate the design of UAV swarming behaviours by defining a multi-objective optimisation problem, so called Coverage of a Connected-UAV Swarm (CCUS), and designing a Q-Learning based Hyper-Heuristic (QLHH) for generating distributed CCUS heuristics. Experimental results demonstrate the capacity of QLHH to generate efficient heuristics for any instance from a given class.

关键词： hyper-heuristic Q-learning UAV swarming distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed and Fault-Tolerant Construction of Low Stretch Spanning Tree 19

Distributed and Fault-Tolerant Construction of Low Stretch S...

引用

19th International Symposium on Parallel and distributed Computing (ISPDC)

作者： Gurjar, Aishwarya Peri, Sathya Sengupta, Sinchan Indian Inst Technol Dept Comp Sci & Engn Hyderabad India

ISBN: (纸本)9781728189468

Spanning trees are widely used as a communication backbone over some given infrastructure and help network designers achieve a low-cost communication overhead. Spanning trees are generally designed, keeping in mind some optimizing metric (most general being sum of edge weights in a Minimum Spanning Tree) with respect to the underlying graph. For applications that require preserving shortest path distances between nodes of the weighted underlying graph in the abstracted spanning tree, we look to minimize a parameter known as stretch. Stretch is defined as the ratio of the distance between two nodes in the tree to its shortest path distance in the communication graph. To make spanning-tree constructions resilient to edge failures in an error-prone environment, we consider what is called the All Best Swap Edges (ABSE) problem. Since every edge in a tree is a bridge edge, a single edge failure disconnects the tree into two connected components. In the ABSE problem, for each edge e in the spanning tree, we compute a swap edge f corresponding to e, that is activated when e fails. f helps to restore the communication in the tree by connecting the disconnected components. In this paper, we give a novel distributed algorithm to efficiently construct a low average stretch spanning tree and make it robust against edge failures by finding a swap edge for every edge in the constructed tree. This is the first known deterministic distributed algorithm for constructing a low stretch tree that is also edge fault-tolerant. The distributed ABSE computation in our case equals the state-of-the-art running time of O( h) rounds, where h is the height of the tree.

关键词： Spanning tree Stretch Swap edges distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing

引用

PROCEEDINGS OF THE IEEE 2020年第8期108卷 1219-1234页

作者： Dutta, Sanghamitra Jeong, Haewon Yang, Yaoqing Cadambe, Viveck Low, Tze Meng Grover, Pulkit Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Univ Calif Berkeley UC Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Penn State Univ Dept Elect Engn State Coll PA 16801 USA

Computing systems are evolving rapidly. At the device level, emerging devices are beginning to compete with traditional CMOS systems. At the architecture level, novel architectures are successfully avoiding the communication bottleneck that is a central feature, and a central limitation, of the von Neumann architecture. Furthermore, such systems are increasingly plagued by unreliability. This unreliability arises at device or gate-level in emerging devices, and can percolate up to processor or system-level if left unchecked. The goal of this article is to survey recent advances in reliable computing using unreliable elements, with an eye on nonsilicon and non-von Neumann architectures. We first observe that instead of aiming for generic computing problems, the community could use "dwarfs of modern computing," first noted in the high-performance computing (HPC) community, as a starting point. These computing problems are the basic building blocks of almost all scientific computing, machine learning, and data analytics today. Next, we survey the state of the art in "coded computing," which is an emerging area that advances on classical algorithm-based fault-tolerance (ABFT) and brings a fundamental information-theoretic perspective. By weaving error-correcting codes into a computing algorithm, coded computing provides dramatic improvements on solutions, as well as obtains novel fundamental limits, for problems that have been open for more than 30 years. We introduce existing and novel coded computing techniques in the context of "coded dwarfs," where a specific dwarf's computation is made resilient by applying coding. We discuss how, for the same redundancy, "coded dwarfs" are significantly more resilient compared to classical techniques such as replication. Furthermore, by examining a widely popular computation task-training large neural networks-we demonstrate how coded dwarfs can be applied to address this fundamentally nonlinear problem. Finally, we discuss practi

关键词： Computer architecture Engines Reliability Encoding Machine learning Fault tolerant systems Error correction codes Computer errors distributed algorithms distributed computing distributed processing error correction error correction codes fault tolerance fault tolerant systems high performance computing (HPC) large-scale systems parallel architectures parallel machines parallel processing supercomputers

来源：评论

学校读者我要写书评

暂无评论

A Resource Usage Efficient distributed Allocation Algorithm for 5G Service Function Chains 20th

A Resource Usage Efficient Distributed Allocation Algorithm ...

引用

20th IFIP WG 6.1 International Conference on distributed Applications and Interoperable Systems (DAIS) Held as Part of the 15th International Federated Conference on distributed Computing Techniques (DisCoTec)

作者： Fraysse, Guillaume Lejeune, Jonathan Sopena, Julien Sens, Pierre Orange Paris France Sorbonne Univ LIP6 INRIA CNRS F-75005 Paris France

ISBN: (纸本)9783030503222;9783030503239

Recent evolution of networks introduce new challenges for the allocation of resources. Slicing in 5G networks allows multiple users to share a common infrastructure and the chaining of Network Function (NFs) introduces constraints on the order in which NFs are allocated. We first model the allocation of resources for Chains of NFs in 5G Slices. Then we introduce a distributed mutual exclusion algorithm to address the problem of the allocation of resources. We show with selected metrics that choosing an order of allocation of the resources that differs from the order in which resources are used can give better performances. We then show experimental results where we improve the usage rate of resources by more than 20% compared to the baseline algorithm in some cases. The experiments run on our own simulator based on SimGrid.

关键词： Computer network management distributed algorithms Network slicing distributed systems k-mutex Drinking philosophers Deadlock

来源：评论

学校读者我要写书评

暂无评论

Parameterized Model Checking of Fault-tolerant distributed algorithms by Abstraction

Parameterized Model Checking of Fault-tolerant Distributed A...

引用

13th International Conference on Formal Methods in Computer-Aided Design (FMCAD)

作者： John, Annu Konnov, Igor Schmid, Ulrich Veith, Helmut Widder, Josef Vienna Univ Technol TU Wien Vienna Austria

ISBN: (纸本)9780983567837

We introduce an automated parameterized verification method for fault-tolerant distributed algorithms (FTDA). FTDAs are parameterized by both the number of processes and the assumed maximum number of faults. At the center of our technique is a parametric interval abstraction (PIA) where the interval boundaries are arithmetic expressions over parameters. Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. We demonstrate the practical feasibility of our method by verifying safety and liveness of several fault-tolerant broadcasting algorithms, and finding counter examples in the case where there are more faults than the FTDA was designed for.

关键词： data structures distributed algorithms fault tolerant computing formal verification

来源：评论

学校读者我要写书评

暂无评论

Towards Proved distributed algorithms Through Refinement, Composition and Local Computations

Towards Proved Distributed Algorithms Through Refinement, Co...

引用

22nd IEEE International WETICE Conference (WETICE)

作者： Filou, Vinvent Mosbah, Mohamed Tounsi, Mohamed Univ Bordeaux LaBRI CNRS UMR 5800 F-33405 Talence France

ISBN: (纸本)9780769550022

The design and the proof of distributed algorithms are difficult tasks due to the lack of knowledge of the global state and the non determinism in the execution of the processes. Formal methods can guarantee that these algorithms run as designed. In this paper, we show that the proof of complex distributed algorithms can be simplified by combining already proved sub-algorithms. To do so, we use a high level encoding of distributed algorithms in form of graph relabeling systems and we propose a formal proof methodology. The proposed methodology combines refinement and decomposition techniques and relies on the correct-by-construction paradigm used by the Event-B method.

关键词： distributed algorithms Local computation systems Formal method Event-B method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：