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

IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

作者： Vinvent Filou Mohamed Mosbah Mohamed Tounsi Univ. Bordeaux LaBRI

ISBN: (纸本)9781479904051

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

来源：评论

学校读者我要写书评

暂无评论

From Event-B Specifications to Programs for distributed algorithms

From Event-B Specifications to Programs for Distributed Algo...

引用

IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises

作者： Mohamed Tounsi Mohamed Mosbah Dominique Mery Univ. Bordeaux LaBRI Univ. Lorraine LORIA

ISBN: (纸本)9781479904051

Formal proofs of distributed algorithms are long, hard and tedious. We propose a general approach, based on the formal method Event-B, to automatically generate correct programs of distributed algorithms. Our approach is implemented with a translation tool, called B2Visidia, that generates Java code from an Event-B specification related to distributed algorithms. The resulting code can be run on classical distributed computing systems. To execute the induced programs, we use a tool called Visidia that can be used for experimenting, testing and visualizing programs of distributed algorithms.

关键词： Formal methods Event-B distributed algorithms Local computations Visidia distributed systems

来源：评论

学校读者我要写书评

暂无评论

Matrix-Free Nonlinear Finite-Element Solver Using Transmission-Line Modeling on GPU

引用

IEEE TRANSACTIONS ON MAGNETICS 2019年第7期55卷 1-5页

作者： Liu, Peng Li, Jiacong Dinavahi, Venkata Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2R3 Canada

The transmission-line modeling (TLM) used for nonlinear finite-element (FE) solution has a paramount feature that the admittance matrix is unchanged and only needs one-time factorization;and this feature becomes a drawback when the required number of TLM iterations increase due to the mismatch between the transmission-line impedance and the load. In this paper, a matrix-free TLM scheme is proposed to make use of the solved nonlinear reluctivities without employing any matrices at each timestep, thus substantially decreasing the number of required TLM iterations. The matrix-free solver is suitable for massively parallel processing and the design is implemented on the Tesla V100 graphics processing unit (GPU). A speedup of more than 27 times is obtained compared with a commercial FE package for different problem sizes while maintaining high accuracy.

关键词： distributed algorithms domain decomposition electromagnetic apparatus finite-element (FE) method graphics processing units (GPUs) massively parallel nonlinear system of equations transmission-line modeling (TLM)

来源：评论

学校读者我要写书评

暂无评论

Parameterized model checking of fault-tolerant distributed algorithms by abstraction

Parameterized model checking of fault-tolerant distributed a...

引用

Formal Methods in Computer Aided Design (FMCAD)

作者： Annu John Igor Konnov Ulrich Schmid Helmut Veith Josef Widder Vienna University of Technology (TU Wien)

ISBN: (纸本)9781479926848

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.

关键词： Radiation detectors Abstracts Skeleton Resilience Model checking distributed algorithms Concrete

来源：评论

学校读者我要写书评

暂无评论

distributed Online algorithms for the Agent Migration Problem in WSNs

引用

MOBILE NETWORKS & APPLICATIONS 2013年第5期18卷 622-638页

作者： Tziritas, Nikos Lalis, Spyros Khan, Samee Ullah Loukopoulos, Thanasis Xu, Cheng-Zhong Lampsas, Petros Chinese Acad Sci Beijing Peoples R China Univ Thessaly Thessaly Greece IRETETH CERTH Thessaly Greece N Dakota State Univ Fargo ND 58105 USA Technol Educ Inst Lamia Lamia Greece Wayne State Univ Detroit MI USA

The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement and migration algorithms proposed in the literature, assume that the communication rates between agents remain stable for a sufficiently long time to amortize the migration costs. Then, the problem is that frequent changes in the application-level communication may lead to several non-beneficial agent migrations, which may actually increase the total network cost, instead of decreasing it. To tackle this problem, we propose two distributed algorithms that take migration decisions in an online fashion, trying to deal with fluctuations in agent communication. The first algorithm is more of theoretical value, as it assumes infinite storage to keep information about the message exchange history of agents, while the second algorithm is a refined version that works with finite storage and limited information. We describe these algorithms in detail, and provide proofs for their competitive ratio vs. an optimal oracle. In addition, we evaluate the performance of the proposed algorithms for different parameter settings through a series of simulated experiments, also comparing their results with those achieved by an optimal static placement that is computed with full (a posteriori) knowledge of the execution scenarios. Our theoretical and experimental results are a strong indication for the robustness and effectiveness of the proposed algorithms.

