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

Proceedings of the ACM Symposium on Principles of distributed Computing

作者： Marthe Bonamy Cyril Gavoille Timothe Picavet Alexandra Wesolek LaBRI University of Bordeaux CNRS Bordeaux France LaBRI University of Bordeaux Bordeaux France Technische Universität Berlin Berlin Germany

ISBN: (纸本)9798400718854

We show that graphs excluding K2,t as a minor admit a f(t)-round 50-approximation deterministic distributed algorithm for Minimum Dominating Set. The result extends to Minimum Vertex Cover. Though fast and approximate distributed algorithms for such problems were already known for H-minor-free graphs, all of them have an approximation ratio depending on the size of H. To the best of our knowledge, this is the first example of a large non-trivial excluded minor leading to fast and constant-approximation distributed algorithms, where the ratio is independent of the size of H. A new key ingredient in the analysis of these distributed algorithms is the use of asymptotic dimension.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Mobility and Vehicle-to-Grid Coordination in Rebalancing Shared Mobility-on-Demand Systems

引用

IFAC-PapersOnLine 2023年第2期56卷 6642-6647页

作者： Teng Zeng Scott Moura Zhe Zhou Department of Civil and Environmental Engineering University of California Berkeley 94720 CA USA School of Mechatronic Engineering and Automation Shanghai University 200444 Shanghai China

Vehicle-to-Grid (V2G) technology enables plug-in electric vehicles (PEVs) to act as controllable loads and distributed energy resources for power systems. However, these resources, under the context of Mobility-on-Demand (MoD) market, have yet to be fully exploited for the grid services. This paper investigates how providing energy service from the shared PEVs affects both the power and transportation systems. We consider a shared MoD platform where PEVs can choose to provide either the V2G service or the traveling service when they are rebalanced to future high demand areas. In this market, the power and transportation system operators determine appropriate rewards to attract the PEV drivers. On the other hand, these drivers choose between energy and mobility services to maximize their aggregate benefits. In particular, we analytically model drivers’ preferences for discharging and traveling services through carefully selected utility functions. Moreover, a distributed algorithm is developed to manage the interactions between PEVs and the grid operation. We show that PEV drivers can be encouraged to achieve a desired energy and mobility pattern by optimizing their individual utility. Numerical results demonstrate that integrating energy service into the ride-sourcing market can benefit both PEV drivers and the power system.

关键词： Plug-in electric vehicle Mobility-on-demand system Electric power system Transportation system distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed FLISR algorithm for Smart Grid Self-Reconfiguration based on IEC61850 3

Distributed FLISR Algorithm for Smart Grid Self-Reconfigurat...

引用

3rd International Conference on Renewable Energy Research and Application (ICRERA)

作者： Koch-Ciobotaru, Cosmin Monadi, Mehdi Luna, Alvaro Rodriguez, Pedro Tech Univ Catalonia Res Ctr Renewable Elect Energy Syst SEER Ctr Barcelona Spain Abengoa Res Seville Spain

ISBN: (纸本)9781479937950

This paper proposes a distributed algorithm for Fault Location, Isolation, and Service Restoration (FLISR) to be implemented as part of the intelligent software for controlling the operation of each circuit breaker. The paper proposes an event driven finite-state machine design that assures the selfreconfiguration of the distribution power grid when a fault occurs on a certain section of a feeder. The benefits of such an approach are first of all the modularity, as each breaker is controlled by the same algorithm and requires data exchange only with the neighboring protection devices. Secondly, by using the event driven technique, the FLISR algorithm is perfectly suited for taking advantage of the features and benefits defined by the IEC 61850 protocol. Using GOOSE messages for transferring status information between the neighboring circuit breakers, the proposed distributed algorithms act in a collective manner for reconfiguring the distribution grid.

关键词： FLISR distributed algorithm finite-state machine IEC 61850 self-reconfiguration Smart Grid

来源：评论

学校读者我要写书评

暂无评论

IoVT-based efficient solution for optimal active smart camera selection in a tracking mission

引用

INTERNET OF THINGS 2023年 24卷

