Statistical Numerical Methods for Eigenvalue Problem. Parallel Implementation

MSC subject classification: 65C05, 65U05.

Thermography-based virtual MPPT scheme for improving PV energy efficiency under partial shading conditions

This paper proposes a new thermography-based maximum power point tracking (MPPT) scheme to address photovoltaic (PV) partial shading faults. Solar power generation utilizes a large number of PV cells connected in series and in parallel in an array, and that are physically distributed across a large field. When a PV module is faulted or partial shading occurs, the PV system sees a nonuniform distribution of generated electrical power and thermal profile, and the generation of multiple maximum power points (MPPs). If left untreated, this reduces the overall power generation and severe faults may propagate, resulting in damage to the system. In this paper, a thermal camera is employed for fault detection and a new MPPT scheme is developed to alter the operating point to match an optimized MPP. Extensive data mining is conducted on the images from the thermal camera in order to locate global MPPs. Based on this, a virtual MPPT is set out to find the global MPP. This can reduce MPPT time and be used to calculate the MPP reference voltage. Finally, the proposed methodology is experimentally implemented and validated by tests on a 600-W PV array.

Host and network optimizations for performance enhancement and energy efficiency in data center networks

Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center. The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.

Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty

A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.

A green perspective on Structured parallel programming

Structured parallel programming, and in particular programming models using the algorithmic skeleton or parallel design pattern concepts, are increasingly considered to be the only viable means of supporting effective development of scalable and efficient parallel programs. Structured parallel programming models have been assessed in a number of works in the context of performance. In this paper we consider how the use of structured parallel programming models allows knowledge of the parallel patterns present to be harnessed to address both performance and energy consumption. We consider different features of structured parallel programming that may be leveraged to impact the performance/energy trade-off and we discuss a preliminary set of experiments validating our claims.

Modelling continuum mechanics phenomena using three dimensional unstructured meshes on massively parallel processors

The difficulties encountered in implementing large scale CM codes on multiprocessor systems are now fairly well understood. Despite the claims of shared memory architecture manufacturers to provide effective parallelizing compilers, these have not proved to be adequate for large or complex programs. Significant programmer effort is usually required to achieve reasonable parallel efficiencies on significant numbers of processors. The paradigm of Single Program Multi Data (SPMD) domain decomposition with message passing, where each processor runs the same code on a subdomain of the problem, communicating through exchange of messages, has for some time been demonstrated to provide the required level of efficiency, scalability, and portability across both shared and distributed memory systems, without the need to re-author the code into a new language or even to support differing message passing implementations. Extension of the methods into three dimensions has been enabled through the engineering of PHYSICA, a framework for supporting 3D, unstructured mesh and continuum mechanics modeling. In PHYSICA, six inspectors are used. Part of the challenge for automation of parallelization is being able to prove the equivalence of inspectors so that they can be merged into as few as possible.

Dynamic load balancing of distributed memory parallel computational mechanics using unstructured meshes for multi-physical modelling

As the complexity of parallel applications increase, the performance limitations resulting from computational load imbalance become dominant. Mapping the problem space to the processors in a parallel machine in a manner that balances the workload of each processors will typically reduce the run-time. In many cases the computation time required for a given calculation cannot be predetermined even at run-time and so static partition of the problem returns poor performance. For problems in which the computational load across the discretisation is dynamic and inhomogeneous, for example multi-physics problems involving fluid and solid mechanics with phase changes, the workload for a static subdomain will change over the course of a computation and cannot be estimated beforehand. For such applications the mapping of loads to process is required to change dynamically, at run-time in order to maintain reasonable efficiency. The issue of dynamic load balancing are examined in the context of PHYSICA, a three dimensional unstructured mesh multi-physics continuum mechanics computational modelling code.

Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks

Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center. The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.

Energy consumption of parallel algorithms for solving linear systems on HPC architecture

