39,350 research outputs found
Parallel and distributed Gr\"obner bases computation in JAS
This paper considers parallel Gr\"obner bases algorithms on distributed
memory parallel computers with multi-core compute nodes. We summarize three
different Gr\"obner bases implementations: shared memory parallel, pure
distributed memory parallel and distributed memory combined with shared memory
parallelism. The last algorithm, called distributed hybrid, uses only one
control communication channel between the master node and the worker nodes and
keeps polynomials in shared memory on a node. The polynomials are transported
asynchronous to the control-flow of the algorithm in a separate distributed
data structure. The implementation is generic and works for all implemented
(exact) fields. We present new performance measurements and discuss the
performance of the algorithms.Comment: 14 pages, 8 tables, 13 figure
Optimization flow control -- I: Basic algorithm and convergence
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property
Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition
In this paper we consider a novel partitioned framework for distributed
optimization in peer-to-peer networks. In several important applications the
agents of a network have to solve an optimization problem with two key
features: (i) the dimension of the decision variable depends on the network
size, and (ii) cost function and constraints have a sparsity structure related
to the communication graph. For this class of problems a straightforward
application of existing consensus methods would show two inefficiencies: poor
scalability and redundancy of shared information. We propose an asynchronous
distributed algorithm, based on dual decomposition and coordinate methods, to
solve partitioned optimization problems. We show that, by exploiting the
problem structure, the solution can be partitioned among the nodes, so that
each node just stores a local copy of a portion of the decision variable
(rather than a copy of the entire decision vector) and solves a small-scale
local problem
AC OPF in Radial Distribution Networks - Parts I,II
The optimal power-flow problem (OPF) has played a key role in the planning
and operation of power systems. Due to the non-linear nature of the AC
power-flow equations, the OPF problem is known to be non-convex, therefore hard
to solve. Most proposed methods for solving the OPF rely on approximations that
render the problem convex, but that may yield inexact solutions. Recently,
Farivar and Low proposed a method that is claimed to be exact for radial
distribution systems, despite no apparent approximations. In our work, we show
that it is, in fact, not exact. On one hand, there is a misinterpretation of
the physical network model related to the ampacity constraint of the lines'
current flows. On the other hand, the proof of the exactness of the proposed
relaxation requires unrealistic assumptions related to the unboundedness of
specific control variables. We also show that the extension of this approach to
account for exact line models might provide physically infeasible solutions.
Recently, several contributions have proposed OPF algorithms that rely on the
use of the alternating-direction method of multipliers (ADMM). However, as we
show in this work, there are cases for which the ADMM-based solution of the
non-relaxed OPF problem fails to converge. To overcome the aforementioned
limitations, we propose an algorithm for the solution of a non-approximated,
non-convex OPF problem in radial distribution systems that is based on the
method of multipliers, and on a primal decomposition of the OPF. This work is
divided in two parts. In Part I, we specifically discuss the limitations of BFM
and ADMM to solve the OPF problem. In Part II, we provide a centralized version
and a distributed asynchronous version of the proposed OPF algorithm and we
evaluate its performances using both small-scale electrical networks, as well
as a modified IEEE 13-node test feeder
- …