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

4th International Workshop on Runtime and Operating Systems for Supercomputers (ROSS)

作者： Levy, Ely Barak, Amnon Shiloh, Amnon Lieber, Matthias Weinhold, Carsten Haertig, Hermann Hebrew Univ Jerusalem Dept Comp Sci IL-91905 Jerusalem Israel Tech Univ Dresden Dept Comp Sci Dresden Germany

ISBN: (纸本)9781450329507

gossip algorithms can provide online information about the availability and the state of the resources in supercomputers. These algorithms require minimal computing and storage capabilities at each node and when properly tuned, they are not expected to overload the nodes or the network that connects these nodes. These properties make gossip interesting for future exascale systems. This paper examines the overhead of a decentralized gossip algorithm on the performance of parallel MPI applications running on up to 8192 nodes of an IBM BlueGene/Q supercomputer. The applications that were used in the experiments include PTRANS and MPI-FFT from the HPCC benchmark suite as well as the coupled weather and cloud simulation model COSMO-SPECS+FD4. In most cases, no gossip overhead was observed when the gossip messages were sent at intervals of 256 ms or more. As expected, the overhead that is observed at higher rates is sensitive to the communication pattern of the application and the amount of gossip information being circulated.

关键词： Benchmarking cluster management gossip algorithm high performance computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Heliostat Control Strategy Based on gossip algorithm in Preventing Transient Thermal Flux

Adaptive Heliostat Control Strategy Based on Gossip Algorith...

引用

IEEE Green Technologies Conference (GreenTech)

作者： Lei, Chengwei Tian, Weisong Herrera, Fernando, Jr. Wang, Guodong Calif State Univ Bakersfield Dept Comp & Elect Engn Comp Sci Bakersfield CA 93311 USA Widener Univ Dept Elect Engn Chester PA 19013 USA Massachusetts Coll Liberal Arts Dept Comp Sci North Adams MA 01247 USA

ISBN: (纸本)9781728114576

The solar power tower attracts increasing attentions in recent years, as an important and high efficiency technology in renewable power generation. Heat transfer fluid is heated by focusing the concentrated solar radiation on a tower-mounted receiver, and then is used to drive the turbine, and thereafter generate electric power. One of the challenges in solar power tower operation is due to sudden thermal changes on the surface of the central receiver. To be more specific, when cloud moves towards the solar power tower plant, it will block the solar beam, and lead to severe temperature change on the central receiver. Such transient thermal flux may lead to fatigue and failure of the central receiver before expected number of thermal cycles. In this work, we propose a new control strategy, which uses wireless communication channels to spread the control signal in between the heliostats to prevent transient thermal flux. In addition, the proposed control strategy is expected to save the capital cost in the interconnecting cable that is used to control the heliostats in the field.

关键词： Solar Power Tower Transient Thermal Flux Epidemic Spreading gossip algorithm

来源：评论

学校读者我要写书评

暂无评论

A gossip algorithm based Clock Synchronization Scheme for Smart Grid Applications

A Gossip Algorithm based Clock Synchronization Scheme for Sm...

引用

North American Power Symposium (NAPS)

作者： Parvez, Imtiaz Sarwat, Arif I. Pinto, Jonathan Parvez, Zakaria Khandaker, Mohammad Aqib Florida Int Univ Dept Elect & Comp Engn Miami FL 33174 USA Elect Generat Co Bangladesh Dhaka Bangladesh Independent Univ Dept Elect & Elect Engn Dhaka Bangladesh

ISBN: (纸本)9781538626993

The uprising interest in multi-agent based networked system, and the numerous number of applications in the distributed control of the smart grid leads us to address the problem of time synchronization in the smart grid. Utility companies look for new packet based time synchronization solutions with Global Positioning System (GPS) level accuracies beyond traditional packet methods such as Network Time Protocol (NTP). However GPS based solutions have poor reception in indoor environments and dense urban canyons as well as GPS antenna installation might be costly. Some smart grid nodes such as Phasor Measurement Units (PMUs), fault detection, Wide Area Measurement Systems (WAMS) etc., requires synchronous accuracy as low as 1 ms. On the other hand, 1 sec accuracy is acceptable in management information domain. Acknowledging this, in this study, we introduce gossip algorithm based clock synchronization method among network entities from the decision control and communication point of view. Our method synchronizes clock within dense network with a bandwidth limited environment. Our technique has been tested in different kinds of network topologies-complete, star and random geometric network and demonstrated satisfactory performance.