Modern High-Performance Computing HPC systems are gradually increasing in size and complexity due to the correspondent demand of larger simulations requiring more complicated tasks and higher accuracy. However, as side effects of the Dennard’s scaling approaching its ultimate power limit, the efficiency of software plays also an important role in increasing the overall performance of a computation. Tools to measure application performance in these increasingly complex environments provide insights into the intricate ways in which software and hardware interact. The monitoring of the power consumption in order to save energy is possible through processors interfaces like Intel Running Average Power Limit RAPL. Given the low level of these interfaces, they are often paired with an application-level tool like Performance Application Programming Interface PAPI. Since several problems in many heterogeneous fields can be represented as a complex linear system, an optimized and scalable linear system solver algorithm can decrease significantly the time spent to compute its resolution. One of the most widely used algorithms deployed for the resolution of large simulation is the Gaussian Elimination, which has its most popular implementation for HPC systems in the Scalable Linear Algebra PACKage ScaLAPACK library. However, another relevant algorithm, which is increasing in popularity in the academic field, is the Inhibition Method. This thesis compares the energy consumption of the Inhibition Method and Gaussian Elimination from ScaLAPACK to profile their execution during the resolution of linear systems above the HPC architecture offered by CINECA. Moreover, it also collates the energy and power values for different ranks, nodes, and sockets configurations. The monitoring tools employed to track the energy consumption of these algorithms are PAPI and RAPL, that will be integrated with the parallel execution of the algorithms managed with the Message Passing Interface MPI.

Intermittent Fasting Induces Hypothalamic Modifications Resulting In Low Feeding Efficiency, Low Body Mass And Overeating.

Intermittent fasting (IF) is an often-used intervention to decrease body mass. In male Sprague-Dawley rats, 24 hour cycles of IF result in light caloric restriction, reduced body mass gain, and significant decreases in the efficiency of energy conversion. Here, we study the metabolic effects of IF in order to uncover mechanisms involved in this lower energy conversion efficiency. After 3 weeks, IF animals displayed overeating during fed periods and lower body mass, accompanied by alterations in energy-related tissue mass. The lower efficiency of energy use was not due to uncoupling of muscle mitochondria. Enhanced lipid oxidation was observed during fasting days, whereas fed days were accompanied by higher metabolic rates. Furthermore, an increased expression of orexigenic neurotransmitters AGRP and NPY in the hypothalamus of IF animals was found, even on feeding days, which could explain the overeating pattern. Together, these effects provide a mechanistic explanation for the lower efficiency of energy conversion observed. Overall, we find that IF promotes changes in hypothalamic function that explain differences in body mass and caloric intake.

Obesogenic Environment By Excess Of Dietary Fats In Different Phases Of Development Reduces Spermatic Efficiency Of Wistar Rats At Adulthood: Correlations With Metabolic Status.

This study compares the impact of obesogenic environment (OE) in six different periods of development on sperm parameters and the testicular structure of adult rats and their correlations with sex steroid and metabolic scenario. Wistar rats were exposed to OE during gestation (O1), during gestation/lactation (O2), from weaning to adulthood (O3), from lactation to adulthood (O4), from gestation to sexual maturity (O5), and after sexual maturation (O6). OE was induced by a 20% fat diet, and control groups were fed a balanced diet (4% fat). Serum leptin levels and adiposity index indicate that all groups were obese, except for O1. Three progressive levels of impaired metabolic status were observed: O1 presented insulin resistance, O2 were insulin resistant and obese, and groups O3, O4, and O5 were insulin resistant, obese, and diabetic. These three levels of metabolic damage were proportional to the increase of leptin and decreased circulating testosterone. The impairment in the daily sperm production (DSP) paralleled these three levels of metabolic and hormonal damage being marginal in O1, increasing in O2, and being higher in groups O3, O4, O5, and O6. None of the OE periods affected the sperm transit time in the epididymis, and the lower sperm reserves were caused mainly by impaired DSP. In conclusion, OE during sexual maturation markedly reduces the DSP at adulthood in the rat. A severe reduction in the DSP also occurs in OE exposure during gestation/lactation but not in gestation, indicating that breast-feeding is a critical period for spermatogenic impairment under obesogenic conditions.

Semi-determinate Growth Habit Adjusts The Vegetative-to-reproductive Balance And Increases Productivity And Water-use Efficiency In Tomato (solanum Lycopersicum).