关键词： distributed algorithms Online algorithms Optimizing network cost Wireless sensor and actuator networks Agent placement Agent migration Agent-based programming

来源：评论

学校读者我要写书评

暂无评论

Distal: A framework for implementing fault-tolerant distributed algorithms

Distal: A framework for implementing fault-tolerant distribu...

引用

International Conference on Dependable Systems and Networks (DSN)

作者： Martin Biely Pamela Delgado Zarko Milosevic André Schiper Ecole Polytechnique Fédérale de Lausanne Lausanne Switzerland

ISBN: (纸本)9781467364713

We introduce Distal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of non-trivial lines of Java or C++. Distal is implemented as a library in Scala and consists of two main parts: a domain specific language (DSL) in which algorithms are expressed and an efficient messaging layer that deals with low level issues such as connection management, threading and (de)serialization. The DSL is designed such that implementations of distributed algorithms highly resemble the pseudocode found in research papers. By writing code that is close to the protocol description, one can be more convinced that the implemented system really reflects the protocol specification on paper. Distal does not only make it simple and intuitive to implement distributed algorithms but it also leads to efficient implementations.

关键词： Protocols DSL distributed algorithms Fault tolerance Fault tolerant systems Algorithm design and analysis Java

来源：评论

学校读者我要写书评

暂无评论

(Q, S)-distance model and counting algorithms in dynamic distributed systems

引用

INTERNATIONAL JOURNAL OF distributed SENSOR NETWORKS 2018年第1期14卷

作者： Yang, Zhiwei Wu, Weigang Chen, Yishun Lin, Xiaola Cao, Jiannong Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Guangdong Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

With the advance in mobile network-based systems, dynamic system has become one of the hotspots in fundamental study of distributed systems. In this article, we consider the dynamic system with frequent topology changes arising from node mobility or other reasons, which is also referred to as dynamic network. With the model of dynamic network, fundamental distributed computing problems, such as information dissemination and election, can be formally studied with rigorous correctness. Our work focuses on the node counting problem in dynamic environments. We first define two new dynamicity models, named (Q, S)-distance and (Q, S)*-distance, which describe dynamic changes of information propagation time against topology changes. Based on these two models, we design three different counting algorithms which basically adopt the approach of diffusing computation. These algorithms mainly differ in communication cost due to different information collection procedures. The correctness of all the algorithms is formally proved and their performance is evaluated via both theoretical analysis and experimental simulations.

关键词： Node counting dynamic systems dynamic networks distributed algorithms system model

来源：评论

学校读者我要写书评

暂无评论

Sensor network node scheduling for preserving coverage of wireless multimedia networks

引用

IET WIRELESS SENSOR SYSTEMS 2019年第5期9卷 295-305页

作者： Osamy, Walid Khedr, Ahmed M. Salim, Ahmed Agrawal, Dharma P. Univ Benha Fac Comp & Artificial Intelligence Dept Comp Sci Banha Egypt Qassim Univ Dept Appl Sci POB 931 Buridah 51931 Saudi Arabia Univ Sharjah Coll Sci Dept Comp Sci Sharjah 27272 U Arab Emirates Zagazig Univ Fac Sci Math Dept Zagazig Egypt Univ Cincinnati Ctr Distribut & Mobile Comp EECS Dept Cincinnati OH 45221 USA

Wireless multimedia sensor networks (WMSNs) are receiving increasing consideration in the deployment of unmanned surveillance systems for applications such as monitoring battle field and security surveillance. However, ensuring high levels of coverage of the monitored area and concurrently maximising the WMSN lifetime remains a challenging issue. The authors introduce a novel distributed algorithm in this study, for scheduling multimedia sensor nodes (MSNs) activity that maximises coverage and minimises energy consumption. The proposed activity scheduling algorithm incorporates an approach that enables each MSN in WMSN to efficiently extract its cover sets to ensure that the critical points are monitored, and thereby minimise and effectively balance the network energy utilisation. They introduce a new way to select the most suitable cover set of an MSN by assigning priority for each cover set based on the correlation of visual information from the camera observations. The efficacy of the proposed approach is studied through rigorous simulations. Their simulation work and results comparison with existing approaches demonstrate that their proposed scheme exceeds current results in terms of network lifetime, capture rate and percentages of dead and active nodes.

