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

International Conference on Control, Automation and Systems ( ICCAS)

作者： Yeong-Ung Kim Hwan-Yong Park Jun-Oh Park Hyo-Sung Ahn Yoo-Bin Bae Department of Mechanical Engineering Gwangju Institute of Science and Technology(GIST) Gwangju Korea Unmanned Aircraft System Research Division Korea Aerospace Research Institute(KARI) Daejeon Korea

ISBN: (数字)9788993215380

ISBN: (纸本)9798331517939

This paper discusses an architecture for implementing distributed algorithms in vehicular networks. In the context of vehicular networks, vehicles frequently change their positions, which leads to a constantly evolving network topology. We propose an architecture for distributed algorithms in vehicular networks using ROS2, focusing on the dynamic topology characteristic of peer-to-peer networks, which are significantly influenced by the movement and positioning of vehicles. Our approach leverages an all-to-all communication method where each message includes a timestamp, allowing only messages within a certain time frame to be utilized. This approach ensures that the communication network closely mirrors the physical network, making it adaptable to changes in network topology due to the movement of vehicles. The all-to-all communication model in the architecture ensures that any vehicle (or agent) can join or leave the network, provided it has the topic information. This capability is essential to maintaining a flexible and scalable network that allows vehicles to dynamically enter or leave the network without disrupting overall functionality.

关键词： Network topology Heuristic algorithms Focusing Topology Peer-to-peer computing Communication networks Mirrors distributed algorithms Vehicle dynamics Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

A survey on distributed deadlock and distributed algorithms to detect and resolve deadlock

A survey on distributed deadlock and distributed algorithms ...

引用

Colossal Data Analysis and Networking (CDAN)

作者： Vandana Kate Akansha Jaiswal Ambika Gehlot AITR Indore India

ISBN: (纸本)9781509006700

Operating system and distributed database system (DDS) are the most ordinary places where the chances for the occurrence of deadlock are very high. DDS is a database system which keeps the storage of multiple and logically interrelated databases on multiple computer systems connected over a large network in order to achieve optimal performance and resource sharing. In DDS a deadlock might encounter when a transaction request resource from other blocked transaction and enters into wait condition. It is more difficult to resolve deadlock in DDS as compare to resolution of deadlock in operating system because sites do not have exact knowledge of state of system. In this paper we are presenting a comparative study of various distributed algorithms such as B. M. Alom Algorithm and Edge-Chasing Algorithm for deadlock detection and resolution in DDS.

关键词： System recovery Probes Database systems distributed databases distributed algorithms Computers Image edge detection

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed covering algorithms

引用

distributed COMPUTING 2023年第1期36卷 45-55页

