3,920 research outputs found
Proposed shunt rounding technique for large-scale security constrained loss minimization
The official published version can be obtained from the link below - Copyright @ 2010 IEEE.Optimal reactive power flow applications often model large numbers of discrete shunt devices as continuous variables, which are rounded to their nearest discrete value at the final iteration. This can degrade optimality. This paper presents novel methods based on probabilistic and adaptive threshold approaches that can extend existing security constrained optimal reactive power flow methods to effectively solve large-scale network problems involving discrete shunt devices. Loss reduction solutions from the proposed techniques were compared to solutions from the mixed integer nonlinear mathematical programming algorithm (MINLP) using modified IEEE standard networks up to 118 buses. The proposed techniques were also applied to practical large-scale network models of Great Britain. The results show that the proposed techniques can achieve improved loss minimization solutions when compared to the standard rounding method.This work was supported in part by the National Grid and in part by the EPSRC. Paper no. TPWRS-00653-2009
DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling
The dynamic provisioning of virtualized resources offered by cloud computing
infrastructures allows applications deployed in a cloud environment to
automatically increase and decrease the amount of used resources. This
capability is called auto-scaling and its main purpose is to automatically
adjust the scale of the system that is running the application to satisfy the
varying workload with minimum resource utilization. The need for auto-scaling
is particularly important during workload peaks, in which applications may need
to scale up to extremely large-scale systems.
Both the research community and the main cloud providers have already
developed auto-scaling solutions. However, most research solutions are
centralized and not suitable for managing large-scale systems, moreover cloud
providers' solutions are bound to the limitations of a specific provider in
terms of resource prices, availability, reliability, and connectivity.
In this paper we propose DEPAS, a decentralized probabilistic auto-scaling
algorithm integrated into a P2P architecture that is cloud provider
independent, thus allowing the auto-scaling of services over multiple cloud
infrastructures at the same time. Our simulations, which are based on real
service traces, show that our approach is capable of: (i) keeping the overall
utilization of all the instantiated cloud resources in a target range, (ii)
maintaining service response times close to the ones obtained using optimal
centralized auto-scaling approaches.Comment: Submitted to Springer Computin
BriskStream: Scaling Data Stream Processing on Shared-Memory Multicore Architectures
We introduce BriskStream, an in-memory data stream processing system (DSPSs)
specifically designed for modern shared-memory multicore architectures.
BriskStream's key contribution is an execution plan optimization paradigm,
namely RLAS, which takes relative-location (i.e., NUMA distance) of each pair
of producer-consumer operators into consideration. We propose a branch and
bound based approach with three heuristics to resolve the resulting nontrivial
optimization problem. The experimental evaluations demonstrate that BriskStream
yields much higher throughput and better scalability than existing DSPSs on
multi-core architectures when processing different types of workloads.Comment: To appear in SIGMOD'1
- …