关键词： multimedia communication distributed algorithms wireless sensor networks telecommunication scheduling telecommunication network reliability MSN network lifetime dead nodes active nodes sensor network node scheduling wireless multimedia sensor networks unmanned surveillance systems security surveillance WMSN lifetime novel distributed algorithm activity scheduling algorithm network energy utilisation energy consumption multimedia sensor node activity battle field monitoring visual information correlation camera observations

来源：评论

学校读者我要写书评

暂无评论

Stability and convergence of distributed algorithms for the OPF problem

Stability and convergence of distributed algorithms for the ...

引用

IEEE Annual Conference on Decision and Control

作者： Eoin Devane Ioannis Lestas Cambridge Centre for Analysis Centre for Mathematical Sciences University of Cambridge Wilberforce Road Cambridge CB3 OWA United Kingdom Department of Engineering University of Cambridge Trumpington Street Cambridge CB2 1PZ United Kingdom

ISBN: (纸本)9781467357159

Many modern power networks are partitioned in nature, with disjoint components of the overall network controlled by competing operators. The problem of solving the Optimal Power Flow (OPF) problem in a distributed manner is therefore of significant interest. For networks in which the high-level structure has tree topology, we analyze a dual decomposition approach to solving a recent convex relaxation of the OPF problem for the overall network in a distributed manner. Incorporating higher-order dynamics in terms of local auxiliary variables, we prove a result of guaranteed convergence to the solution set for sufficiently small values of the step size.

关键词： distributed algorithms Converge step size Power grids Tree Topology level structure Network Solution Set

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction

引用

IEEE ACCESS 2020年 8卷 207619-207634页

作者： D'Angelo, Gianlorenzo D'Emidio, Mattia Das, Shantanu Navarra, Alfredo Prencipe, Giuseppe Gran Sasso Sci Inst I-67100 Laquila Italy Univ Aquila Dept Informat Engn Comp Sci & Math I-67100 Laquila Italy Aix Marseille Univ LIS CNRS Univ Toulon F-13288 Marseille France Univ Perugia Dept Math & Comp Sci I-06123 Perugia Italy Univ Pisa Dept Comp Sci I-56126 Pisa Italy

We study models and algorithms for Programmable Matter (PM), that is matter with the ability to change its physical properties (e.g., shape or optical properties) in a programmable fashion. PM can be implemented by assembling a system of weak self-organizing computational elements, called particles, that can be programmed via distributed algorithms to collectively achieve some global task. Recent advances in the production of nanotechnologies have rendered such systems increasingly possible in practice, thus triggering research interests from many areas of computer science. The most established models for PM assume that particles: are modeled as finite state automata;are all identical, executing the same algorithm based on local observation of the surroundings;live and operate in the cells of a hexagonal grid;can move from one cell to another by repeatedly alternating between a contracted state (a particle occupies one cell) and an expanded state (a particle occupies two neighboring cells). Given these elementary features, it is rather hard to design distributed algorithms even for basic tasks and, in fact, all existing solutions to solve fundamental problems via PM have resorted to endowing PM systems with various capabilities to overcome such hardness, thus assuming quite unrealistic features. In this paper, we move toward more realistic computational models for PM. Specifically, we first introduce SILBOT, a new modeling approach that relaxes several assumptions used in previous ones. Second, we present a distributed algorithm to solve, in the SILBOT model, a foundational primitive for PM, namely Leader Election. This algorithm works in O(n) rounds for all initial configurations of n particles that are both connected (i.e. particles induce a connected graph) and compact (i.e. without holes, that is no empty cells surrounded by particles occur). As usual in asynchronous contexts, a round is intended as the time within which all particles have been activated at leas

关键词： Voting Computational modeling Compaction Task analysis Solid modeling Lattices Delays Programmable matter swarm robotics self-organizing systems leader election compaction finite automata distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：