作者： Benrazek, Ala Eddine Farou, Brahim Kouahla, Zineddine Ferrag, Mohamed Amine Seridi, Hamid Ziane Achour Univ Dept Comp Sci Djelfa 17000 Algeria 8 mai 1945 Univ Dept Comp Sci Guelma 24000 Algeria 8 Mai 1945 Univ Labst Lab Guelma 24000 Algeria Technol Innovat Inst Abu Dhabi U Arab Emirates Ziane Achour Univ Dept Comp Sci Djelfa 17000 Algeria

Nowadays, to ensure people's and property's safety, cities have dozens of cameras installed on almost every corner. However, the haphazard deployment of these cameras often results in overlapping fields of view, leading to redundant processing of the same events by multiple cameras. This situation requires more power, huge bandwidth, and more storage capacity for collecting, processing and distributing multimedia data over the network. To overcome these challenges, we propose a novel Internet of Video Things-based system that efficiently reduces the number of cameras involved in processing redundant events. The proposed system operates through a two-step process. Firstly, a leader is elected from a group of cameras based on the degree of overlap in their fields of view, serving as the coordinator. Secondly, the system intelligently selects suitable assistants from neighboring cameras to complement the leader's vision when it becomes inadequate for effective object tracking. Consequently, only the leader and its assistants remain active, while other neighboring cameras remain in an inactive state. The evaluation demonstrates that our IoVT-based solution offers an efficient approach by minimizing redundancy, optimizing resource utilization and overcoming the challenges posed by the random installation of cameras in urban environments.

关键词： Internet of Things Internet of video things Cloud-fog computing Smart camera selection Tracking missions distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters 21

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-G...

引用

30th International Symposium on High-Performance Parallel and distributed Computing (HPDC)

