954 research outputs found

    Graying of the Northwest?

    Get PDF
    Economic conditions - West (U.S.)

    A Multilevel Approach to Topology-Aware Collective Operations in Computational Grids

    Full text link
    The efficient implementation of collective communiction operations has received much attention. Initial efforts produced "optimal" trees based on network communication models that assumed equal point-to-point latencies between any two processes. This assumption is violated in most practical settings, however, particularly in heterogeneous systems such as clusters of SMPs and wide-area "computational Grids," with the result that collective operations perform suboptimally. In response, more recent work has focused on creating topology-aware trees for collective operations that minimize communication across slower channels (e.g., a wide-area network). While these efforts have significant communication benefits, they all limit their view of the network to only two layers. We present a strategy based upon a multilayer view of the network. By creating multilevel topology-aware trees we take advantage of communication cost differences at every level in the network. We used this strategy to implement topology-aware versions of several MPI collective operations in MPICH-G2, the Globus Toolkit[tm]-enabled version of the popular MPICH implementation of the MPI standard. Using information about topology provided by MPICH-G2, we construct these multilevel topology-aware trees automatically during execution. We present results demonstrating the advantages of our multilevel approach by comparing it to the default (topology-unaware) implementation provided by MPICH and a topology-aware two-layer implementation.Comment: 16 pages, 8 figure

    CoreTSAR: Task Scheduling for Accelerator-aware Runtimes

    Get PDF
    Heterogeneous supercomputers that incorporate computational accelerators such as GPUs are increasingly popular due to their high peak performance, energy efficiency and comparatively low cost. Unfortunately, the programming models and frameworks designed to extract performance from all computational units still lack the flexibility of their CPU-only counterparts. Accelerated OpenMP improves this situation by supporting natural migration of OpenMP code from CPUs to a GPU. However, these implementations currently lose one of OpenMP’s best features, its flexibility: typical OpenMP applications can run on any number of CPUs. GPU implementations do not transparently employ multiple GPUs on a node or a mix of GPUs and CPUs. To address these shortcomings, we present CoreTSAR, our runtime library for dynamically scheduling tasks across heterogeneous resources, and propose straightforward extensions that incorporate this functionality into Accelerated OpenMP. We show that our approach can provide nearly linear speedup to four GPUs over only using CPUs or one GPU while increasing the overall flexibility of Accelerated OpenMP

    SCALO: Scalability-Aware Parallelism Orchestration for Multi-Threaded Workloads

    Get PDF
    This article contributes a solution to orchestrate concurrent application execution to increase throughput. SCALO monitors co-executing applications at runtime to evaluate their scalability

    Importance of Diversity: Understanding Individuals with Cerebral Palsy

    Get PDF

    UAPI Continental Security Conference Special Report, February 2011

    Get PDF

    Exercise Training Prevents Diaphragm Contractile Dysfunction in Heart Failure

    Get PDF
    Purpose: Patient studies have demonstrated the efficacy of exercise training in attenuating respiratory muscle weakness in chronic heart failure (HF), yet direct assessment of muscle fiber contractile function together with data on the underlying intracellular mechanisms remains elusive. The present study, therefore, used a mouse model of HF to assess whether exercise training could prevent diaphragm contractile fiber dysfunction by potentially mediating the complex interplay between intracellular oxidative stress and proteolysis. Methods: Mice underwent sham operation (n = 10) or a ligation of the left coronary artery and were randomized to sedentary HF (n = 10) or HF with aerobic exercise training (HF + AET; n = 10). Ten weeks later, echocardiography and histological analyses confirmed HF. Results: In vitro diaphragm fiber bundles demonstrated contractile dysfunction in sedentary HF compared with sham mice that was prevented by AET, with maximal force 21.0 ± 0.7 versus 26.7 ± 1.4 and 25.4 ± 1.4 N·cm−2, respectively (P < 0.05). Xanthine oxidase enzyme activity and MuRF1 protein expression, markers of oxidative stress and protein degradation, were ~20% and ~70% higher in sedentary HF compared with sham mice (P < 0.05) but were not different when compared with the HF + AET group. Oxidative modifications to numerous contractile proteins (i.e., actin and creatine kinase) and markers of proteolysis (i.e., proteasome and calpain activity) were elevated in sedentary HF compared with HF + AET mice (P < 0.05); however, these indices were not significantly different between sedentary HF and sham mice. Antioxidative enzyme activities were also not different between groups. Conclusion: Our findings demonstrate that AET can protect against diaphragm contractile fiber dysfunction induced by HF, but it remains unclear whether alterations in oxidative stress and/or protein degradation are primarily responsible

    Convergence Times of Decentralized Graph Coloring Algorithms

    Get PDF
    Ordinary graph coloring algorithms are nothing without their calculations, memorizations, and inter-vertex communications. We investigate a class of ultra simple algorithms which can find (Delta+1)-colorings despite drastic restrictions. For each procedure, conflicted vertices randomly recolor one at a time until the graph coloring is valid. We provide an array of run time bounds for these processes, including an O(n*log(Delta)) bound for a variant we propose, and an O(n*Delta) bound which applies to even the most adversarial scenarios
    corecore