17,895 research outputs found

    Distributed-Memory Breadth-First Search on Massive Graphs

    Full text link
    This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.Comment: arXiv admin note: text overlap with arXiv:1104.451

    Two-stage optimization method for efficient power converter design including light load operation

    Get PDF
    Power converter efficiency is always a hot topic for switch mode power supplies. Nowadays, high efficiency is required over a wide load range, e.g., 20%, 50% and 100% load. Computer-aided design optimization is developed in this research work, to optimize off-line power converter efficiency from light load to full load. A two-stage optimization method to optimize power converter efficiency from light load to full load is proposed. The optimization procedure first breaks the converter design variables into many switching frequency loops. In each fixed switching frequency loop, the optimal designs for 20%, 50% and 100% load are derived separately in the first stage, and an objective function using the optimization results in the first stage is formed in the second stage to consider optimizing efficiency at 20%, 50% and 100% load. Component efficiency models are also established to serve as the objective functions of optimizations. Prototypes 400V to 12V/25A 300W two-FET forward converters are built to verify the optimization results

    Design and implementation of a linear motor for multi-car elevators

    Get PDF
    The multi-car elevator system is a revolutionary new technology for high-rise buildings, promising outstanding economic benefits, but also requiring new technology for propulsion, safety and control. In this paper we report on experimental results with new components for linear motor driven multi-car elevators. We show that linear synchronous motors with optimized design and with our new safety and control system can be considered as core components of a new generation of elevator systems. The main new results concern the development of a safety system integrated into the propulsion system, the design methodology of a linear motor optimized for the multi-car elevator task, and the motion control system that is expected to be usable for extra high-rise buildings

    Linear motor for multi-car elevators, design and position measurement

    Get PDF
    Multi-car elevator is an emerging technology consisting of two or more elevator cars moving independently in an elevator hoistway, which has become more appealing as building heights increase. In this paper, the design and drive methodologies for a linear motor driven multi-car elevator system with independently moving cars is introduced together with experimental results. Additionally, a safety method developed for the linear motor elevator and the conditions necessary for its proper operation are discussed. The new results introduced in this paper are in the areas of the design method of the linear motor for multi-car elevator system, and the preliminary results for the position measurement system

    Modula-2*: An extension of Modula-2 for highly parallel programs

    Get PDF
    Parallel programs should be machine-independent, i.e., independent of properties that are likely to differ from one parallel computer to the next. Extensions are described of Modula-2 for writing highly parallel, portable programs meeting these requirements. The extensions are: synchronous and asynchronous forms of forall statement; and control of the allocation of data to processors. Sample programs written with the extensions demonstrate the clarity of parallel programs when machine-dependent details are omitted. The principles of efficiently implementing the extensions on SIMD, MIMD, and MSIMD machines are discussed. The extensions are small enough to be integrated easily into other imperative languages
    corecore