作者： Ben-Basat, Ran Even, Guy Kawarabayashi, Ken-ichi Schwartzman, Gregory Univ Coll London UCL London England Tel Aviv Univ Tel Aviv Israel Natl Inst Informat Chiyoda City Japan JAIST Nomi Ishikawa Japan

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank f. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded by f. The approximation factor of our algorithm is (f + epsilon). Let Delta denote the maximum degree in the hypergraph. Our algorithm runs in the congest model and requires O(log Delta/ log log Delta) rounds, for constants epsilon is an element of (0, 1] and f is an element of N+. This is the first distributed algorithm for this problem whose running time does not depend on the vertex weights nor the number of vertices. Thus adding another member to the exclusive family of provably optimal distributed algorithms. For constant values of f and e, our algorithm improves over the (f + epsilon)-approximation algorithm of Kuhn et al. (SODA, 2006)whose running time is O(log. + logW), where W is the ratio between the largest and smallest vertex weights in the graph. Our algorithm also achieves an f -approximation for the problem in O(f log n) rounds, improving over the classical result of Khuller et al. (J algorithms, 1994) that achieves a running time of O(f log(2) n). Finally, for weighted vertex cover (f = 2) our algorithm achieves a deterministic running time of O(log n), matching the randomized previously best result of Koufogiannakis and Young (Distrib Comput, 2011). We also show that integer covering-programs can be reduced to the MinimumWeight Set Cover problem in the distributed setting. This allows us to achieve an (f inverted right perpendicularlog(2)(M)+1inverted left perpendicular+ epsilon)-approximate integral solution in O ((1 + f / log n) . (log Delta/log log Delta + (f . log M)(1.01) . log epsilon(-1) . (log Delta)(0.01))) rounds, where f bounds the number of variables in a constraint, Delta bounds the number of constraints a variable appears in, and M = max {1, inverted left perpendicular1/a(min) inverted

关键词： distributed algorithms Approximation algorithms Vertex cover Set cover

来源：评论

学校读者我要写书评

暂无评论

A new verification technique for self-stabilizing distributed algorithms based on variable structure systems and Ljapunov theory

A new verification technique for self-stabilizing distribute...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： O. Theel Department of Computer Science Darmstadt University of Technology Darmstadt Germany

ISBN: (纸本)0769509819

A particularly suitable design strategy for constructing a robust distributed computer application is to endow it with a self-stabilization property. Such a property guarantees that the system will always return to and stay within a specified set of legal states within a bounded time regardless of its initial state. A self-stabilizing application therefore has the potential of recovering from the effects of arbitrary transient failures. However, to actually prove that an application self-stabilizes can be quite tedious with current verification methodologies and is non-trivial. The self-stabilizing property of distributed algorithms exhibits interesting analogies to the stabilizing feedback systems used in various engineering domains. In this paper, we show that methodologies from control theory can be used to more easily prove the self-stabilization property of distributed algorithms.

关键词： distributed algorithms Law Legal factors Feedback Algorithm design and analysis Application software Control theory Computer science Switches Variable structure systems

来源：评论

学校读者我要写书评

暂无评论

New Biology Inspired Anonymous distributed algorithms to Compute Dominating and Total Dominating Sets in Network Graphs

New Biology Inspired Anonymous Distributed Algorithms to Com...

引用

IEEE International Symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Feng Luo Pradip K Srimani School of Computing Clemson University Clemson SC USA

ISBN: (纸本)9781509036837

The selection mechanism of sensory organ precursor(SOP) from pre-neural cells of fruity fly has recently been used to develop a new computing paradigm for probabilistic (randomized) distributed algorithms for graph theoretic primitives like maximal independent set (MIS) in networks. The new paradigm is significantly different from the settings of traditional distributed algorithms: nodes are anonymous, the nodes do not need any knowledge of its neighbors, they receive binary message(s) from the neighbor(s), there is no need to decipher the message, only receipt or non-receipt of message(s) at any step of the algorithm. In this paper, we develop two new simple distributed algorithms to compute the minimal dominated set (MDS) and minimal total dominating set (MTDS) in a graph using this new paradigm. We show that the two algorithms for computing the MDS and MTDS respectively converge with probability (1 -- n½) using O(D log n) expected number of steps, where n is the number of nodes in the system and D is the maximum degree of a node. Preliminary experimental simulation results show that the algorithms converge in substantially less number of steps to converge than estimated by the analysis for a large number of graph families.

关键词： distributed algorithms Protocols Probabilistic logic Biological systems Cells (biology) Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

DAP: a generic platform for the simulation of distributed algorithms

DAP: a generic platform for the simulation of distributed al...

引用

Annual Symposium on Simulation

作者： I. Chatzigiannakis A. Kinalis A. Poulakidas G. Prasinos C. Zaroliagis Computer Technology Institute Department of Computer Engineering and Informatics University of Patras Patras Greece

DAP (distributed algorithms platform) is a generic and homogeneous simulation environment aiming at the implementation, simulation, and testing of distributed algorithms for wired and wireless networks. In this work, we present its architecture, the most important design decisions, and discuss its distinct features and functionalities. DAP allows the algorithm designer to implement a distributed protocol by creating his own customized environment, and programming in a standard programming language in a style very similar to that of a real-world application. DAP provides a graphical user interface that allows the designer to monitor and control the execution of simulations, visualize algorithms, as well as gather statistics and other information for their experimental analysis and testing.

关键词： Digital audio players distributed algorithms Algorithm design and analysis Testing Wireless networks Protocols Computer languages Graphical user interfaces Monitoring Analytical models

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed algorithms for dynamic channel assignment

Efficient distributed algorithms for dynamic channel assignm...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： M. Choy A.K. Singh Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Department of Computer Science University of California슠Santa Barbara USA

The efficiency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are verified by extensive simulations.

关键词： distributed algorithms Interference Delay effects Computer science Telephony Time measurement Bandwidth Channel allocation Waste materials Clocks

来源：评论

学校读者我要写书评

暂无评论

Simplifying Hands-On Teaching of distributed algorithms with SPLAY

Simplifying Hands-On Teaching of Distributed Algorithms with...

引用

IEEE International Symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Etienne Rivière Institut dInformatique Universita de Neuchâtel Switzerland

ISBN: (纸本)9781467309745

Teaching distributed algorithms using a learning-by-doing approach is usually associated with a slow and cumbersome learning process for students. In order to test and evaluate even simple protocols, students need to learn how to set up and operate a test bed, and to write scripts for deploying, running their program and finally retrieving some logs for parsing and observation of the results. Moreover, the amount of code required in languages such as C# or Java for implementing even a simple protocol is often one order of magnitude more than the length of the protocol pseudo-code description as discussed in class or in research papers. Nevertheless, teaching distributed algorithms and protocols using real deployed code on real conditions is highly desirable and can not always be replaced by the use of simulators. We present in this paper our experience of using SPLAY, a distributed systems evaluation framework that greatly simplifies the work of both instructors and students for hands-on learning of distributed systems. SPLAY simplifies the writing, deployment and observation of distributed algorithms and the management of test environments, narrowing the complexity gap between pseudo-code descriptions and executable implementations. In addition, SPLAY's features and the focus kept on the algorithms and their evaluation, allow students to evaluate their protocols in a variety of conditions, by controlling the experiments and their running conditions, or by allowing running them on multiple test beds at no additional costs and with minimal administration complexity.

关键词： distributed algorithms Protocols Education Complexity theory Libraries Programming Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Performance of distributed algorithms for topology control in wireless networks

Performance of distributed algorithms for topology control i...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： S. Ruhrup C. Schindelhauer K. Volbert M. Grunewald Heinz Nixdorf Institute Paderborn University Germany

We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph. We present distributed algorithms that can be used to build up these graphs in time O(log n) per node without the use of any geographical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost. We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision. Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations.

关键词： distributed algorithms Network topology Intelligent networks Wireless networks Communication system control Power control Computational modeling Mobile ad hoc networks Optical fiber communication Robots

来源：评论

学校读者我要写书评

暂无评论

Structural analysis and implementation of two distributed algorithms

Structural analysis and implementation of two distributed al...

引用

International Phoenix Conference on Computers and Communications (IPCCC)

作者： L.F. Wilson M.J. Gonzalez Institute for Computer Applications in Science and Engineering NASA-Langley Research Center Hampton VA USA Computer Engineering Research Center University of Texas Austin Austin TX USA

In earlier work, we examined the theoretical effects of synchronization and communication on execution times for different categories of algorithmic structures. The paper demonstrates how two candidate problems for distributed systems can be represented by different algorithmic structures. Specifically, we examine different representations of a partial differential equation (PDE) solver and the travelling salesman problem (TSP). Furthermore, we present results from execution of the algorithms on the Pleiades/ESP System and the Intel Paragon. Using the results from problems executed on real systems, we confirm that our theoretical framework for obtaining bounds on execution time can be used to accurately estimate the performance of a distributed algorithm.

关键词： Algorithm design and analysis distributed algorithms Concurrent computing Partitioning algorithms Computer applications NASA Master-slave Postal services Microwave integrated circuits Partial differential equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：