关键词： Clock synchronization decision control communication gossip algorithm NTP management information domain smart grid

来源：评论

学校读者我要写书评

暂无评论

Average Quantized Consensus Building by gossip algorithm using 16 Bit Quantization and Efficient Data Transfer Method

Average Quantized Consensus Building by Gossip Algorithm usi...

引用

International Conference on Intelligent Systems, Data Mining and Information Technology (ICIDIT’2014, Bangkok)

作者： Imtiaz Parvez Nattapong Chotikorn Arif Islam Sarwat the Electrical and Computer Engineering Department Florida International University Mahidol University

Average consensus building is a critical problem in wireless sensor networks specially with power and bandwidth *** work studies how 16 bit quantization compared to integer approximation of node value,can reduce the mean square error on average consensus building by gossip algorithm using digital(quantized) ***,we propose an efficient data transfer method for that the network reaches to consensus and saves significant amount of *** the same time,the speed of convergence is estimated.

关键词： gossip algorithm Quantized Consensus Quantized Communication Digital Communication Wireless Sensor Network etc

来源：评论

学校读者我要写书评

暂无评论

Convergence Time Evaluation of a gossip algorithm over Signed Graphs

Convergence Time Evaluation of a Gossip Algorithm over Signe...

引用

Asian Control Conference

作者： Nguyen Thi Hoai Linh Takayuki Wada Izumi Masubuchi Toru Asai Yasumasa Fujisaki Grad. Sch. of Inf. Sci. & Technol. Osaka Univ. Suita Japan

ISBN: (纸本)9781479978632

Convergence time is investigated for a gossip algorithm over a connected signed graph, where each edge of the graph has positive or negative sign. The algorithm is an iterative procedure. At each time, (i) two nodes directly connected with an edge are chosen randomly, (ii) they exchange their values according to the sign of the edge, and (iii) they update their values as the average of each node's value and its received value. It is shown that the values of the algorithm always converge in mean square, where a bipartite consensus or a trivial consensus is achieved. A convergence time is defined as the smallest time such that it takes for the values of the algorithm to get within a given neighborhood of the consensus value with high probability, regardless of initial state. An upper bound of the convergence time is given in terms of a characteristic value of the given graph.

关键词： gossip algorithm Signed graph Convergence rate Stopping rule

来源：评论

学校读者我要写书评

暂无评论

A thermostatically controlled loads regulation method based on hybrid communication and cloud-edge-end collaboration

引用

ENERGY REPORTS 2025年 13卷 680-695页

作者： Zhang, Liwei Hao, Peifan Zhou, Wenting Ma, Jun Li, Kai Yang, Dawei Wan, Jiao Northeast Elect Power Univ Key Lab Modern Power Syst Simulat & Control & Rene Minist Educ Jilin 132012 Peoples R China State Grid Xinjiang Elect Power Co Ltd Urumqi 830063 Peoples R China State Grid Xinjiang Informat & Commun Co Urumqi 830063 Peoples R China

The new power system necessitates enhanced transmission and processing capacity of the communication network due to the frequent two-way interaction between the power grid and thermostatically controlled loads (TCLs). However, existing load regulation methods often assume that the communication system is in an ideal state, which means that instantaneous control of large-scale TCLs can be achieved. In practice, however, communication delays and data processing energy consumption cannot be avoided. In order to reduce the overall system regulation delay and energy consumption, this paper proposes a TCLs regulation method based on hybrid communication and cloud-edge-end collaboration, which aims to support the synergistic interaction between TCL resources and the power grid. Firstly, a hybrid communication model is used at the end layer, using the gossip algorithm to aggregate information about the parameters of the regional TCLs. Then, each communication, caching and computation model in the cloud-edge-end collaboration architecture is analyzed. And the data volume offloading and computational power allocation are solved using the Hybrid Whale Grey Wolf Optimization (HWGWO) algorithm. Finally, the performance of the regulation method is analyzed and compared in terms of transmission delay and processing energy consumption using an arithmetic example. The results show that the hybrid communication model reduces the average communication link distance by 86.64% compared to the centralized communication and reduces the communication delay by 31.25% compared to the distributed communication. The proposed cloud-edge-end collaboration architecture reduces latency by 61.32%, 71.93%, and 52.80% compared with the single-layer architecture, respectively. The energy consumption meets the constraints, which can fully utilize the demand side TCLs regulation potential and is conducive to enhancing the stability of power grid regulation.

关键词： Load regulation Thermostatically controlled loads Communications framework Cloud-edge-end collaboration Data offloading gossip algorithm HWGWO algorithm

