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

A parallel distributed computing framework for Newton-Raphson load flow analysis of large interconnected power systems

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2015年第Dec.期73卷 1-6页

作者： Kumar, R. Sreerarna Chandrasekharan, E. King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia Govt Engn Coll Dept Elect Engn Trichur 680009 Kerala India

This paper proposes a simple parallel and distributed computing framework for the conventional Newton-Raphson load flow (NRLF) solution of large interconnected power systems. The proposed approach is based on message-passing distributed-memory architecture with separate workstations, and involves the piecewise analysis of power systems utilizing the network tearing procedure. The NRLF solution method, applied to each torn system at the selected buses, employs the matrix inversion lemma consisting of the factorization, forward elimination and back substitution procedures. The computational requirements of the state-of-the art parallel algorithm to obtain the correction vector involved in the back substitution procedure is reduced with the proposed approach in which the back substitution is carried out in parallel taking into account the split buses, rather than the order in which the forward elimination is performed. The investigations are carried out on the IEEE 118 bus standard test system in a Redhat Linux based 100 Mbps Ethernet LAN environment. The investigations reveal that the proposed method is significantly faster than the conventional NRLF and also the NRLF based on the state-of-the-art parallel algorithm, and thus finds potential applications for the real-time load flow solution of both regulated and deregulated power systems distributed over large geographical areas. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Load flow Parallel processing distributed computing Split buses NRLF Power systems

来源：评论

学校读者我要写书评

暂无评论

Weak models of distributed computing, with connections to modal logic

引用

distributed computing 2015年第1期28卷 31-53页

作者： Hella, Lauri Jarvisalo, Matti Kuusisto, Antti Laurinharju, Juhana Lempiainen, Tuomo Luosto, Kerkko Suomela, Jukka Virtema, Jonni Univ Tampere Sch Informat Sci FIN-33101 Tampere Finland Univ Helsinki Dept Comp Sci HIIT SF-00510 Helsinki Finland Univ Wroclaw Inst Comp Sci PL-51151 Wroclaw Poland

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering model, a node of degree d receives messages through d input ports and sends messages through d output ports, both numbered with 1, 2,..., d. In this work, VVc is the class of all graph problems that can be solved in the standard port-numbering model. We study the following subclasses of VVc: VV: Input port i and output port i are not necessarily connected to the same neighbour. MV: Input ports are not numbered;algorithms receive a multiset of messages. SV: Input ports are not numbered;algorithms receive a set of messages. VB: Output ports are not numbered;algorithms send the same message to all output ports. MB: Combination of MV and VB. SB: Combination of SV and VB. Now we have many trivial containment relations, such as SB subset of MB subset of VB subset of VV subset of VVc, but it is not obvious if, for example, either of VB subset of SV or SV subset of VB should hold. Nevertheless, it turns out that we can identify a linear order on these classes. We prove that SB (sic) MB = VB (sic) SV = MV = VV (sic) VVc. The same holds for the constant-time versions of these classes. We also show that the constant-time variants of these classes can be characterised by a corresponding modal logic. Hence the linear order identified in this work has direct implications in the study of the expressibility of modal logic. Conversely, one can use tools from modal logic to study these classes.

关键词： distributed computing Local algorithms Modal logic Models of computation

来源：评论

学校读者我要写书评

暂无评论

The Accuracy of Mathematical Models in Simulator distributed computing

引用

CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES 2015年第6期107卷 447-462页

作者： Kvasnica, I. Kvasnica, P. Reg Dept Environm Issues Trencin Hviezdoslavova 3 Trencin 91100 Slovakia Alexander Dubcek Univ Trencin Fac Def Technol Dept Informat Trencin 91150 Slovakia

The issue of simulation of decentralized mathematical models is discussed in the paper. The authors' knowledge is based on a theory of design of decentralized computer control systems. Their knowledge is gained in the process of designing mathematical models that are simulated. A decomposed control system is required to meet the conditions of observation and control. The methodology of a multi-model design is based on main principles of object orientation such as abstraction, hierarchy, and modularity. Modelling on a parallel architecture has an impact on a simulator system. The system is defined by the equations shown below. An important part is the way of analyzing the simulation method, an analytical approach, and corresponding software implementation tools.

关键词： Accuracy of integration Centralized and decentralized systems Control modules distributed computing Modelling and simulation

来源：评论

学校读者我要写书评

暂无评论

Edge-Facilitated Wireless distributed computing

Edge-Facilitated Wireless Distributed Computing

引用

IEEE Global Communications Conference

作者： Songze Li Qian Yu Mohammad Ali Maddah-Ali A. Salman Avestimehr Department of Electrical Engineering University of Southern California Los Angeles Nokia Bell Labs Holmdel

ISBN: (纸本)9781509013296

