While a large amount of distributed generators (DGs) were integrated into the distribution grid, the transmission grid voltage stability assessment (VSA) had not been suitable to be solved independently. A distributed...
详细信息
ISBN:
(纸本)9781538614280
While a large amount of distributed generators (DGs) were integrated into the distribution grid, the transmission grid voltage stability assessment (VSA) had not been suitable to be solved independently. A distributed voltage stability control (DVSC) method for integrated transmission and distribution (T&D) grids was proposed in this paper. The objective function aims to minimize the total control costs of the transmission and distribution grids. The boundary influence factors composed by the dual multipliers are introduced to coordinate the TN VSC sub-problem and DN VSC sub-problem. Those optimal power flow algorithms, by which provide the dual multipliers are generated, are adopted in both TN and DN VSC sub-problems. The equivalent power, the influence factors and the boundary bus voltages are exchanged between the transmission and distribution grids to realize distributed computation. Simulation results on integrated IEEE30 buses transmission and IEEE33 buses distribution system show that the proposed method is effective.
A “majority consensus” algorithm which represents a new solution to the update synchronization problem for multiple copy databases is presented. The algorithm embodies distributed control and can function effectivel...
详细信息
In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in t...
详细信息
A new dynamic task scheduling algorithm for distributed measurement and control system is proposed based on multi-agent. This algorithm adopts the receive-initiated scheduling strategy and dynamically migrates tasks a...
详细信息
A new dynamic task scheduling algorithm for distributed measurement and control system is proposed based on multi-agent. This algorithm adopts the receive-initiated scheduling strategy and dynamically migrates tasks according to the current status of load on each node. So the algorithm can promote system efficiency and attain load balancing. The task is migrated with mobile agent in order to decrease network transmission and save time effectively.
In our previous research, we studied the computational universality of gellular automata, a variant of asynchronous cellular automata that are intended to be realized by a reaction-diffusion system in a gel material. ...
详细信息
In our previous research, we studied the computational universality of gellular automata, a variant of asynchronous cellular automata that are intended to be realized by a reaction-diffusion system in a gel material. In this paper, we characterize the computational power of gellular automata as a model of distributed computations by presenting gellular automata that simulate a population protocol on an undirected graph. We also show that such gellular automata can be embedded into a lattice space if the interaction graph of the population protocol is planar. These results demonstrate the versatility of gellular automata as a model of distributed computations.
The rise of Internet-scale networks, such as web graphs and social media with hundreds of millions to billions of nodes, presents new scientific opportunities, such as overlapping community detection to discover the s...
详细信息
The rise of Internet-scale networks, such as web graphs and social media with hundreds of millions to billions of nodes, presents new scientific opportunities, such as overlapping community detection to discover the structure of the Internet, or to analyze trends in online social behavior. However, many existing probabilistic network models are difficult or impossible to deploy at these massive scales. We propose a scalable approach for modeling and inferring latent spaces in Internet-scale networks, with an eye towards overlapping community detection as a key application. By applying a succinct representation of networks as a bag of triangular motifs, developing a parsimonious statistical model, deriving an efficient stochastic variational inference algorithm, and implementing it as a distributed cluster program via the Petuum parameter server system, we demonstrate overlapping community detection on real networks with up to 100 million nodes and 1000 communities on 5 machines in under 40 hours. Compared to other state-of-the-art probabilistic network approaches, our method is several orders of magnitude faster, with competitive or improved accuracy at overlapping community detection.
ABSTRACTThe emerging trend of computing technologies and the Internet of Things (IoT) makes applications optimal and more responsive for real-time data processing. It generates an unprecedented and heterogeneous amoun...
详细信息
ABSTRACTThe emerging trend of computing technologies and the Internet of Things (IoT) makes applications optimal and more responsive for real-time data processing. It generates an unprecedented and heterogeneous amount of data. Cloud computing technologies were introduced with on-demand and highly scalable resources to address this data explosion problem. However, challenges like bandwidth limitation, high response time, latency-sensitive and real-time application resource demands have still existed, mostly solved through cloud computing. Therefore, cutting edge technologies in fog, edge, mist, and dew calculation are established to improve the utilization of network bandwidth, latency, and mobility in an efficient way. Research in fog computing is still in investigation mode, and several productive issues still need to be dig in depth based on platform, infrastructure, and application-oriented. Such key challenges include task partitioning, scheduling, and resource allocation. This presented survey aims to deliver a comprehensive analysis and gives cutting-edge technologies’ inside journey and evolution. The survey of simulation tools is also presented, which helps to understand & conclude the results of several scenarios and algorithms. Furthermore, major technology areas of fog, case studies on various applications and open issues are also presented.
Isolating computation and communication concerns into separate pure computation and pure coordination modules enhances modularity, understandability and reusability of parallel and/or distributed software. MANIFOLD is...
详细信息
This paper focuses on comparing different heterogeneous computational designs for the calculation of rainbow options prices using the Fourier-cosine series expansion (COS) method. We also propose a simple enough way t...
详细信息
This paper focuses on comparing different heterogeneous computational designs for the calculation of rainbow options prices using the Fourier-cosine series expansion (COS) method. We also propose a simple enough way to automatically decide the ratio of load balancing at runtime. A general-purpose computing on graphic processing unit implementation of the two-dimensional composite Simpson rule free of conditional statements with some degree of loop unrolling is also introduced. We will also show how to reduce the integration domain of coefficients appearing in the option pricing and by doing so achieve a substantial speed-up and improve accuracy when compared with a straightforward implementation. Copyright (C) 2014 John Wiley & Sons, Ltd.
暂无评论