来源：评论

学校读者我要写书评

暂无评论

Bounded Confidence gossip algorithms for Opinion Formation and Data Clustering

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2019年第3期64卷 1150-1155页

作者： Linh Thi Hoai Nguyen Wada, Takayuki Masubuchi, Izumi Asai, Toru Fujisaki, Yasumasa Osaka Univ Grad Sch Informat Sci & Technol Osaka 5650871 Japan Kobe Univ Grad Sch Syst Informat Kobe Hyogo 6578501 Japan Nagoya Univ Grad Sch Engn Nagoya Aichi 4648603 Japan

This paper presents a bounded confidence gossip algorithm for describing the process of opinion formation over a communication network. Each agent in the network keeps a time-varying opinion vector (or state), which represents its opinion about a set of matters. A common confidence threshold is set for all of the agents. The states of agents in the network will be updated time by time according to an iterative procedure: At each time, 1) one agent is chosen randomly, then it chooses one of its neighbors on the communication graph to contact with;2) they exchange their states;and 3) if they have different states and the distance between their states is strictly smaller than the confidence threshold, they update their states as the average of the two. This algorithm converges almost surely to some equilibrium point such that any two adjacent agents either have the same state or have distinct states whose distance is no less than the confidence threshold. This is called the constant confidence threshold algorithm. An increasing confidence threshold algorithm, which repeats the constant confidence threshold algorithm several times with increasing confidence threshold, is also proposed. The algorithm is also convergent almost surely to some equilibrium point. Applicability of the method to clustering problems is shown through numerical examples.

关键词： Bounded confidence convergence analysis data clustering distributed computation gossip algorithm opinion dynamics

来源：评论

学校读者我要写书评

暂无评论

Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks

引用

WIRELESS NETWORKS 2024年第5期30卷 3349-3355页

作者： Wu, Shaochuan Wei, Yuming Gao, Yulong Zhang, Wenbin Harbin Inst Technol Sch Elect & Informat Engn Harbin 150001 Peoples R China

In this paper, probabilistic quantization on Unbiased Broadcast gossip algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis.

关键词： Consensus Probabilistic quantization gossip algorithm Satellite sensor networks

来源：评论

学校读者我要写书评

暂无评论

A gossip-based TDOA Distributed Localization algorithm for Wireless Sensor Networks

A Gossip-based TDOA Distributed Localization Algorithm for W...

引用

2nd International Symposium on Instrumentation and Measurement, Sensor Network and Automation (IMSNA)

作者： Cui, Wen Wu, Shaochuan Wang, Yuze Shan, Yuanxu Harbin Inst Technol Sch Elect & Informat Engn Harbin 150006 Peoples R China

ISBN: (纸本)9781479927166

Distributed localization has been established as a key problem in wireless sensor networks and many localization algorithms have been proposed in this area. In this paper, a novel distributed TDOA passive localization method based on gossip algorithms is proposed, which can obviously improve the performance of the previous algorithms. According to our numerical results, adding the gossip mechanism into the TDOA localization frame not only significantly improves the positioning accuracy, but also contributes to the situation that all the beacon nodes acquire the same coordinates of the target sensor node which we call it reaches a distributed average consensus for all the beacon nodes. This is sometimes very useful for special applications such as military precision strike and illegal radio station positioning. We compared the newly designed localization algorithms with the classical Taylor-series estimation algorithm for TDOA localization, and the numerical results are also provided to prove the effectiveness and advantage of our novel algorithm.

关键词： gossip algorithm TDOA localization wireless sensor networks Taylor-series estimation

来源：评论

学校读者我要写书评

暂无评论

A gossip-based AOA Distributed Localization algorithm for Wireless Sensor Networks

A Gossip-based AOA Distributed Localization Algorithm for Wi...

引用

3rd International Conference on Mechanical, Control, and Electronic Information (ICMCEI)

作者： Cui, Wen Wu, Shaochuan Wang, Yuze Harbin Inst Technol Sch Elect & Informat Engn Harbin 150006 Peoples R China

ISBN: (纸本)9783038351559

Position information of individual nodes is useful in implementing functions such as routing in wireless sensor networks. Distributed localization method has been widely concerned in the case of no central processor is available to handle the calculations in the networks. In this paper, we focus on distributed localization techniques based on angle of arrival information between neighboring nodes. A novel distributed cooperative localization method based on gossip algorithm is proposed, which can obviously improve the positioning performance of the previous methods.

关键词： gossip algorithm distributed localization angle of arrival wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：