We propose a framework for edge-facilitated wireless distributed computing, in which several mobile users connected to an access point collaborate for a distributed computing task. We characterize the minimum communication load, both in uplink (from users to the access point) and downlink (from access point to the users), required for distributed computing. In particular, we develop a communication scheme and a dataset placement strategy that induces a particular overlap of computations at the users, which can then be exploited for coding at both users and the access point to significantly reduce the communication load. We demonstrate that the reduction in communication load (compared to uncoded solutions) can scale linearly with the size of the network (i.e., the number of users), hence our proposed scheme can result in a "scalable" design for edge-facilitated wireless distributed computing (i.e., accommodating any number of users without incurring extra communication load). Furthermore, we establish the optimality of the proposed scheme by developing a tight information theoretic outer-bound, and demonstrate that the proposed scheme achieves the minimum uplink and downlink communication load simultaneously. We also generalize the results to a decentralized setting, in which a random and a priori unknown subset of users may participate in distributed computing at each time, and characterize the minimum communication load for uniformly random dataset placement at users.

关键词： Consumers communication load distributed computing access points wireless up link

来源：评论

学校读者我要写书评

暂无评论

Coded computing for Multi-Cluster distributed Computations

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第2期73卷 1114-1127页

作者： Wu, Youlong Li, Chenglin Hu, Haoyang Song, Xiyu Ma, Shuai Shi, Yuanming ShanghaiTech Univ Sch Informat Sci & Technol Shanghai 201210 Peoples R China Guilin Univ Elect Technol Sch Informat & Commun Guilin 541004 Guangxi Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

distributed computing, which leverages distributed storage and computing resources, is a promising paradigm for handling large-scale computational tasks. However, its potential is often hindered by high communication latency due to limited network bandwidth. In this paper, we study the computation-communication tradeoff of multi-cluster MapReduce systems where a central server connects to multiple clusters, each comprising a set of workers that jointly perform a MapReduce task. Workers can exchange information directly within their cluster (inner-cluster communication) or indirectly through the central server (cross-cluster communication). To reduce the communication load, we propose a nested coded distributed computing (CDC) scheme that is feasible for the heterogeneous scenario where different clusters could have arbitrary numbers of workers and computation loads. It is shown that our scheme can greatly reduce communication load compared to all existing schemes, and could achieve the optimal cross-cluster communication load. In addition, the proposed scheme can significantly reduce the computational complexity of the conventional CDC schemes, whose computational complexity exponentially increases with the computation load.

关键词： Task analysis Symbols Servers Switches Encoding Downlink Uplink distributed computing coded computation communication load MapReduce

来源：评论

学校读者我要写书评

暂无评论

A Stochastic Process Approach to Model distributed computing on Complex Networks

引用

JOURNAL OF GRID computing 2015年第2期13卷 215-232页

作者： Prieto-Castrillo, Francisco Astillero, Antonio Boton-Fernandez, Maria New England Complex Syst Inst Cambridge MA 02142 USA Univ Extremadura Commun & Comp Sci Dept Caceres Spain Res Ctr Energy Environm & Technol Madrid Spain

In this work we present analytic expressions for the expected values of the performance metrics of parallel applications when the distributed computing infrastructure has a complex topology. Through active probing tests we analyse the structure of a real distributed computing environment. From the resulting network we both validate the analytic expressions and explore the performance metrics under different conditions through Monte Carlo simulations. In particular we gauge computing paradigms with different hierarchical structures in computing services. Fully decentralised (i.e., peer-to-peer) environments provide the best performance. Moreover, we show that it is possible to improve significantly the parallel efficiency by implementing more intelligent configurations of computing services and task allocation strategies (e.g., by using a betweenness centrality measure). We qualitatively reproduce results of previous works and provide closed-form solutions that link topology, application's structure and allocation parameters when job dependencies and a complex network structure are considered.

关键词： distributed computing Complex networks Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Decentralized voltage stability monitoring and control in the smart grid using distributed computing architecture

Decentralized voltage stability monitoring and control in th...

引用

Conference Record of the IEEE Industry Applications Society Annual Meeting (IAS)

作者： HyoJong Lee Shwetha Niddodi Anurag Srivastava David Bakken School of Electrical Engineering and Computer Science Washington State University Pullman WA

ISBN: (纸本)9781479983988

To manage the smart electric grid of the future, fundamental changes are required in the system operational paradigm. Availability of high-resolution data at faster speed and advanced computational advancements provide opportunities to bring this fundamental change. Monitoring and control algorithms need to be evolved to match the transition of centralized generation to distributed generation. Intermittency of renewable generation and push towards real time control requires faster control actions, which is possible with decentralized power grid applications. With integration of distributed energy resources (DERs), the stability assessment application need to handle a large number of data points in real time. This requires massive computing resources, and requirements will increase for possible real time control action. Decentralized applications need to be coordinated and manged with existing centralized applications. This paper addresses the development of a fault-tolerant distributed computing architecture (DCBlocks) for implementing a decentralized voltage stability monitoring and control application. Results for IEEE 30 bus system have been provided to validate the developed architecture. distributed computing algorithms are implemented using open source platform Akka Java and DeterLab test bed.