Tomato (Solanum lycopersicum) shows three growth habits: determinate, indeterminate and semi-determinate. These are controlled mainly by allelic variation in the SELF-PRUNING (SP) gene family, which also includes the florigen gene SINGLE FLOWER TRUSS (SFT). Determinate cultivars have synchronized flower and fruit production, which allows mechanical harvesting in the tomato processing industry, whereas indeterminate ones have more vegetative growth with continuous flower and fruit formation, being thus preferred for fresh market tomato production. The semi-determinate growth habit is poorly understood, although there are indications that it combines advantages of determinate and indeterminate growth. Here, we used near-isogenic lines (NILs) in the cultivar Micro-Tom (MT) with different growth habit to characterize semi-determinate growth and to determine its impact on developmental and productivity traits. We show that semi-determinate genotypes are equivalent to determinate ones with extended vegetative growth, which in turn impacts shoot height, number of leaves and either stem diameter or internode length. Semi-determinate plants also tend to increase the highly relevant agronomic parameter Brix×ripe yield (BRY). Water-use efficiency (WUE), evaluated either directly as dry mass produced per amount of water transpired or indirectly through C isotope discrimination, was higher in semi-determinate genotypes. We also provide evidence that the increases in BRY in semi-determinate genotypes are a consequence of an improved balance between vegetative and reproductive growth, a mechanism analogous to the conversion of the overly vegetative tall cereal varieties into well-balanced semi-dwarf ones used in the Green Revolution.

G-quadruplex Formation Enhances Splicing Efficiency Of Pax9 Intron 1.

G-quadruplexes are secondary structures present in DNA and RNA molecules, which are formed by stacking of G-quartets (i.e., interaction of four guanines (G-tracts) bounded by Hoogsteen hydrogen bonding). Human PAX9 intron 1 has a putative G-quadruplex-forming region located near exon 1, which is present in all known sequenced placental mammals. Using circular dichroism (CD) analysis and CD melting, we showed that these sequences are able to form highly stable quadruplex structures. Due to the proximity of the quadruplex structure to exon-intron boundary, we used a validated double-reporter splicing assay and qPCR to analyze its role on splicing efficiency. The human quadruplex was shown to have a key role on splicing efficiency of PAX9 intron 1, as a mutation that abolished quadruplex formation decreased dramatically the splicing efficiency of human PAX9 intron 1. The less stable, rat quadruplex had a less efficient splicing when compared to human sequences. Additionally, the treatment with 360A, a strong ligand that stabilizes quadruplex structures, further increased splicing efficiency of human PAX9 intron 1. Altogether, these results provide evidences that G-quadruplex structures are involved in splicing efficiency of PAX9 intron 1.

Leaf Manganese Accumulation And Phosphorus-acquisition Efficiency.

Plants that deploy a phosphorus (P)-mobilising strategy based on the release of carboxylates tend to have high leaf manganese concentrations ([Mn]). This occurs because the carboxylates mobilise not only soil inorganic and organic P, but also a range of micronutrients, including Mn. Concentrations of most other micronutrients increase to a small extent, but Mn accumulates to significant levels, even when plants grow in soil with low concentrations of exchangeable Mn availability. Here, we propose that leaf [Mn] can be used to select for genotypes that are more efficient at acquiring P when soil P availability is low. Likewise, leaf [Mn] can be used to screen for belowground functional traits related to nutrient-acquisition strategies among species in low-P habitats.

The effect of using mixed initiator systems on the efficiency of photopolymerization of dental resins

A study was performed in order to determine the efficiency of the simultaneous use of the photoinitiators phenylpropanedione (PPD) and camphorquinone (CQ) in the polymerization of acrylic polymers and evaluate possible mechanisms leading to synergism or antagonism. It was found that efficiencies of both initiators taken individually are higher than that of their mixture, indicating that when both dyes are used simultaneously there will be an energy transfer from the more efficient initiator (CQ) to the less efficient one (PPD). Also, there was no proof of any reaction between the amine present in the CQ formulation and the PPD excited state.