作者： Sao, Piyush Lu, Hao Kannan, Ramakrishnan Thakkar, Vijay Vuduc, Richard Potok, Thomas Oak Ridge Natl Lab Oak Ridge TN 37830 USA Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9781450382175

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (Apsp) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel Floyd-Warshall (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256 nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

关键词： Floyd-Warshall algorithm all-pair shortest path semi-ring algebra GPU computing distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Shape-Shifting distributed Meta-algorithm for Modular Robots 12

A Shape-Shifting Distributed Meta-Algorithm for Modular Robo...

引用

12th IEEE International Symposium on Parallel and distributed Processing with Applications (ISPA)

作者： Mabed, Hakim Bourgeois, Julien CNRS UFC FEMTO ST UMR 6174 F-25201 Montbeliard France

ISBN: (纸本)9781479942930

Novel platforms of modular robot systems have been developed with important applications in safety, transportation and sensing domains. In such systems, modular robots are able to change their organization in order to obtain different shapes. The conception of distributed programs allowing the "optimal" reorganization of a set of robots into a specific shape appears as a very challenging problem. In this paper we present an original distributed meta-algorithm for micro-robots shape-shifting problem. We show that this meta-algorithm, described as a general functioning schema, presents a good framework to easily conceive distributed algorithms for shape-shifting problems. We also prove the facility to instantiate the algorithm for special target shapes and we give an adaptation of the algorithm to reach any horizontally convex form. The presented meta-algorithm presents two main advantages: first, there is no need to exact positioning of the robots and secondly, the memory storage and communication requirements are significantly reduced.

关键词： distributed algorithm self-configuration modular micro-robots shape-shifting

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement 21

Brief Announcement: On the Message Complexity of Fault-Toler...

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata India

ISBN: (纸本)9781450385480

This paper investigates on the message complexity of the two fundamental problems, namely, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized algorithms for both the problems and also develop non-trivial lower bounds on the message complexity. In the so-called implicit version of the two problems, our algorithms achieve sublinear message complexity while tolerating more than a constant fraction of faulty nodes. The algorithms work in anonymous networks, where nodes do not know each other. Specifically, our main results are: (1) A randomized leader election algorithm which elects a leader with high probability in a complete network with n nodes, in which at least [alpha n] nodes are non-faulty and the remaining can be faulty, where alpha >= (log(2) n)In. The time complexity of the algorithm is O(log n/alpha) rounds and message complexity is O((n(0.5) log(2.5) n)/alpha(2.5)) with high probability (i.e., with probability >= 1 - 1/n). A non-trivial lower bound of Omega (n(0.)(5)/alpha(1.5)) messages for any leader election algorithm that tolerates at most (1- alpha)-fraction faulty nodes and succeeds with high probability. (2) A randomized algorithm, tolerating at most left perpendicular(1 - alpha)nright perpendicular faulty nodes, solves agreement in O (log n/alpha) rounds and with high probability uses only O ((n(0.5) log(1.5)n)/alpha(1.)(5)) messages. A match- ing lower bound (up to a polylog n factor) of Omega(n(0.)(5)/alpha(1.5)) messages for any agreement algorithm that tolerates at most (1-alpha)-fraction faulty nodes and succeeds with high probability. A full version of the paper is available at [17].

关键词： distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

Efficient and Systematic Partitioning of Large and Deep Neural Networks for Parallelization 27th

Efficient and Systematic Partitioning of Large and Deep Neur...

引用

27th International European Conference on Parallel and distributed Computing (Euro-Par)

作者： Wang, Haoran Li, Chong Tachon, Thibaut Wang, Hongxing Yang, Sheng Limet, Sebastien Robert, Sophie Huawei Technol Paris France Univ Orleans Orleans France

ISBN: (纸本)9783030856656;9783030856649

Deep neural networks (DNNs) are playing an increasingly important role in our daily life. Since the size of DNNs is continuously growing up, it is highly important to train them effectively by distributing computation on multiple connected devices. The efficiency of training depends on the quality of chosen parallelization strategy. Being able to find a good parallelization strategy for a DNN in a reasonable amount of time is not trivial. Previous research demonstrated the possibility to systematically generate good parallelization strategies. However, systematic partitioning still suffers from either a heavy preprocessing or poor quality of parallelization. In this paper, we take a purely symbolic analysis approach by leveraging the features of DNNs like dense tensor balanced computation. We propose the Flex-Edge Recursive Graph and the Double Recursive algorithm, successfully limiting our parallelization strategy generation to a linear complexity with a good quality of parallelization strategy. The experiments show that our solution significantly reduces the parallelization strategy generation time from hours to seconds while maintaining the parallelization quality.

关键词： distributed algorithm distributed machine learning Neural network partitioning

来源：评论

学校读者我要写书评

暂无评论

distributed Transmit Power Control for Energy-Efficient Wireless-Powered Secure Communications

引用

SENSORS 2021年第17期21卷 5861页

作者： Lee, Kisong Dongguk Univ Dept Informat & Commun Engn Seoul 04620 South Korea

In this study, we consider energy-efficient wireless-powered secure communications, in which N sets of transmitter, receiver, and energy harvesting (EH) nodes exist;each EH node is allowed only to harvest energy from the transmitted signals but is not to permitted to decode information. To maximize the sum secrecy energy efficiency (SEE) of the node sets while ensuring minimum EH requirement for each EH node, we propose a distributed transmit power control algorithm using a dual method, where each transmitter adjusts its transmit power iteratively until convergence without sharing information with the other node sets. Through simulations under various environments, we show that the proposed scheme surpasses conventional schemes in terms of the sum SEE and has significantly reduced computation time compared with the optimal scheme, which suggests the effectiveness and applicability of the proposed distributed method.

关键词： secure communication energy harvesting secrecy energy efficiency transmit power control distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability 9th

Leader Election in Arbitrarily Connected Networks with Proce...

引用

9th International Conference on Networked Systems (NETYS)

作者： Lopez, Carlos Rajsbaum, Sergio Raynal, Michel Vargas, Karla Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Rennes IRISA F-35042 Rennes France Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

ISBN: (纸本)9783030910143;9783030910136

A channel from a process p to a process q satisfies the ADD property if there are constants K and D, unknown to the processes, such that in any sequence of K consecutive messages sent by p to q, at least one of them is delivered to q at most D time units after it has been sent. This paper studies implementations of an eventual leader, namely, an Omega failure detector, in an arbitrarily connected network of eventual ADD channels, where processes may fail by crashing. It first presents an algorithm that assumes that processes initially know n, the total number of processes, sending messages of size O( log n). Then, it presents a second algorithm that does not assume the processes know n. Eventually the size of the messages sent by this algorithm is also O( log n). These are the first implementations of leader election in the ADD model. In this model, only eventually perfect failure detectors were considered, sending messages of size O(n log n).

关键词： ADD channel Arbitrarily connected networks distributed algorithm Eventual leader Fault-tolerance Process crash Synchrony System model Unknown membership Weak channel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：