关键词： Lead distributed computing Monitoring Voltage control Impedance

来源：评论

学校读者我要写书评

暂无评论

Towards a General Framework for Ensuring and Reusing Proofs of Termination Detection in distributed computing

Towards a General Framework for Ensuring and Reusing Proofs ...

引用

Euromicro Conference on Parallel, distributed and Network-Based Processing

作者： Maha Boussabbeh Mohamed Tounsi Ahmed Hadj Kacem Mohamed Mosbah LaBRI Laboratory University of Bordeaux France ReDCad Laboratory University of Sfax Tunisia

distributed algorithms are designed to run on interconnected autonomous computing entities for achieving a common task: each entity executes asynchronously the same code and interacts locally with its immediate neighbours. It is widely agreed that the lack of knowledge of the global state makes termination detection one of the most important and complex problems in distributed computing. By relying on refinement, we prove that an algorithm computing a spanning tree with Local Termination Detection (each entity is able to determine only its own termination condition), can be reused and adapted in order to compute the same algorithm with Global Termination Detection (at least one entity is aware that the entire computation is achieved in the network). The main idea relies upon specifying a combination of a well known algorithm namely SSP and the spanning tree algorithm, following a top/down approach. This paper is a starting point towards a general framework for enhancing termination detection property of distributed algorithms and reusing their proofs.

关键词： Program processors distributed algorithms Computational modeling Context Concrete distributed computing Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Parallel Embedded computing With Improved-MPI in Off-Chip distributed Clusters

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2024年第11期20卷 12575-12585页

作者： Wei, Xile Wei, Hengyi Lu, Meili Zhang, Zhen Chang, Siyuan Zeng, Shunqi Wang, Fei Chen, Minghui Tianjin Univ Sch Elect & Informat Engn Tianjin 300072 Peoples R China Tianjin Univ Technol & Educ Sch Informat Technol & Engn Tianjin 300222 Peoples R China Guangzhou Power Supply Bur Guangdong Power Grid Co Guangzhou 510620 Peoples R China

distributed architecture is expected to be an effective solution for large-scale edge computing tasks in terminal devices. However, it remains a great challenge to resolve the conflict between parallel efficiency and constrained physical resources in a specific embedded structure. This article proposes a universal scalable off-chip parallel computing architecture to maximize the computing efficiency for distributed embedded computing clusters. This architecture is based on an improved Message Passing Interface (Improved-MPI). To address the limited communication speed in embedded environments, a multilevel communication mechanism is employed to alleviate the communication pressure on nodes. By flexibly allocating computing tasks, efficient utilization of every embedded cluster node is ensured, while also solving the problem of single point of failure. In addition, to overcome the challenge of limited RAM in embedded devices, the architecture utilizes the interleaved memory initialization mechanism to run larger computing tasks. Based on this architecture, a specific embedded cluster platform is constructed using the RK3399 board. Various large-scale tasks are deployed on this platform to validate the performance of the architecture. First, a large-scale randomly connected neural network is executed, which serves to verify the architecture's outstanding computational performance and communication capability. Secondly, a functional model of Small-World Spiking Neural Network is constructed, achieving real-time and efficient digital speech recognition. Finally, the implementation of Large Language Models demonstrates that the embedded clusters can achieve performance comparable to modern computers.

关键词： distributed computing embedded system large language model (LLM) message passing interface (MPI) neural networks distributed computing embedded system large language model (LLM) message passing interface (MPI) neural networks

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Equal Length Cellular Automata (ELCA) generating Linear Rules for Applications in distributed computing

引用

JOURNAL OF CELLULAR AUTOMATA 2015年第1-2期10卷 95-117页

作者： Mitra, Arnab Kundu, Anirban Chattopadhyay, Matangini Chattopadhyay, Samiran Adamas Inst Technol Kolkata 700126 India Netaji Subhash Engn Coll Kolkata 700152 India Jadavpur Univ Kolkata 700032 India Jadavpur Univ Kolkata 700098 India

Cellular Automata (CA) have been established as a dynamic mathematical modeling tool for scientific and engineering applications. Equal Length Cellular Automata (ELCA) are special classifications of CA having all generated equal length CA subspaces (cycles). Potential usages of ELCA have been reported for engineering applications [1-4]. A detailed analysis of ELCA generating linear and complemented linear rules has been presented in our work. General forms of characteristic matrix and characteristic polynomial for ELCA generation have been reported. Mathematical relationships between cell length of CA and length of generated equal length cycles using explored rules have been reported in the paper.

关键词： distributed computing Cellular Automata (CA) Equal Length Cellular Automata (ELCA) Characteristics Matrix Characteristics Polynomial ELCA Additive Rule

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：