3,473 research outputs found

    GLB: Lifeline-based Global Load Balancing library in X10

    Full text link
    We present GLB, a programming model and an associated implementation that can handle a wide range of irregular paral- lel programming problems running over large-scale distributed systems. GLB is applicable both to problems that are easily load-balanced via static scheduling and to problems that are hard to statically load balance. GLB hides the intricate syn- chronizations (e.g., inter-node communication, initialization and startup, load balancing, termination and result collection) from the users. GLB internally uses a version of the lifeline graph based work-stealing algorithm proposed by Saraswat et al. Users of GLB are simply required to write several pieces of sequential code that comply with the GLB interface. GLB then schedules and orchestrates the parallel execution of the code correctly and efficiently at scale. We have applied GLB to two representative benchmarks: Betweenness Centrality (BC) and Unbalanced Tree Search (UTS). Among them, BC can be statically load-balanced whereas UTS cannot. In either case, GLB scales well-- achieving nearly linear speedup on different computer architectures (Power, Blue Gene/Q, and K) -- up to 16K cores

    Scalable Parallel Numerical Constraint Solver Using Global Load Balancing

    Full text link
    We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load balancing (GLB) method. The parallel solver is implemented with X10 that provides an implementation of GLB as a library. In experiments, several NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer.Comment: To be presented at X10'15 Worksho

    Iowa Department of Commerce, Iowa Utilities Board Division Performance Report, FY 2008

    Get PDF
    Agency Performance Repor

    Iowa Department of Commerce, Iowa Utilities Board Division Performance Report, FY 2004

    Get PDF
    Agency Performance Repor

    Iowa Department of Commerce, Iowa Utilities Board Division Performance Report, FY 2007

    Get PDF
    Agency Performance Repor

    Condition Monitoring and Fault Detection of Blade Damage in Small Wind Turbines Using Time-series and Frequency Analyses

    Get PDF
    Condition monitoring systems are critical for autonomous detection of damage when operating remote wind turbines. These systems continually monitor the turbine’s operating parameters and detect damage before the turbine fails. Although common in utility-scale turbines, these systems are mostly undeveloped in distributed, small-scale turbines due to their high cost and need for specialized equipment. The Cal Poly Wind Power Research Center is developing a low-cost, modular solution known as the LifeLine system. The previous version contained monitoring equipment, but lacked decision-making capabilities. The present work builds on the LifeLine by developing software-based detection of blade damage. Detection is done by monitoring of tower vibrations, rotor speed, and generator power output. First, testing is completed to inform algorithm design: the tower vibrational response is recorded, and blade damage is simulated by adding a mass imbalance to one blade. From these results, several algorithms are developed, and their performance is analyzed in a cross-validation study. The time-series method known as the Nonlinear State Estimation Technique and Sequential Probability Ratio Test (NSET+SPRT) is implemented first. This algorithm is highly successful, with a 93.3% rate of correct damage detection; however, it occasionally raises false alarms during normal operation. A custom-built algorithm known as the Adaptive Fast Fourier Transform (AFFT) is also built; its strength lies in its elimination of false alarms. The final system utilizes a joint monitoring approach, combining the benefits of the NSET+SPRT and AFFT. The final algorithm is successful, correctly categorizing 95.5% of data when operating above 120RPM, and raising no false alarms in normal operation. This version is then implemented for live monitoring on the Cal Poly Wind Turbine, allowing for robust and autonomous detection of blade damage

    Overlay-Centric Load Balancing: Applications to UTS and B&B

    Get PDF
    International audienceTo deal with dynamic load balancing in large scale distributed systems, we propose to organize computing resources following a logical peer-to-peer overlay and to distribute the load according to the so-defined overlay. We use a tree as a logical structure connecting distributed nodes and we balance the load according to the size of induced subtrees. We conduct extensive experiments involving up to 1000 computing cores and provide a throughout analysis of different properties of our generic approach for two different applications, namely, the standard Unbalanced Tree Search and the more challenging parallel Branch-and-Bound algorithm. Substantial improvements are reported in comparison with the classical random work stealing and two finely tuned application specific strategies taken from the literature
    • …
    corecore