Sample records for kilowatt-hour parallel generation

  1. Energy savings can be communicated in terms of kilowatt hours (energy), carbon (climate change) or pounds (cost).

    E-Print Network [OSTI]

    McAuley, Derek

    AIM Energy savings can be communicated in terms of kilowatt hours (energy), carbon (climate change) or pounds (cost). We want to know if these different communication units prime different motivations more broadly. This implies that considering carbon may result in wider changes in sustainable behaviour

  2. Computer Assisted Parallel Program Generation

    E-Print Network [OSTI]

    Kawata, Shigeo

    2015-01-01T23:59:59.000Z

    Parallel computation is widely employed in scientific researches, engineering activities and product development. Parallel program writing itself is not always a simple task depending on problems solved. Large-scale scientific computing, huge data analyses and precise visualizations, for example, would require parallel computations, and the parallel computing needs the parallelization techniques. In this Chapter a parallel program generation support is discussed, and a computer-assisted parallel program generation system P-NCAS is introduced. Computer assisted problem solving is one of key methods to promote innovations in science and engineering, and contributes to enrich our society and our life toward a programming-free environment in computing science. Problem solving environments (PSE) research activities had started to enhance the programming power in 1970's. The P-NCAS is one of the PSEs; The PSE concept provides an integrated human-friendly computational software and hardware system to solve a target ...

  3. Title 20, California Code of Regulations Article 5. Electricity Generation Source Disclosure

    E-Print Network [OSTI]

    fossil fuel may not be included: (1) Biomass and waste. For purposes of these regulations, "biomass type attribute" means the fuel or technology type used to generate a quantity of kilowatt hours

  4. Optimization Online - PSMG-A Parallel Structured Model Generator ...

    E-Print Network [OSTI]

    Feng Qiang

    2014-10-10T23:59:59.000Z

    Oct 10, 2014 ... As far as we are aware, PSMG is the first processor for an algebraic modelling language that is capable of generating the problem in parallel.

  5. Parallel Animated Image File Generation Nishad Patel

    E-Print Network [OSTI]

    Kaminsky, Alan

    , frame) · getPixelDataSegmentParameters() · readSegment() #12;Hypotheses · Serial PJM processing times vs. Parallel PJM processing times ­ Parallel PJM should be quicker · Post-processing times vs. In-situ processing times ­ In-situ processing should be quicker · PJM processing times vs. processing times for other

  6. Full expandable model of parallel self-excited induction generators

    E-Print Network [OSTI]

    Simes, Marcelo Godoy

    possibilities for incorporating advanced control to monitor and optimise a parallel installation of SEIGs and small induction motors. Typically, generators rated 15kVA are cost effective; but 100kVA [4] was found, the trend has changed from installing a few wind turbines to planning large wind farm installations

  7. Data:16cc1788-21d0-4a0b-8df1-4c91f66fb14a | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  8. Data:2479093a-56c0-4270-a09d-d5cc0d3440ca | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  9. Data:Ca36075e-72ee-48a7-9ec2-da25d52a9ac1 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0583 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  10. Data:72748f8c-1d0a-49c8-b850-c0bf05945444 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0785 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  11. Data:Fe5ec4e5-feb8-46c4-a088-48299e29c2f6 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  12. Data:17dc89f8-92d6-40a3-a263-d6698a2ae638 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0583 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  13. Data:9a87e30d-b106-4fb8-81d6-2cd201f57d69 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  14. Data:434682d3-1caf-49df-b1fb-06e5d91edec8 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0785 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  15. Data:B447adfe-305f-45f2-8b76-fef5eed1b014 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  16. Data:001e54c2-b58d-4c84-a4a1-4421fbfa06ca | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  17. Data:49e21093-b78e-4d0e-86a8-ecc7e88f7173 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  18. Data:C0e43caf-dd27-4614-98c5-668a21c57e77 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0583 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  19. Data:3f661084-6107-4522-9923-7dd335dc7787 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0773 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  20. Data:3189e1b5-e3c4-4f48-bc02-b7b87330dc18 | Open Energy Information

    Open Energy Info (EERE)

    base cost of power (U) is 0.0720 per kilowatt-hour. Parallel Generation (20 kW or less) Net Energy Billing - Available for single-phase and three-phase customers where a part or...

  1. Automatic generation of executable communication specifications from parallel applications

    SciTech Connect (OSTI)

    Pakin, Scott [Los Alamos National Laboratory; Wu, Xing [NCSU; Mueller, Frank [NCSU

    2011-01-19T23:59:59.000Z

    Portable parallel benchmarks are widely used and highly effective for (a) the evaluation, analysis and procurement of high-performance computing (HPC) systems and (b) quantifying the potential benefits of porting applications for new hardware platforms. Yet, past techniques to synthetically parameterized hand-coded HPC benchmarks prove insufficient for today's rapidly-evolving scientific codes particularly when subject to multi-scale science modeling or when utilizing domain-specific libraries. To address these problems, this work contributes novel methods to automatically generate highly portable and customizable communication benchmarks from HPC applications. We utilize ScalaTrace, a lossless, yet scalable, parallel application tracing framework to collect selected aspects of the run-time behavior of HPC applications, including communication operations and execution time, while abstracting away the details of the computation proper. We subsequently generate benchmarks with identical run-time behavior from the collected traces. A unique feature of our approach is that we generate benchmarks in CONCEPTUAL, a domain-specific language that enables the expression of sophisticated communication patterns using a rich and easily understandable grammar yet compiles to ordinary C + MPI. Experimental results demonstrate that the generated benchmarks are able to preserve the run-time behavior - including both the communication pattern and the execution time - of the original applications. Such automated benchmark generation is particularly valuable for proprietary, export-controlled, or classified application codes: when supplied to a third party. Our auto-generated benchmarks ensure performance fidelity but without the risks associated with releasing the original code. This ability to automatically generate performance-accurate benchmarks from parallel applications is novel and without any precedence, to our knowledge.

  2. Parallel electric field generation by Alfven wave turbulence

    E-Print Network [OSTI]

    Bian, N H; Brown, J C

    2010-01-01T23:59:59.000Z

    {This work aims to investigate the spectral structure of the parallel electric field generated by strong anisotropic and balanced Alfvenic turbulence in relation with the problem of electron acceleration from the thermal population in solar flare plasma conditions.} {We consider anisotropic Alfvenic fluctuations in the presence of a strong background magnetic field. Exploiting this anisotropy, a set of reduced equations governing non-linear, two-fluid plasma dynamics is derived. The low-$\\beta$ limit of this model is used to follow the turbulent cascade of the energy resulting from the non-linear interaction between kinetic Alfven waves, from the large magnetohydrodynamics (MHD) scales with $k_{\\perp}\\rho_{s}\\ll 1$ down to the small "kinetic" scales with $k_{\\perp}\\rho_{s} \\gg 1$, $\\rho_{s}$ being the ion sound gyroradius.} {Scaling relations are obtained for the magnitude of the turbulent electromagnetic fluctuations, as a function of $k_{\\perp}$ and $k_{\\parallel}$, showing that the electric field develops ...

  3. Highly Scalable On-the-Fly Interleaved Address Generation for UMTS/HSPA+ Parallel Turbo Decoder

    E-Print Network [OSTI]

    Mellor-Crummey, John

    Highly Scalable On-the-Fly Interleaved Address Generation for UMTS/HSPA+ Parallel Turbo Decoder@huawei.com Abstract-- High throughput parallel interleaver design is a major challenge in designing parallel turbo the silicon area and frequency is improved compared to recent related works. Keywords--Turbo decoder

  4. PSMGA Parallel Structured Model Generator for Mathematical ...

    E-Print Network [OSTI]

    2014-10-09T23:59:59.000Z

    elling and generating large scale nested structured problems, including .... statements to describe repeated common structures that build up the full problem.

  5. Feasibility Study of Biomass Electrical Generation on Tribal Lands

    SciTech Connect (OSTI)

    Tom Roche; Richard Hartmann; Joohn Luton; Warren Hudelson; Roger Blomguist; Jan Hacker; Colene Frye

    2005-03-29T23:59:59.000Z

    The goals of the St. Croix Tribe are to develop economically viable energy production facilities using readily available renewable biomass fuel sources at an acceptable cost per kilowatt hour ($/kWh), to provide new and meaningful permanent employment, retain and expand existing employment (logging) and provide revenues for both producers and sellers of the finished product. This is a feasibility study including an assessment of available biomass fuel, technology assessment, site selection, economics viability given the foreseeable fuel and generation costs, as well as an assessment of the potential markets for renewable energy.

  6. Bit error rate tester using fast parallel generation of linear recurring sequences

    DOE Patents [OSTI]

    Pierson, Lyndon G.; Witzke, Edward L.; Maestas, Joseph H.

    2003-05-06T23:59:59.000Z

    A fast method for generating linear recurring sequences by parallel linear recurring sequence generators (LRSGs) with a feedback circuit optimized to balance minimum propagation delay against maximal sequence period. Parallel generation of linear recurring sequences requires decimating the sequence (creating small contiguous sections of the sequence in each LRSG). A companion matrix form is selected depending on whether the LFSR is right-shifting or left-shifting. The companion matrix is completed by selecting a primitive irreducible polynomial with 1's most closely grouped in a corner of the companion matrix. A decimation matrix is created by raising the companion matrix to the (n*k).sup.th power, where k is the number of parallel LRSGs and n is the number of bits to be generated at a time by each LRSG. Companion matrices with 1's closely grouped in a corner will yield sparse decimation matrices. A feedback circuit comprised of XOR logic gates implements the decimation matrix in hardware. Sparse decimation matrices can be implemented with minimum number of XOR gates, and therefore a minimum propagation delay through the feedback circuit. The LRSG of the invention is particularly well suited to use as a bit error rate tester on high speed communication lines because it permits the receiver to synchronize to the transmitted pattern within 2n bits.

  7. How Much Energy is a Kilowatt Hour? Jim Settelmeyer Cottage Grove High School

    E-Print Network [OSTI]

    Oregon, University of

    .k12.or.us Frank Vignola University of Oregon fev@uoregon.edu For Emerald People's Utility District: ..........................................................................................................................................................2 Prelab for "Lab: My Personal Power Plant: ............................................................................................................................................................3 II. Lab: My Personal Power Plant

  8. Fridge of the future: Designing a one-kilowatt-hour/day domestic refrigerator-freezer

    SciTech Connect (OSTI)

    Vineyard, E.A.; Sand, J.R.

    1998-03-01T23:59:59.000Z

    An industry/government Cooperative Research and Development Agreement (CRADA) was established to evaluate and test design concepts for a domestic refrigerator-freezer unit that represents approximately 60% of the US market. The goal of the CRADA was to demonstrate advanced technologies which reduce, by 50 percent, the 1993 NAECA standard energy consumption for a 20 ft{sup 3} (570 I) top-mount, automatic-defrost, refrigerator-freezer. For a unit this size, the goal translated to an energy consumption of 1.003 kWh/d. The general objective of the research was to facilitate the introduction of cost-efficient technologies by demonstrating design changes that can be effectively incorporated into new products. A 1996 model refrigerator-freezer was selected as the baseline unit for testing. Since the unit was required to meet the 1993 NAECA standards, the energy consumption was quite low (1.676 kWh/d), thus making further reductions in energy consumption very challenging. Among the energy saving features incorporated into the original design of the baseline unit were a low-wattage evaporator fan, increased insulation thicknesses, and liquid line flange heaters.

  9. Experimental and cost analyses of a one kilowatt-hour/day domestic refrigerator-freezer

    SciTech Connect (OSTI)

    Vineyard, E.A.; Sand, J.R.

    1997-05-01T23:59:59.000Z

    Over the past ten years, government regulations for energy standards, coupled with the utility industry`s promotion of energy-efficient appliances, have prompted appliance manufacturers to reduce energy consumption in refrigerator-freezers by approximately 40%. Global concerns over ozone depletion have also required the appliance industry to eliminate CFC-12 and CFC-11 while concurrently improving energy efficiency to reduce greenhouse emissions. In response to expected future regulations that will be more stringent, several design options were investigated for improving the energy efficiency of a conventionally designed, domestic refrigerator-freezer. The options, such as cabinet and door insulation improvements and a high-efficiency compressor were incorporated into a prototype refrigerator-freezer cabinet and refrigeration system. Baseline energy consumption of the original 1996 production refrigerator-freezer, along with cabinet heat load and compressor calorimeter test results, were extensively documented to provide a firm basis for experimentally measured energy savings. The goal for the project was to achieve an energy consumption that is 50% below in 1993 National Appliance Energy Conservation Act (NAECA) standard for 20 ft{sup 3} (570 l) units. Based on discussions with manufacturers to determine the most promising energy-saving options, a laboratory prototype was fabricated and tested to experimentally verify the energy consumption of a unit with vacuum insulation around the freezer, increased door thicknesses, a high-efficiency compressor, a low wattage condenser fan, a larger counterflow evaporator, and adaptive defrost control.

  10. Sandia National Laboratories: $0.06 per kilowatt-hour for solar...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Center in Vermont Achieves Milestone Installation On September 23, 2014, in Concentrating Solar Power, Energy, Facilities, National Solar Thermal Test Facility, News, News &...

  11. Scalable parallel physical random number generator based on a superluminescent LED

    E-Print Network [OSTI]

    Li, Xiaowen; Murphy, Thomas E; Roy, Rajarshi

    2011-01-01T23:59:59.000Z

    We describe an optoelectronic system for simultaneously generating parallel, independent streams of random bits using spectrally separated noise signals obtained from a single optical source. Using a pair of non-overlapping spectral filters and a fiber-coupled superluminescent light-emitting diode (SLED), we produced two independent 10 Gb/s random bit streams, for a cumulative generation rate of 20 Gb/s. The system relies principally on chip-based optoelectronic components that could be integrated in a compact, economical package.

  12. Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.

    SciTech Connect (OSTI)

    Staten, Matthew L.; Owen, Steven James

    2010-09-01T23:59:59.000Z

    Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining a geometric domain. New methods for refinement, node smoothing, resolving non-manifold conditions and defining geometry are also introduced as well as an extension of the algorithm to handle tetrahedral meshes. We also describe new scalable MPI-based implementations of these procedures. We describe a new software module, Sculptor, which has been developed for use as an embedded component of CTH. We also describe its interface and its use within the mesh generation code, CUBIT. Several examples are shown to illustrate the capabilities of Sculptor.

  13. Localized parallel parametric generation of spin waves in a Ni{sub 81}Fe{sub 19} waveguide by spatial variation of the pumping field

    SciTech Connect (OSTI)

    Brcher, T. [Fachbereich Physik and Landesforschungszentrum OPTIMAS, Technische Universitt Kaiserslautern, D-67663 Kaiserslautern (Germany); Graduate School Materials Science in Mainz, Gottlieb-Daimler-Strasse 47, D-67663 Kaiserslautern (Germany); Pirro, P.; Heussner, F.; Serga, A. A.; Hillebrands, B. [Fachbereich Physik and Landesforschungszentrum OPTIMAS, Technische Universitt Kaiserslautern, D-67663 Kaiserslautern (Germany)

    2014-03-03T23:59:59.000Z

    We present the experimental observation of localized parallel parametric generation of spin waves in a transversally in-plane magnetized Ni{sub 81}Fe{sub 19} magnonic waveguide. The localization is realized by combining the threshold character of parametric generation with a spatially confined enhancement of the amplifying microwave field. The latter is achieved by modulating the width of the microstrip transmission line which is used to provide the pumping field. By employing microfocussed Brillouin light scattering spectroscopy, we analyze the spatial distribution of the generated spin waves and compare it with numerical calculations of the field distribution along the Ni{sub 81}Fe{sub 19} waveguide. This provides a local spin-wave excitation in transversally in-plane magnetized waveguides for a wide wave-vector range which is not restricted by the size of the generation area.

  14. A restructuring agenda for developing competitive retail electric markets that is based on a low-cost, real-time, smart-kilowatt-hour meter adapter

    SciTech Connect (OSTI)

    Chasek, N.E.

    1997-12-31T23:59:59.000Z

    This paper proposes six agenda items that should expedite a politically smooth transition into a most efficient economically viable market-driven public power system. The agenda would introduce: the virtual marketplace for retail electric power, smart meters, smart meter readers, near-real-time load balancing and load apportionment, advanced supply and demand or commodity-style pricing, and reliability metering.

  15. Interaction of an oblique shock wave with a pair of parallel vortices: Shock dynamics and mechanism of sound generation

    E-Print Network [OSTI]

    Zhang, Yong-Tao

    and the mechanism of sound generation in the interaction between an oblique shock wave and a pair of vortices. We is related to the interaction of the reflected shock waves and sound waves. The first mechanism is dominating affected by the interaction of the reflected shock waves and sound waves. © 2006 American Institute

  16. Net Metering

    Broader source: Energy.gov [DOE]

    Net excess generation (NEG) is treated as a kilowatt-hour (kWh) credit or other compensation on the customer's following bill.* When an annual period ends, a utility will purchase unused credits...

  17. SECTION III

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    electricity using wind, photovoltaics (PV), hydropower, biomass, landfill gas, or fuel cells. The generated electricity in excess of demand can be applied as a kilowatt-hour (kWh)...

  18. Palmetto Clean Energy (PaCE) Program

    Broader source: Energy.gov [DOE]

    '''''Note: For a limited time, generators of 6 kilowatts or less of renewable energy can now take advantage of a premium $0.10 per kilowatt hour. This premium is available on a first-come-first...

  19. Renewable Energy Production Tax Credit (Corporate)

    Broader source: Energy.gov [DOE]

    Enacted in 2002, the New Mexico Renewable Energy Production Tax Credit provides a tax credit against the corporate income tax of one cent per kilowatt-hour for companies that generate electricity...

  20. Renewable Energy Production Tax Credit (Personal)

    Broader source: Energy.gov [DOE]

    Enacted in 2002, the New Mexico Renewable Energy Production Tax Credit provides a tax credit against the personal income tax of one cent per kilowatt-hour for companies that generate electricity...

  1. Multithreading and Parallel Microprocessors

    E-Print Network [OSTI]

    Shinozuka, Masanobu

    Multithreading and Parallel Microprocessors Stephen Jenks Electrical Engineering and Computer Scalable Parallel and Distributed Systems Lab 4 Outline Parallelism in Microprocessors Multicore Processor Parallelism Parallel Programming for Shared Memory OpenMP POSIX Threads Java Threads Parallel Microprocessor

  2. Life Cycle Greenhouse Gas Emissions of Coal-Fired Electricity Generation: Systematic Review and Harmonization

    SciTech Connect (OSTI)

    Whitaker, M.; Heath, G. A.; O'Donoughue, P.; Vorum, M.

    2012-04-01T23:59:59.000Z

    This systematic review and harmonization of life cycle assessments (LCAs) of utility-scale coal-fired electricity generation systems focuses on reducing variability and clarifying central tendencies in estimates of life cycle greenhouse gas (GHG) emissions. Screening 270 references for quality LCA methods, transparency, and completeness yielded 53 that reported 164 estimates of life cycle GHG emissions. These estimates for subcritical pulverized, integrated gasification combined cycle, fluidized bed, and supercritical pulverized coal combustion technologies vary from 675 to 1,689 grams CO{sub 2}-equivalent per kilowatt-hour (g CO{sub 2}-eq/kWh) (interquartile range [IQR]= 890-1,130 g CO{sub 2}-eq/kWh; median = 1,001) leading to confusion over reasonable estimates of life cycle GHG emissions from coal-fired electricity generation. By adjusting published estimates to common gross system boundaries and consistent values for key operational input parameters (most importantly, combustion carbon dioxide emission factor [CEF]), the meta-analytical process called harmonization clarifies the existing literature in ways useful for decision makers and analysts by significantly reducing the variability of estimates ({approx}53% in IQR magnitude) while maintaining a nearly constant central tendency ({approx}2.2% in median). Life cycle GHG emissions of a specific power plant depend on many factors and can differ from the generic estimates generated by the harmonization approach, but the tightness of distribution of harmonized estimates across several key coal combustion technologies implies, for some purposes, first-order estimates of life cycle GHG emissions could be based on knowledge of the technology type, coal mine emissions, thermal efficiency, and CEF alone without requiring full LCAs. Areas where new research is necessary to ensure accuracy are also discussed.

  3. Parallel MATLAB: Parallel For Loops

    E-Print Network [OSTI]

    Crawford, T. Daniel

    is an extension of MATLAB that takes advantage of multicore desktop machines and clusters. The Parallel Computing work in a simplified kind of MPI model. There is always a special "client" process. Each worker process distributed arrays. A distributed array is logically one array, and a large set of MATLAB commands can treat

  4. Parallel hierarchical radiosity rendering

    SciTech Connect (OSTI)

    Carter, M.

    1993-07-01T23:59:59.000Z

    In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.

  5. Life Cycle Greenhouse Gas Emissions of Nuclear Electricity Generation: Systematic Review and Harmonization

    SciTech Connect (OSTI)

    Warner, E. S.; Heath, G. A.

    2012-04-01T23:59:59.000Z

    A systematic review and harmonization of life cycle assessment (LCA) literature of nuclear electricity generation technologies was performed to determine causes of and, where possible, reduce variability in estimates of life cycle greenhouse gas (GHG) emissions to clarify the state of knowledge and inform decision making. LCA literature indicates that life cycle GHG emissions from nuclear power are a fraction of traditional fossil sources, but the conditions and assumptions under which nuclear power are deployed can have a significant impact on the magnitude of life cycle GHG emissions relative to renewable technologies. Screening 274 references yielded 27 that reported 99 independent estimates of life cycle GHG emissions from light water reactors (LWRs). The published median, interquartile range (IQR), and range for the pool of LWR life cycle GHG emission estimates were 13, 23, and 220 grams of carbon dioxide equivalent per kilowatt-hour (g CO{sub 2}-eq/kWh), respectively. After harmonizing methods to use consistent gross system boundaries and values for several important system parameters, the same statistics were 12, 17, and 110 g CO{sub 2}-eq/kWh, respectively. Harmonization (especially of performance characteristics) clarifies the estimation of central tendency and variability. To explain the remaining variability, several additional, highly influential consequential factors were examined using other methods. These factors included the primary source energy mix, uranium ore grade, and the selected LCA method. For example, a scenario analysis of future global nuclear development examined the effects of a decreasing global uranium market-average ore grade on life cycle GHG emissions. Depending on conditions, median life cycle GHG emissions could be 9 to 110 g CO{sub 2}-eq/kWh by 2050.

  6. Is Monte Carlo embarrassingly parallel?

    SciTech Connect (OSTI)

    Hoogenboom, J. E. [Delft Univ. of Technology, Mekelweg 15, 2629 JB Delft (Netherlands); Delft Nuclear Consultancy, IJsselzoom 2, 2902 LB Capelle aan den IJssel (Netherlands)

    2012-07-01T23:59:59.000Z

    Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)

  7. RESEARCH ARTICLE On the parallel solution of dense saddle ...

    E-Print Network [OSTI]

    2010-10-26T23:59:59.000Z

    Oct 15, 2010 ... generation high performance computing. By parallelizing the dense factorization, we removed the memory usage bottle- neck that prevented...

  8. Parallel flow diffusion battery

    DOE Patents [OSTI]

    Yeh, H.C.; Cheng, Y.S.

    1984-01-01T23:59:59.000Z

    A parallel flow diffusion battery for determining the mass distribution of an aerosol has a plurality of diffusion cells mounted in parallel to an aerosol stream, each diffusion cell including a stack of mesh wire screens of different density.

  9. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes

    E-Print Network [OSTI]

    Arnold, Gilad

    2011-01-01T23:59:59.000Z

    3 Verifying High-Level Sparse Codes 3.1by generated code . . . . . . . . . . . . . . . . . . . .4.7.2 Generating parallel code with OpenMP

  10. SPRNG Parallel Random Number Generators at NERSC

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Scienceand Requirements RecentlyElectronicResourcesjobsJuly through Sept 2000 TABLE OF SLACSPRNG

  11. Economic Evaluation of Electrical Power Generation Using Laser Inertial Fusion Energy (LIFE)

    E-Print Network [OSTI]

    Tm Anklam; Wayne Meier; Al Erl; Robin Miles; Aaron Simon

    2009-01-01T23:59:59.000Z

    With the completion of the National Ignition Facility (NIF) and upcoming ignition experiments, there is renewed interest in laser fusion-fission hybrids and pure fusion systems for base load power generation. An advantage of a laser fusion based system is that it would produce copious neutrons ( ~ 1.8x10 20 /s for a 500 MW fusion source). This opens the door to hybrid systems with once through, high burn-up, closed fuel cycles. With abundant fusion neutrons, only modest fission gain (5 to 10) is needed for power production. Depleted uranium can be used as the fission fuel, effectively eliminating the need for uranium mining and enrichment. With high burn up, a hybrid would generate only 5 % to 10% the volume of high-level nuclear waste per kilowatt hour that a once through light water reactor (LWR) does. Reprocessing is no longer needed to close the fuel cycle as the spent fuel can, after interim cooling, go directly to geologic disposal. While the depleted uranium fuel cycle offers advantages of simplicity and proliferation avoidance, it has the most challenging fuel lifetime requirements. Fissile fuel such as plutonium, or plutonium and minor actinides separated from spent nuclear fuel, would have roughly twice the fission gain and incur only about 25 % of the radiation damage to reach the same burn up level as depleted uranium. These missions are interesting in their own right and also provide an opportunity for early market entry of laser fusion based energy sources. A third fuel cycle option is to burn spent fuel directly, without prior separation of the plutonium and minor actinides. The neutronic and economic performance of this fuel cycle is very similar to the depleted uranium system. The primary difference is the need to fabricate new LIFE fuel from spent LWR fuel. The advantage of this fuel cycle is that it would burn the residual actinides in spent nuclear fuel, greatly reducing long term radio-toxicity and heat load, while avoiding the need to chemically separate spent LWR fuel.

  12. The STAPL Parallel Container Framework

    E-Print Network [OSTI]

    Tanase, Ilie Gabriel

    2012-02-14T23:59:59.000Z

    The Standard Template Adaptive Parallel Library (STAPL) is a parallel programming infrastructure that extends C with support for parallelism. STAPL provides a run-time system, a collection of distributed data structures (pContainers) and parallel...

  13. Reconciliation of Retailer Claims, 2005 CommissionReport

    E-Print Network [OSTI]

    used to provide electric services." All retail providers of electricity must disclose fuel source's default product. The law also requires all electricity generators who report meter data to a system operator to also report generation (in kilowatt-hours), generator technology, and fuel type consumed (as

  14. Implementing a parallel C++ runtime system for scalable parallel systems

    SciTech Connect (OSTI)

    Bodin, F. [Univ. of Rennes (France); Beckman, P.; Gannon, D.; Yang, S. [Indiana Univ., Bloomington, IN (United States); Kesavan, S.; Malony, A.; Mohr, B. [Univ. of Oregon, Eugene, OR (United States)

    1993-12-31T23:59:59.000Z

    pC++ is a language extension to C++ designed to allow programmers to compose ``concurrent aggregate`` collection classes which can be aligned and distributed over the memory hierarchy of a parallel machine in a manner modeled on the High Performance Fortran Forum (HPFF) directives for Fortran 90. pC++ allows the user to write portable and efficient code which will run on a wide range of scalable parallel computer systems. The first version of the compiler is a preprocessor which generates Single Program Multiple Data (SPMD) C++ code. Currently, it runs on the Thinking Machines CM-5, the Intel Paragon, the BBN TC2000, the Kendall Square Research KSR-1, and the Sequent Symmetry. In this paper the authors describe the implementation of the runtime system, which provides the concurrency and communication primitives between objects in a distributed collection. To illustrate the behavior of the runtime system they include a description and performance results on four benchmark programs.

  15. Parallel digital forensics infrastructure.

    SciTech Connect (OSTI)

    Liebrock, Lorie M. (New Mexico Tech, Socorro, NM); Duggan, David Patrick

    2009-10-01T23:59:59.000Z

    This report documents the architecture and implementation of a Parallel Digital Forensics infrastructure. This infrastructure is necessary for supporting the design, implementation, and testing of new classes of parallel digital forensics tools. Digital Forensics has become extremely difficult with data sets of one terabyte and larger. The only way to overcome the processing time of these large sets is to identify and develop new parallel algorithms for performing the analysis. To support algorithm research, a flexible base infrastructure is required. A candidate architecture for this base infrastructure was designed, instantiated, and tested by this project, in collaboration with New Mexico Tech. Previous infrastructures were not designed and built specifically for the development and testing of parallel algorithms. With the size of forensics data sets only expected to increase significantly, this type of infrastructure support is necessary for continued research in parallel digital forensics. This report documents the implementation of the parallel digital forensics (PDF) infrastructure architecture and implementation.

  16. Parallel phase model : a programming model for high-end parallel machines with manycores.

    SciTech Connect (OSTI)

    Wu, Junfeng (Syracuse University, Syracuse, NY); Wen, Zhaofang; Heroux, Michael Allen; Brightwell, Ronald Brian

    2009-04-01T23:59:59.000Z

    This paper presents a parallel programming model, Parallel Phase Model (PPM), for next-generation high-end parallel machines based on a distributed memory architecture consisting of a networked cluster of nodes with a large number of cores on each node. PPM has a unified high-level programming abstraction that facilitates the design and implementation of parallel algorithms to exploit both the parallelism of the many cores and the parallelism at the cluster level. The programming abstraction will be suitable for expressing both fine-grained and coarse-grained parallelism. It includes a few high-level parallel programming language constructs that can be added as an extension to an existing (sequential or parallel) programming language such as C; and the implementation of PPM also includes a light-weight runtime library that runs on top of an existing network communication software layer (e.g. MPI). Design philosophy of PPM and details of the programming abstraction are also presented. Several unstructured applications that inherently require high-volume random fine-grained data accesses have been implemented in PPM with very promising results.

  17. Parallel integrated thermal management

    DOE Patents [OSTI]

    Bennion, Kevin; Thornton, Matthew

    2014-08-19T23:59:59.000Z

    Embodiments discussed herein are directed to managing the heat content of two vehicle subsystems through a single coolant loop having parallel branches for each subsystem.

  18. Parallel MATLAB at VT: Parallel For Loops

    E-Print Network [OSTI]

    Crawford, T. Daniel

    is an extension of MATLAB that takes advantage of multicore desktop machines and clusters. The Parallel Computing work in a simplified kind of MPI model. There is always a special "client" process. Each worker process distributed arrays. A distributed array is logically one array, and a large set of MATLAB commands can treat

  19. Parallel computing works

    SciTech Connect (OSTI)

    Not Available

    1991-10-23T23:59:59.000Z

    An account of the Caltech Concurrent Computation Program (C{sup 3}P), a five year project that focused on answering the question: Can parallel computers be used to do large-scale scientific computations '' As the title indicates, the question is answered in the affirmative, by implementing numerous scientific applications on real parallel computers and doing computations that produced new scientific results. In the process of doing so, C{sup 3}P helped design and build several new computers, designed and implemented basic system software, developed algorithms for frequently used mathematical computations on massively parallel machines, devised performance models and measured the performance of many computers, and created a high performance computing facility based exclusively on parallel computers. While the initial focus of C{sup 3}P was the hypercube architecture developed by C. Seitz, many of the methods developed and lessons learned have been applied successfully on other massively parallel architectures.

  20. Towards Pervasive Parallelism Kunle Olukotun

    E-Print Network [OSTI]

    John, Lizy Kurian

    development practical for the masses Not parallel programming as usual PPL is a combination of Leading vision for pervasive parallelism #12;The PPL Team Applications Ron Fedkiw, Vladlen Koltun, Sebastian: Parallel applications without parallel programming #12;The PPL Vision Parallel Object Language Hardware

  1. Parallel algorithms for inductance extraction

    E-Print Network [OSTI]

    Mahawar, Hemant

    2007-09-17T23:59:59.000Z

    - figurations involving several conductors within reasonable time. A two-tier parallelization scheme enables mixed mode parallelization, which uses both OpenMP and MPI directives. The parallel performance of the software is demonstrated through experiments...

  2. Superconnections and Parallel Transport

    E-Print Network [OSTI]

    Dumitrescu, Florin

    2007-01-01T23:59:59.000Z

    This note addresses the construction of a notion of parallel transport along superpaths arising from the concept of a superconnection on a vector bundle over a manifold $M$. A superpath in $M$ is, loosely speaking, a path in $M$ together with an odd vector field in $M$ along the path. We also develop a notion of parallel transport associated with a connection (a.k.a. covariant derivative) on a vector bundle over a \\emph{supermanifold} which is a direct generalization of the classical notion of parallel transport for connections over manifolds.

  3. Automatic Parallelization of Hand Written Automotive Engine Control

    E-Print Network [OSTI]

    Kasahara, Hironori

    Automatic Parallelization of Hand Written Automotive Engine Control Codes Using OSCAR Compiler Dan approach to realize the next- generation automobiles integrated control system. However, automotive-core processors for a long time. This paper proposes to parallelize an automotive engine crankshaft control

  4. Using and Measuring the Combined Heat and Power Advantage

    E-Print Network [OSTI]

    John, T.

    2011-01-01T23:59:59.000Z

    compared to other power generation systems. Fuel Charged to Power (FCP) is the fuel, net of credit for thermal output, required to produce a kilowatt-hour of electricity. This provides a metric that is used for comparison to the heat rate of other types...

  5. Alex Benson Cement Plants

    E-Print Network [OSTI]

    Toohey, Darin W.

    of generating electricity by coal. o From Kiln Combustion CO2 2nd largest CO2 emitter behind electricity cement company 156,000 kilowatt-hours of electricity per year o "Cemex to pay $2M for pollution controls to produce Kiln Mix -> sent to kilns along with coal ( heating is facilitated by the coal ). Kiln Mix

  6. Purdue Agricultural Economics Report Page 1 In This Issue

    E-Print Network [OSTI]

    limited resources such as oil and coal or emit any pollutants into the atmosphere. A utility-scale wind.4 million and 3 million kilowatt- hours (kWh) annually to provide electricity for 240 to 300 households. Around 40% of all new-generation power added to the electric grid in the U.S. in recent years has been

  7. Parallel programming with PCN

    SciTech Connect (OSTI)

    Foster, I.; Tuecke, S.

    1991-12-01T23:59:59.000Z

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. In includes both tutorial and reference material. It also presents the basic concepts that underly PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous FTP from Argonne National Laboratory in the directory pub/pcn at info.mcs.anl.gov (c.f. Appendix A).

  8. Improving Between-Shot Fusion Data Analysis with Parallel Structures

    SciTech Connect (OSTI)

    CHET NIETER

    2005-07-27T23:59:59.000Z

    In the Phase I project we concentrated on three technical objectives to demonstrate the feasibility of the Phase II project: (1) the development of a parallel MDSplus data handler, (2) the parallelization of existing fusion data analysis packages, and (3) the development of techniques to automatically generate parallelized code using pre-compiler directives. We summarize the results of the Phase I research for each of these objectives below. We also describe below additional accomplishments related to the development of the TaskDL and mpiDL parallelization packages.

  9. An Experimental Study of Some Control Parameters in Parallel Genetic Programming

    E-Print Network [OSTI]

    McKay, Robert Ian

    , coarse-grained parallel GAs (also known as distributed GAs or "island" parallel GAs) have been the most demes, the migration rate, the migration generation interval, and the migration policy generation interval (the number of generations in every subpopulation between two successive exchanges, which

  10. Parallel optical sampler

    DOE Patents [OSTI]

    Tauke-Pedretti, Anna; Skogen, Erik J; Vawter, Gregory A

    2014-05-20T23:59:59.000Z

    An optical sampler includes a first and second 1.times.n optical beam splitters splitting an input optical sampling signal and an optical analog input signal into n parallel channels, respectively, a plurality of optical delay elements providing n parallel delayed input optical sampling signals, n photodiodes converting the n parallel optical analog input signals into n respective electrical output signals, and n optical modulators modulating the input optical sampling signal or the optical analog input signal by the respective electrical output signals, and providing n successive optical samples of the optical analog input signal. A plurality of output photodiodes and eADCs convert the n successive optical samples to n successive digital samples. The optical modulator may be a photodiode interconnected Mach-Zehnder Modulator. A method of sampling the optical analog input signal is disclosed.

  11. Parallel programming with PCN

    SciTech Connect (OSTI)

    Foster, I.; Tuecke, S.

    1993-01-01T23:59:59.000Z

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and Cthat allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous ftp from Argonne National Laboratory in the directory pub/pcn at info.mcs. ani.gov (cf. Appendix A). This version of this document describes PCN version 2.0, a major revision of the PCN programming system. It supersedes earlier versions of this report.

  12. Parallel Seismic Ray Tracing

    E-Print Network [OSTI]

    Jain, Tarun K

    2013-12-09T23:59:59.000Z

    of the method while others are intended to be representative of basic geological features such as salt domes. We also present a theoretical model to understand the performance of the pWFC algorithm. We evaluate the performance of the proposed parallel...

  13. Design and implementation of high speed parallel multipliers

    E-Print Network [OSTI]

    Kumar, Pazhanikrishna

    1992-01-01T23:59:59.000Z

    using Carry-Save Scheme A Canonical-Bit-Sequential Multiplier Dadda's Scheme for Parallel Multipliers Wallace's Scheme for Parallel Multipliers 10 12 15 Booth's Recoder Partial Product Mux: PPM Partial Product LSB MUX: PPL 25 Round... Plan for 16 x 16-bit Multiplier 47 FIGURE Page 20 Floor Plan for 32 x 32-bit Multiplier Booth's Recoder Cell 48 64 22 23 Partial Product Generator: PPM Cell Partial Product Generator: PPL Cell . 66 68 24 25 26 27 28 Round-Bit Generator...

  14. Parallel Transports in Webs

    E-Print Network [OSTI]

    Christian Fleischhack

    2003-07-17T23:59:59.000Z

    For connected reductive linear algebraic structure groups it is proven that every web is holonomically isolated. The possible tuples of parallel transports in a web form a Lie subgroup of the corresponding power of the structure group. This Lie subgroup is explicitly calculated and turns out to be independent of the chosen local trivializations. Moreover, explicit necessary and sufficient criteria for the holonomical independence of webs are derived. The results above can even be sharpened: Given an arbitrary neighbourhood of the base points of a web, then this neighbourhood contains some segments of the web whose parameter intervals coincide, but do not include 0 (that corresponds to the base points of the web), and whose parallel transports already form the same Lie subgroup as those of the full web do.

  15. Ultrascalable petaflop parallel supercomputer

    DOE Patents [OSTI]

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Chiu, George (Cross River, NY); Cipolla, Thomas M. (Katonah, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Hall, Shawn (Pleasantville, NY); Haring, Rudolf A. (Cortlandt Manor, NY); Heidelberger, Philip (Cortlandt Manor, NY); Kopcsay, Gerard V. (Yorktown Heights, NY); Ohmacht, Martin (Yorktown Heights, NY); Salapura, Valentina (Chappaqua, NY); Sugavanam, Krishnan (Mahopac, NY); Takken, Todd (Brewster, NY)

    2010-07-20T23:59:59.000Z

    A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

  16. Parallel clustering with CFinder

    E-Print Network [OSTI]

    Pollner, Peter; Vicsek, Tamas; 10.1142/S0129626412400014

    2012-01-01T23:59:59.000Z

    The amount of available data about complex systems is increasing every year, measurements of larger and larger systems are collected and recorded. A natural representation of such data is given by networks, whose size is following the size of the original system. The current trend of multiple cores in computing infrastructures call for a parallel reimplementation of earlier methods. Here we present the grid version of CFinder, which can locate overlapping communities in directed, weighted or undirected networks based on the clique percolation method (CPM). We show that the computation of the communities can be distributed among several CPU-s or computers. Although switching to the parallel version not necessarily leads to gain in computing time, it definitely makes the community structure of extremely large networks accessible.

  17. Parallel Job Scheduling and Workloads

    E-Print Network [OSTI]

    Segall, Adrian

    Parallel Job Scheduling and Workloads Dror Feitelson Hebrew University #12;Parallel Jobs A set On multicores: probably more dynamic #12;MPP Parallel Job Scheduling Each job is a rectangle in processorsXtime space Given many jobs, we must schedule them to run on available processors This is like packing

  18. Massively parallel neural computation

    E-Print Network [OSTI]

    Fox, Paul James

    2013-03-12T23:59:59.000Z

    work and includes nothing which is the outcome of work done in collaboration except where specifically indicated in the text. This dissertation does not exceed the regulation length of 60 000 words, including tables and footnotes. Massively Parallel... -flow pipeline (Thomas and Luk, 2009; Cas- sidy et al., 2011; Martinez-Alvarez et al., 2007; Rice et al., 2009). Mathematical neuron models are amenable to being converted to pipelines with many stages (Rice et al. use 23 stages for an Izhikevich neuron model...

  19. Xyce parallel electronic simulator.

    SciTech Connect (OSTI)

    Keiter, Eric Richard; Mei, Ting; Russo, Thomas V.; Rankin, Eric Lamont; Schiek, Richard Louis; Thornquist, Heidi K.; Fixel, Deborah A.; Coffey, Todd Stirling; Pawlowski, Roger Patrick; Santarelli, Keith R.

    2010-05-01T23:59:59.000Z

    This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users' Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users' Guide.

  20. Nuclear shell-model code for massive parallel computation, "KSHELL"

    E-Print Network [OSTI]

    Noritaka Shimizu

    2013-10-21T23:59:59.000Z

    A new code for nuclear shell-model calculations, "KSHELL", is developed. It aims at carrying out both massively parallel computation and single-node computation in the same manner. We solve the Schr\\"{o}dinger's equation in the $M$-scheme shell-model model space, utilizing Thick-Restart Lanczos method. During the Lanczos iteration, the whole Hamiltonian matrix elements are generated "on-the-fly" in every matrix-vector multiplication. The vectors of the Lanczos method are distributed and stored on memory of each parallel node. We report that the newly developed code has high parallel efficiency on FX10 supercomputer and a PC with multi-cores.

  1. Speculative Parallelization on Multicore Processors

    E-Print Network [OSTI]

    Tian, Chen

    2010-01-01T23:59:59.000Z

    and they include bayes, kmeans, labyrinth, vacation, andcenter update PVECTOR None kmeans labyrinth vacation yada I-parallel threads are bayes kmeans labyrinth vacation yada

  2. Global synchronization of parallel processors using clock pulse width modulation

    DOE Patents [OSTI]

    Chen, Dong; Ellavsky, Matthew R.; Franke, Ross L.; Gara, Alan; Gooding, Thomas M.; Haring, Rudolf A.; Jeanson, Mark J.; Kopcsay, Gerard V.; Liebsch, Thomas A.; Littrell, Daniel; Ohmacht, Martin; Reed, Don D.; Schenck, Brandon E.; Swetz, Richard A.

    2013-04-02T23:59:59.000Z

    A circuit generates a global clock signal with a pulse width modification to synchronize processors in a parallel computing system. The circuit may include a hardware module and a clock splitter. The hardware module may generate a clock signal and performs a pulse width modification on the clock signal. The pulse width modification changes a pulse width within a clock period in the clock signal. The clock splitter may distribute the pulse width modified clock signal to a plurality of processors in the parallel computing system.

  3. Small file aggregation in a parallel computing system

    DOE Patents [OSTI]

    Faibish, Sorin; Bent, John M.; Tzelnic, Percy; Grider, Gary; Zhang, Jingwang

    2014-09-02T23:59:59.000Z

    Techniques are provided for small file aggregation in a parallel computing system. An exemplary method for storing a plurality of files generated by a plurality of processes in a parallel computing system comprises aggregating the plurality of files into a single aggregated file; and generating metadata for the single aggregated file. The metadata comprises an offset and a length of each of the plurality of files in the single aggregated file. The metadata can be used to unpack one or more of the files from the single aggregated file.

  4. 8/30/2001 Parallel Programming -Fall 2001 1 Models of Parallel Computation

    E-Print Network [OSTI]

    Browne, James C.

    8/30/2001 Parallel Programming - Fall 2001 1 Models of Parallel Computation Philosophy Parallel of parallel programming. #12;8/30/2001 Parallel Programming - Fall 2001 2 Models of Parallel Computation will discuss parallelism from the viewpoint of programming but with connections to other domains. #12;8/30/2001

  5. An integrated approach to improving the parallel applications development process

    SciTech Connect (OSTI)

    Rasmussen, Craig E [Los Alamos National Laboratory; Watson, Gregory R [IBM; Tibbitts, Beth R [IBM

    2009-01-01T23:59:59.000Z

    The development of parallel applications is becoming increasingly important to a broad range of industries. Traditionally, parallel programming was a niche area that was primarily exploited by scientists trying to model extremely complicated physical phenomenon. It is becoming increasingly clear, however, that continued hardware performance improvements through clock scaling and feature-size reduction are simply not going to be achievable for much longer. The hardware vendor's approach to addressing this issue is to employ parallelism through multi-processor and multi-core technologies. While there is little doubt that this approach produces scaling improvements, there are still many significant hurdles to be overcome before parallelism can be employed as a general replacement to more traditional programming techniques. The Parallel Tools Platform (PTP) Project was created in 2005 in an attempt to provide developers with new tools aimed at addressing some of the parallel development issues. Since then, the introduction of a new generation of peta-scale and multi-core systems has highlighted the need for such a platform. In this paper, we describe some of the challenges facing parallel application developers, present the current state of PTP, and provide a simple case study that demonstrates how PTP can be used to locate a potential deadlock situation in an MPI code.

  6. An efficient parallel algorithm for matrix-vector multiplication

    SciTech Connect (OSTI)

    Hendrickson, B.; Leland, R.; Plimpton, S.

    1993-03-01T23:59:59.000Z

    The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/[radical]p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in the well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.

  7. Parallel execution model for Prolog

    SciTech Connect (OSTI)

    Fagin, B.S.

    1987-01-01T23:59:59.000Z

    One candidate language for parallel symbolic computing is Prolog. Numerous ways for executing Prolog in parallel have been proposed, but current efforts suffer from several deficiencies. Many cannot support fundamental types of concurrency in Prolog. Other models are of purely theoretical interest, ignoring implementation costs. Detailed simulation studies of execution models are scare; at present little is known about the costs and benefits of executing Prolog in parallel. In this thesis, a new parallel execution model for Prolog is presented: the PPP model or Parallel Prolog Processor. The PPP supports AND-parallelism, OR-parallelism, and intelligent backtracking. An implementation of the PPP is described, through the extension of an existing Prolog abstract machine architecture. Several examples of PPP execution are presented, and compilation to the PPP abstract instruction set is discussed. The performance effects of this model are reported, based on a simulation of a large benchmark set. The implications of these results for parallel Prolog systems are discussed, and directions for future work are indicated.

  8. Parallel Computing Daniel S. Priece

    E-Print Network [OSTI]

    performance on multiprocessor systems. This paper reviews the fundamentals of parallel computing with a focus. Today the most powerful computer is able to use 20 teraflops of processing power [1]. Rapid hardware execute in 8 hours could be executed on a parallel system of 8 processors in one hour greatly reducing

  9. Parallel contingency statistics with Titan.

    SciTech Connect (OSTI)

    Thompson, David C.; Pebay, Philippe Pierre

    2009-09-01T23:59:59.000Z

    This report summarizes existing statistical engines in VTK/Titan and presents the recently parallelized contingency statistics engine. It is a sequel to [PT08] and [BPRT09] which studied the parallel descriptive, correlative, multi-correlative, and principal component analysis engines. The ease of use of this new parallel engines is illustrated by the means of C++ code snippets. Furthermore, this report justifies the design of these engines with parallel scalability in mind; however, the very nature of contingency tables prevent this new engine from exhibiting optimal parallel speed-up as the aforementioned engines do. This report therefore discusses the design trade-offs we made and study performance with up to 200 processors.

  10. automatically generated anatomically: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    be assessed. We describe an approach to automatically generating questions for vocabulary assessment. Tra- ditionally Eskenazi, Maxine 133 Commodity Cluster-Based Parallel...

  11. Synthesis of Parallel Hardware Implementations from Synchronous Dataflow Graph Specifications

    E-Print Network [OSTI]

    of automated register­transfer level (RTL) VHDL code generation from synchronous dataflow (SDF) graph for mapping applications specified in SDF to parallel digital hardware implementations. Two styles synthesis from SDF graphs is presented. In order to minimize cost while meeting performance require­ ments

  12. Template based parallel checkpointing in a massively parallel computer system

    DOE Patents [OSTI]

    Archer, Charles Jens (Rochester, MN); Inglett, Todd Alan (Rochester, MN)

    2009-01-13T23:59:59.000Z

    A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.

  13. A Parallel Graph Partitioner for STAPL

    E-Print Network [OSTI]

    Castet, Nicolas

    2013-04-26T23:59:59.000Z

    high-level framework to develop parallel applications. One of the first steps of a parallel application is to partition and distribute the data throughout the system. An important data structure for parallel applications to store large amounts of data...

  14. Instrumentation for parallel magnetic resonance imaging

    E-Print Network [OSTI]

    Brown, David Gerald

    2007-04-25T23:59:59.000Z

    Parallel magnetic resonance (MR) imaging may be used to increase either the throughput or the speed of the MR imaging experiment. As such, parallel imaging may be accomplished either through a "parallelization" of the MR experiment, or by the use...

  15. Fig. 1. Single line diagram of 3-phase distribution power system with five inverters in parallel.

    E-Print Network [OSTI]

    Silva, Filipe Faria Da

    (PV) generation, it has been showed that occasionally the PV inverters were switched off undesirably or exceeded the harmonic regulations [2]. Even though each of the PV inverter meets the grid codes, the power distribution power system with five inverters in parallel. Harmonic Stability Assessment for Multi- Paralleled

  16. Using true concurrency to model execution of parallel programs

    SciTech Connect (OSTI)

    Ben-Asher, Y.; Farchi, E.

    1994-08-01T23:59:59.000Z

    Parallel execution of a program R (intuitively regarded as a partial order) is usually modeled by sequentially executing one of the total orders (interleavings) into which it can be embedded. Our work deviates from this serialization principle by using true concurrency to model parallel execution. True concurrency is represented via completions of R to semi total orders, called time diagrams. These orders are characterized via a set of conditions (denoted by Ct), yielding orders of time diagrams which preserve some degree of the intended parallelism in R. Another way to express semi total orders is to use re-writing or derivation rules (denoted by Cx) which for any program R generates a set of semi-total orders. This paper includes a classification of parallel execution into three classes according to three different types of Ct conditions. For each class a suitable Cx is found and a proof of equivalence between the set of all time diagrams satisfying Ct and the set of all terminal Cx derivations of R is devised. This equivalence between time diagram conditions and derivation rules is used to define a novel notion of correctness for parallel programs. This notion is demonstrated by showing that a specific asynchronous program enforces synchronous execution, which always halts, showing that true concurrency can be useful in the context of parallel program verification.

  17. Fast parallel algorithms for short-range molecular dynamics

    SciTech Connect (OSTI)

    Plimpton, S.

    1993-05-01T23:59:59.000Z

    Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a subset of atoms; the second assigns each a subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently -- those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 10,000,000 atoms on three parallel supercomputers, the nCUBE 2, Intel iPSC/860, and Intel Delta. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and the Intel Delta performs about 30 times faster than a single Y-MP processor and 12 times faster than a single C90 processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

  18. High-quality draft assemblies of mammalian genomes from massively parallel sequence data

    E-Print Network [OSTI]

    Gnerre, Sante

    Massively parallel DNA sequencing technologies are revolutionizing genomics by making it possible to generate billions of relatively short (~100-base) sequence reads at very low cost. Whereas such data can be readily used ...

  19. Endpoint-based parallel data processing in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael E; Ratterman, Joseph D; Smith, Brian E

    2014-02-11T23:59:59.000Z

    Endpoint-based parallel data processing in a parallel active messaging interface ('PAMI') of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective opeartion through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks.

  20. Endpoint-based parallel data processing in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-08-12T23:59:59.000Z

    Endpoint-based parallel data processing in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes coupled for data communications through the PAMI, including establishing a data communications geometry, the geometry specifying, for tasks representing processes of execution of the parallel application, a set of endpoints that are used in collective operations of the PAMI including a plurality of endpoints for one of the tasks; receiving in endpoints of the geometry an instruction for a collective operation; and executing the instruction for a collective operation through the endpoints in dependence upon the geometry, including dividing data communications operations among the plurality of endpoints for one of the tasks.

  1. Parallel computation of Steiner Minimal Trees

    SciTech Connect (OSTI)

    Harris, F.C. Jr. [Univ. of Nevada, Reno, NV (United States)

    1995-12-01T23:59:59.000Z

    Given a set of N cities, construct a connected network which has minimum length. The problem is simple enough, but the catch is that you are allowed to add junctions in your network. Therefore the problem becomes how many extra junctions should be added, and where should they be placed so as to minimize the overall network length. This intriguing optimization problem is known as the Steiner Minimal Tree Problem (SMT), where the junctions that are added to the network are called Steiner Points. The focus of this paper is the parallel computation for the generation of what Pawel Winter termed T-list and its implementation. This generation of T-list is followed by the extraction of the proper answer. When Winter developed his algorithm, the time for extraction dominated the overall computation time. After Cockayne and Hewgill`s work, the time to generate T-list dominated the overall computation time. The ideas we present were implemented in a program called PARSTEINER94, and the results show that the time to generate T-list has now been cut by an order of magnitude. So now the extraction time once again dominates the overall computation time.

  2. GRIDS: Grid-Scale Rampable Intermittent Dispatchable Storage

    SciTech Connect (OSTI)

    None

    2010-09-01T23:59:59.000Z

    GRIDS Project: The 12 projects that comprise ARPA-Es GRIDS Project, short for Grid-Scale Rampable Intermittent Dispatchable Storage, are developing storage technologies that can store renewable energy for use at any location on the grid at an investment cost less than $100 per kilowatt hour. Flexible, large-scale storage would create a stronger and more robust electric grid by enabling renewables to contribute to reliable power generation.

  3. Standard Templates Adaptive Parallel Library

    E-Print Network [OSTI]

    Arzu, Francisco Jose

    2000-01-01T23:59:59.000Z

    ]. STAPL &s v, nuen m a simple extension of the C++ hingu. & e f1. 4f which prov&dcs a SPMD motlel of' parallelism that maps easily onto distnbuted sharcd- memory sys&ems (e. g, HP V-class, SGI Power Challenge o& networks of workstations using Tread... () uses the schcduler to dispatch the per-processor segments of the container to the processors. Figure 2 show the relations between the STAPL components. 2. 2 Related %'ork 2. 2. 1 Parallel Standard Template I. ibrary The HPC+ i consortium h...

  4. Solid oxide fuel cell generator

    DOE Patents [OSTI]

    Di Croce, A. Michael (Murrysville, PA); Draper, Robert (Churchill Boro, PA)

    1993-11-02T23:59:59.000Z

    A solid oxide fuel cell generator has a plenum containing at least two rows of spaced apart, annular, axially elongated fuel cells. An electrical conductor extending between adjacent rows of fuel cells connects the fuel cells of one row in parallel with each other and in series with the fuel cells of the adjacent row.

  5. Solid oxide fuel cell generator

    DOE Patents [OSTI]

    Di Croce, A.M.; Draper, R.

    1993-11-02T23:59:59.000Z

    A solid oxide fuel cell generator has a plenum containing at least two rows of spaced apart, annular, axially elongated fuel cells. An electrical conductor extending between adjacent rows of fuel cells connects the fuel cells of one row in parallel with each other and in series with the fuel cells of the adjacent row. 5 figures.

  6. Coupled parallel waveguide semiconductor laser

    SciTech Connect (OSTI)

    Mukai, S.; Kapon, E.; Katz, J.; Lindsey, C.; Rav-Noy, Z.; Margalit, S.; Yariv, A.

    1984-03-01T23:59:59.000Z

    The operation of a new type of tunable laser, where the two separately controlled individual lasers are placed vertically in parallel, has been demonstrated. One of the cavities (''control'' cavity) is operated below threshold and assists the longitudinal mode selection and tuning of the other laser. With a minor modification, the same device can operate as an independent two-wavelength laser source.

  7. Tutorial: Parallel Simulation on Supercomputers

    SciTech Connect (OSTI)

    Perumalla, Kalyan S [ORNL

    2012-01-01T23:59:59.000Z

    This tutorial introduces typical hardware and software characteristics of extant and emerging supercomputing platforms, and presents issues and solutions in executing large-scale parallel discrete event simulation scenarios on such high performance computing systems. Covered topics include synchronization, model organization, example applications, and observed performance from illustrative large-scale runs.

  8. Solid state pulsed power generator

    DOE Patents [OSTI]

    Tao, Fengfeng; Saddoughi, Seyed Gholamali; Herbon, John Thomas

    2014-02-11T23:59:59.000Z

    A power generator includes one or more full bridge inverter modules coupled to a semiconductor opening switch (SOS) through an inductive resonant branch. Each module includes a plurality of switches that are switched in a fashion causing the one or more full bridge inverter modules to drive the semiconductor opening switch SOS through the resonant circuit to generate pulses to a load connected in parallel with the SOS.

  9. Feedback-optimized parallel tempering Monte Carlo

    E-Print Network [OSTI]

    Katzgraber, H G; Trebst, S; Huse, D A; Troyer, M

    2006-01-01T23:59:59.000Z

    brie?y discuss possible feedback schemes for systems that1742-5468/06/P03018+22$30.00 Feedback-optimized parallel5468/2006/03/P03018 Feedback-optimized parallel tempering

  10. Parallelism Constraints Katrin Erk Joachim Niehren

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Parallelism Constraints Katrin Erk Joachim Niehren Programming Systems Lab, Universit¨at des Saarlandes, Saarbr¨ucken, Germany www.ps.uni-sb.de/~{erk,niehren} Abstract. Parallelism constraints

  11. On-the-fly pipeline parallelism

    E-Print Network [OSTI]

    Lee, I-Ting Angelina

    Pipeline parallelism organizes a parallel program as a linear sequence of s stages. Each stage processes elements of a data stream, passing each processed data element to the next stage, and then taking on a new element ...

  12. Optimization Online - Efficient parallel coordinate descent algorithm ...

    E-Print Network [OSTI]

    Ion Necoara

    2012-11-02T23:59:59.000Z

    Nov 2, 2012 ... Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC.

  13. Optimization Online - A PARALLEL interior point decomposition ...

    E-Print Network [OSTI]

    Kartik Krishnan Sivaramakrishnan

    2006-12-04T23:59:59.000Z

    Dec 4, 2006 ... ... and decomposed and distributed subproblems (smaller SDPs) in a parallel and distributed high performance computing environment.

  14. Parallel Computing Research at Illinois The UPCRC Agenda

    E-Print Network [OSTI]

    @Illinois(www.parallel.illinois.edu)isthecollectiverepresentationofIllinois'currenteffortsin parallel computing research and education. These include: UniversalParallelComputingResearchCenter BlueWaters

  15. Hyper-Systolic Parallel Computing

    E-Print Network [OSTI]

    Th. Lippert; A. Seyfried; A. Bode; K. Schilling

    1995-07-25T23:59:59.000Z

    A new class of parallel algorithms is introduced that can achieve a complexity of O(n^3/2) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n^2). The amount of computation operations is not altered for the new algorithm which can be formulated as a kind of h-range problem, known from the mathematical field of Additive Number Theory. We will demonstrate the reduction in communicational expense by comparing the standard-systolic algorithm and the new algorithm on the connection machine CM5 and the CRAY T3D. The parallel method can be useful in various scientific and engineering fields like exact n-body dynamics with long range forces, polymer chains, protein folding or signal processing.

  16. Towards a CostEffective Parallel Data Mining Approach Zoltan Jarai, Aashu Virmani, Liviu Iftode

    E-Print Network [OSTI]

    Iftode, Liviu

    generation algorithm of the Discovery Board system, and present our design and implementation of a parallel: market basket analysis. This problem deals with generation of association rules when the data consists relational data, which can be persistently stored and later filtered using rulequeries. We attempt

  17. Nonlinear parameter estimation in parallel computing environments

    E-Print Network [OSTI]

    Li, Jie

    1996-01-01T23:59:59.000Z

    to solve these issues with respect to PEST. We then propose a hierarchical parallel control structure for PEST based on the manager-worker parallel programming model. We also discuss in detail the implementation of the parallel version of PEST in an Intel...

  18. Hybrid Parallel Part I. Preliminaries

    E-Print Network [OSTI]

    Kaminsky, Alan

    ;13­2 BIG CPU, BIG DATA he massively parallel Bitcoin mining program in Chapter 11 doesn't nec essarily take each Bitcoin sequentially on a single core, I have to mine 40 or more Bitcoins to take full advantage of the cluster. If I mine fewer than 40 Bitcoins, some of the cores will be idle. That's not good. I want to put

  19. System and method for representing and manipulating three-dimensional objects on massively parallel architectures

    DOE Patents [OSTI]

    Karasick, M.S.; Strip, D.R.

    1996-01-30T23:59:59.000Z

    A parallel computing system is described that comprises a plurality of uniquely labeled, parallel processors, each processor capable of modeling a three-dimensional object that includes a plurality of vertices, faces and edges. The system comprises a front-end processor for issuing a modeling command to the parallel processors, relating to a three-dimensional object. Each parallel processor, in response to the command and through the use of its own unique label, creates a directed-edge (d-edge) data structure that uniquely relates an edge of the three-dimensional object to one face of the object. Each d-edge data structure at least includes vertex descriptions of the edge and a description of the one face. As a result, each processor, in response to the modeling command, operates upon a small component of the model and generates results, in parallel with all other processors, without the need for processor-to-processor intercommunication. 8 figs.

  20. Parallel Repetition of Entangled Games

    E-Print Network [OSTI]

    Julia Kempe; Thomas Vidick

    2011-05-11T23:59:59.000Z

    We consider one-round games between a classical referee and two players. One of the main questions in this area is the parallel repetition question: Is there a way to decrease the maximum winning probability of a game without increasing the number of rounds or the number of players? Classically, efforts to resolve this question, open for many years, have culminated in Raz's celebrated parallel repetition theorem on one hand, and in efficient product testers for PCPs on the other. In the case where players share entanglement, the only previously known results are for special cases of games, and are based on techniques that seem inherently limited. Here we show for the first time that the maximum success probability of entangled games can be reduced through parallel repetition, provided it was not initially 1. Our proof is inspired by a seminal result of Feige and Kilian in the context of classical two-prover one-round interactive proofs. One of the main components in our proof is an orthogonalization lemma for operators, which might be of independent interest.

  1. Parallelization

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What's Possible for RenewableSpeedingBiomassPPPO WebsitePalms Village Resort B a

  2. A parallel execution model for Prolog

    SciTech Connect (OSTI)

    Fagin, B.

    1987-01-01T23:59:59.000Z

    In this thesis a new parallel execution model for Prolog is presented: The PPP model or Parallel Prolog Processor. The PPP supports AND-parallelism, OR- parallelism, and intelligent backtracking. An implementation of the PPP is described, through the extension of an existing Prolog abstract machine architecture. Several examples of PPP execution are presented and compilation to the PPP abstract instructions set is discussed. The performance effects of this model are reported, based on a simulation of a large benchmark set. The implications of these results for parallel Prolog systems are discussed, and directions for future work are indicated.

  3. Recharging U.S. Energy Policy: Advocating for a National Renewable Portfolio Standard

    E-Print Network [OSTI]

    Lunt, Robin J.

    2007-01-01T23:59:59.000Z

    $0.40/ kilowatt-hour, and wind power cost $0.60/ kilowatt-hour, then the marginal cost of wind power would be $. 0.20/subsidizes the marginal cost of wind power in the case of

  4. Recovery helps California company get ahead | Department of Energy

    Broader source: Energy.gov (indexed) [DOE]

    XeroCoat provides as much as a 5-percent increase in energy on a kilowatt-hour basis. A medium-sized air conditioner runs for about one hour on a kilowatt-hour of electricity,...

  5. Xyce parallel electronic simulator design.

    SciTech Connect (OSTI)

    Thornquist, Heidi K.; Rankin, Eric Lamont; Mei, Ting; Schiek, Richard Louis; Keiter, Eric Richard; Russo, Thomas V.

    2010-09-01T23:59:59.000Z

    This document is the Xyce Circuit Simulator developer guide. Xyce has been designed from the 'ground up' to be a SPICE-compatible, distributed memory parallel circuit simulator. While it is in many respects a research code, Xyce is intended to be a production simulator. As such, having software quality engineering (SQE) procedures in place to insure a high level of code quality and robustness are essential. Version control, issue tracking customer support, C++ style guildlines and the Xyce release process are all described. The Xyce Parallel Electronic Simulator has been under development at Sandia since 1999. Historically, Xyce has mostly been funded by ASC, the original focus of Xyce development has primarily been related to circuits for nuclear weapons. However, this has not been the only focus and it is expected that the project will diversify. Like many ASC projects, Xyce is a group development effort, which involves a number of researchers, engineers, scientists, mathmaticians and computer scientists. In addition to diversity of background, it is to be expected on long term projects for there to be a certain amount of staff turnover, as people move on to different projects. As a result, it is very important that the project maintain high software quality standards. The point of this document is to formally document a number of the software quality practices followed by the Xyce team in one place. Also, it is hoped that this document will be a good source of information for new developers.

  6. Buffered coscheduling for parallel programming and enhanced fault tolerance

    DOE Patents [OSTI]

    Petrini, Fabrizio (Los Alamos, NM); Feng, Wu-chun (Los Alamos, NM)

    2006-01-31T23:59:59.000Z

    A computer implemented method schedules processor jobs on a network of parallel machine processors or distributed system processors. Control information communications generated by each process performed by each processor during a defined time interval is accumulated in buffers, where adjacent time intervals are separated by strobe intervals for a global exchange of control information. A global exchange of the control information communications at the end of each defined time interval is performed during an intervening strobe interval so that each processor is informed by all of the other processors of the number of incoming jobs to be received by each processor in a subsequent time interval. The buffered coscheduling method of this invention also enhances the fault tolerance of a network of parallel machine processors or distributed system processors

  7. Final Report: Center for Programming Models for Scalable Parallel Computing

    SciTech Connect (OSTI)

    Mellor-Crummey, John [William Marsh Rice University] [William Marsh Rice University

    2011-09-13T23:59:59.000Z

    As part of the Center for Programming Models for Scalable Parallel Computing, Rice University collaborated with project partners in the design, development and deployment of language, compiler, and runtime support for parallel programming models to support application development for the leadership-class computer systems at DOE national laboratories. Work over the course of this project has focused on the design, implementation, and evaluation of a second-generation version of Coarray Fortran. Research and development efforts of the project have focused on the CAF 2.0 language, compiler, runtime system, and supporting infrastructure. This has involved working with the teams that provide infrastructure for CAF that we rely on, implementing new language and runtime features, producing an open source compiler that enabled us to evaluate our ideas, and evaluating our design and implementation through the use of benchmarks. The report details the research, development, findings, and conclusions from this work.

  8. Subcontract Report NREL/SR-7A2-48318

    E-Print Network [OSTI]

    Wh kilowatt-hour LED light emitting diode MECO Maui Electric Company MWh megawatt-hour NAECA National

  9. Optimization Online - Efficient Serial and Parallel Coordinate ...

    E-Print Network [OSTI]

    Peter Richtarik

    2011-08-02T23:59:59.000Z

    Aug 2, 2011 ... Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design. Peter Richtarik(peter.richtarik ***at***...

  10. Parallel Interval Continuous Global Optimization Algorithms

    E-Print Network [OSTI]

    abdeljalil benyoub

    2002-07-19T23:59:59.000Z

    Jul 19, 2002 ... Abstract: We theorically study, on a distributed memory architecture, the parallelization of Hansen's algorithm for the continuous global...

  11. Parallel auto-correlative statistics with VTK.

    SciTech Connect (OSTI)

    Pebay, Philippe Pierre [Kitware, France; Bennett, Janine Camille

    2013-08-01T23:59:59.000Z

    This report summarizes existing statistical engines in VTK and presents both the serial and parallel auto-correlative statistics engines. It is a sequel to [PT08, BPRT09b, PT09, BPT09, PT10] which studied the parallel descriptive, correlative, multi-correlative, principal component analysis, contingency, k-means, and order statistics engines. The ease of use of the new parallel auto-correlative statistics engine is illustrated by the means of C++ code snippets and algorithm verification is provided. This report justifies the design of the statistics engines with parallel scalability in mind, and provides scalability and speed-up analysis results for the autocorrelative statistics engine.

  12. Revisiting Parallel Algorithms for Block Tridiagonal Systems...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    variety of scientific and engineering applications, including oceanography, computer graphics, plasma physics, iterative solvers, and many more. Parallel solvers for such systems...

  13. A Parallel Inertial Proximal Optimization Method

    E-Print Network [OSTI]

    2011-07-01T23:59:59.000Z

    The Douglas-Rachford algorithm is a popular iterative method for finding a zero of a ... algorithm, parallel proximal algorithms are proposed to minimize over a...

  14. Joint electric power alternatives study. Appendix G. Joint parallel nuclear alternatives study for Russia. Final report

    SciTech Connect (OSTI)

    NONE

    1995-06-01T23:59:59.000Z

    The Joint Parallel Nuclear Alternatives Study for Russia (JPNAS) is a parallel study to the Joint Electric Power Alternatives Study (JEPAS). The JPNAS assessed the costs of enhancing the safety level of Russian nuclear power plants (NPPs), decommissioning of RBMK-1000 and first generation VVER-440 units, completion of NPP construction, NPP repowering into fossil fuel plants, and construction of new generation NPPs. In the framework of the JEPAS, the JPNAS provides data on the nuclear sector which is needed to formulate an integrated resources plan and schedule for investments for the development of Russia`s power sector.

  15. Natural Language Generation for the Semantic Web: Unsupervised template extraction

    E-Print Network [OSTI]

    Duma, Daniel

    2012-11-28T23:59:59.000Z

    I propose an architecture for a Natural Language Generation system that automatically learns sentence templates, together with statistical document planning, from parallel RDF data and text. To this end, I design, build and test a proof...

  16. Electrostatic generator/motor configurations

    DOE Patents [OSTI]

    Post, Richard F

    2014-02-04T23:59:59.000Z

    Electrostatic generators/motors designs are provided that generally may include a first cylindrical stator centered about a longitudinal axis; a second cylindrical stator centered about the axis, a first cylindrical rotor centered about the axis and located between the first cylindrical stator and the second cylindrical stator. The first cylindrical stator, the second cylindrical stator and the first cylindrical rotor may be concentrically aligned. A magnetic field having field lines about parallel with the longitudinal axis is provided.

  17. Generating Code for High-Level Operations through Code Composition

    E-Print Network [OSTI]

    Generating Code for High-Level Operations through Code Composition James M. Stichnoth August 1997 of the authors and should not be interpreted as necessarily representing the official policies or endorsements: Compilers, code generation, parallelism, communication generation #12;Abstract A traditional compiler

  18. Efficient Algorithms for Parallel Excitation and Parallel Imaging with Large Arrays

    E-Print Network [OSTI]

    Feng, Shuo

    2013-08-12T23:59:59.000Z

    RF signals using phased arrays are called parallel excitation (pTx) and parallel imaging (PI), respectively. These two techniques lead to shorter transmit pulses for higher imaging quality and faster data acquisition correspondingly...

  19. Parallel computing in enterprise modeling.

    SciTech Connect (OSTI)

    Goldsby, Michael E.; Armstrong, Robert C.; Shneider, Max S.; Vanderveen, Keith; Ray, Jaideep; Heath, Zach; Allan, Benjamin A.

    2008-08-01T23:59:59.000Z

    This report presents the results of our efforts to apply high-performance computing to entity-based simulations with a multi-use plugin for parallel computing. We use the term 'Entity-based simulation' to describe a class of simulation which includes both discrete event simulation and agent based simulation. What simulations of this class share, and what differs from more traditional models, is that the result sought is emergent from a large number of contributing entities. Logistic, economic and social simulations are members of this class where things or people are organized or self-organize to produce a solution. Entity-based problems never have an a priori ergodic principle that will greatly simplify calculations. Because the results of entity-based simulations can only be realized at scale, scalable computing is de rigueur for large problems. Having said that, the absence of a spatial organizing principal makes the decomposition of the problem onto processors problematic. In addition, practitioners in this domain commonly use the Java programming language which presents its own problems in a high-performance setting. The plugin we have developed, called the Parallel Particle Data Model, overcomes both of these obstacles and is now being used by two Sandia frameworks: the Decision Analysis Center, and the Seldon social simulation facility. While the ability to engage U.S.-sized problems is now available to the Decision Analysis Center, this plugin is central to the success of Seldon. Because Seldon relies on computationally intensive cognitive sub-models, this work is necessary to achieve the scale necessary for realistic results. With the recent upheavals in the financial markets, and the inscrutability of terrorist activity, this simulation domain will likely need a capability with ever greater fidelity. High-performance computing will play an important part in enabling that greater fidelity.

  20. 3: Parallelism in Microprocessors Course on "Scalable Computing". Vittorio Scarano 3: Parallelism in Microprocessors

    E-Print Network [OSTI]

    Scarano, Vittorio

    3: Parallelism in Microprocessors Course on "Scalable Computing". Vittorio Scarano 3: Parallelism in Microprocessors Seminars in Scalable Computing Vittorio Scarano Universit`a di Salerno Dottorato di Ricerca in Informatica 1/65 3: Parallelism in Microprocessors Course on "Scalable Computing". Vittorio Scarano Plan 1

  1. A New Approach to Parallel Program Development and Scheduling of Parallel Jobs on Distributed Systems

    E-Print Network [OSTI]

    of Technology Abstract A typical way to increase the performance of a parallel program on a given parallel an initial and time- consuming development phase. We propose an alter- native approach to program development of Energy through Los Alamos National Laboratory contract W-7405-ENG-36 parallel scheduling algorithms

  2. Cluster Parallel Loops Part I. Preliminaries

    E-Print Network [OSTI]

    Kaminsky, Alan

    ;14­2 BIG CPU, BIG DATA he massively parallel Bitcoin mining program in Chapter 13 still doesn't take full advantage of the cluster's parallel processing capabilities. Each Bitcoin mining task uses all the cores on just one node. So on the 10-node tardis cluster, I have to mine 10 or more Bitcoins to fully utilize

  3. ASYNPLEX, an asynchronous parallel revised simplex algorithm

    E-Print Network [OSTI]

    Hall, Julian

    ASYNPLEX, an asynchronous parallel revised simplex algorithm J.A.J. Hall K.I.M. McKinnon February, an asynchronous parallel revised simplex algorithm J. A. J. Hall K. I. M. McKinnon 27th February 1998 Abstract This paper describes ASYNPLEX, an asynchronous variant of the revised simplex method which is suitable

  4. Addendum to "Superconnections and Parallel Transport"

    E-Print Network [OSTI]

    Dumitrescu, Florin

    2011-01-01T23:59:59.000Z

    In this addendum to our article "Superconnections and Parallel Transport" we give an alternate construction to the parallel transport of a superconnection contained in Corollary 4.4 of \\cite{D1}, which has the advantage that is independent on the various ways a superconnection splits as a connection plus a bundle endomorphism valued form.

  5. ETH Zurich A Parallel Hybrid Particle

    E-Print Network [OSTI]

    Hiptmair, Ralf

    ] and POOMA (Parallel Object-Oriented Methods and Applications) [3] are designed to support a single execution model at a time and provide only MPI (Message Passing Interface) or shared mem- ory parallel programming compute powers and bandwidths are not taken into account which in turn can prevent good load balancing

  6. A Framework for Heterogeneous Desktop Parallel Computing

    E-Print Network [OSTI]

    Emmerich, Michael

    that automatically identify independent processes and their data flows inside an application. In this paper, we, painlessly transforms the simple desk- top computer into a computing powerhouse. 1 Introduction Until a few. This is the case of data-parallelism. Data-parallelism is relatively easy with already lots of research dedicated

  7. Massively Parallel Data Mining Using Reconfigurable Hardware

    E-Print Network [OSTI]

    Chamberlain, Roger

    ]. The basic idea is to decompose the data mining oper- ation into two components. The low-level componentMassively Parallel Data Mining Using Reconfigurable Hardware: Approximate String Matching Qiong. Chamberlain, Ronald S. Indeck, Benjamin West, and Jason White, "Massively Parallel Data Mining Using

  8. Evaluating parallel relational databases for medical data analysis.

    SciTech Connect (OSTI)

    Rintoul, Mark Daniel; Wilson, Andrew T.

    2012-03-01T23:59:59.000Z

    Hospitals have always generated and consumed large amounts of data concerning patients, treatment and outcomes. As computers and networks have permeated the hospital environment it has become feasible to collect and organize all of this data. This raises naturally the question of how to deal with the resulting mountain of information. In this report we detail a proof-of-concept test using two commercially available parallel database systems to analyze a set of real, de-identified medical records. We examine database scalability as data sizes increase as well as responsiveness under load from multiple users.

  9. Broadcasting a message in a parallel computer

    DOE Patents [OSTI]

    Berg, Jeremy E. (Rochester, MN); Faraj, Ahmad A. (Rochester, MN)

    2011-08-02T23:59:59.000Z

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

  10. On program restructuring, scheduling, and communication for parallel processor systems

    SciTech Connect (OSTI)

    Polychronopoulos, Constantine D.

    1986-08-01T23:59:59.000Z

    This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented. 69 refs., 74 figs., 14 tabs.

  11. Parallel Transport of Electrons in Graphene Parallels Gravity

    E-Print Network [OSTI]

    Andrej Mesaros; Darius Sadri; Jan Zaanen

    2009-09-15T23:59:59.000Z

    Geometrically a crystal containing dislocations and disclinations can be envisaged as a `fixed frame' Cartan--Einstein space-time carrying torsion and curvature, respectively. We demonstrate that electrons in defected graphene are transported in the same way as fundamental Dirac fermions in a non-trivial 2+1 dimensional space-time, with the proviso that the graphene electrons remember the lattice constant through the valley quantum numbers. The extra `valley holonomy' corresponds to modified Euclidean symmetry generators.

  12. Improved control strategy for parallel logic programming

    SciTech Connect (OSTI)

    Chung, I.J.

    1989-01-01T23:59:59.000Z

    The objective of this dissertation is to formulate an improved control strategy for parallel logic programming and to verify that the complexity of the parallel logic programs with this control strategy would be much less than the complexity of the other logic programs. The proposed control strategy is a combination of committed choice nondeterminism, and the data-flow model. The commit operator would be used for committed choice nondeterminism, and the primitives based on the dataflow model would be used to control AND-parallelism and OR-parallelism. With this proposed control strategy, the maximum useful parallelism can be explained with optimal granularity by controlling useless parallelism and limiting the branching factor. For justification of the proposed control strategy, it is suggested that the complexity of the computations of alternating Turing machines, which include a generalization of nondeterminism, can be used for the abstract cost function of logic programs. As justification of the proposed idea, the author bases a comparison of parallel logic programs on a model utilizing alternating Turing machines. The author shows that a natural reduction of the alternating Turing machine for the proposed control strategy yields a deterministic Turing machine whose complexity is linearly- related to that of the alternating Turing machine. However such a reduction for the conventional committed choice nondeterminism has complexity that is quadratically related to that of the alternating Turing machine.

  13. PMI: A Scalable Parallel Process-Management Interface for Extreme-Scale Systems

    E-Print Network [OSTI]

    Buntinas, Darius

    PMI: A Scalable Parallel Process-Management Interface for Extreme-Scale Systems Pavan Balaji1 derivatives achieve this functionality through a carefully defined interface, called PMI, that allows describe the features and capabilities of PMI. We describe both PMI-1, the cur- rent generation of PMI used

  14. Efficient Parallel Data Mining with the Apriori Algorithm on FPGAs1

    E-Print Network [OSTI]

    Hwang, Kai

    Efficient Parallel Data Mining with the Apriori Algorithm on FPGAs1 Zachary K. Baker and Viktor K scalable packaged units. We implement all data and computation intensive operations within the systolic" method for intelligently reporting unpredictably generated mid-array results to a controller without

  15. Xyce parallel electronic simulator : users' guide.

    SciTech Connect (OSTI)

    Mei, Ting; Rankin, Eric Lamont; Thornquist, Heidi K.; Santarelli, Keith R.; Fixel, Deborah A.; Coffey, Todd Stirling; Russo, Thomas V.; Schiek, Richard Louis; Warrender, Christina E.; Keiter, Eric Richard; Pawlowski, Roger Patrick

    2011-05-01T23:59:59.000Z

    This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: (1) Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers; (2) Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. (3) Device models which are specifically tailored to meet Sandia's needs, including some radiation-aware devices (for Sandia users only); and (4) Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an 'in-house' capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory.

  16. Fuel dissipater for pressurized fuel cell generators

    DOE Patents [OSTI]

    Basel, Richard A.; King, John E.

    2003-11-04T23:59:59.000Z

    An apparatus and method are disclosed for eliminating the chemical energy of fuel remaining in a pressurized fuel cell generator (10) when the electrical power output of the fuel cell generator is terminated during transient operation, such as a shutdown; where, two electrically resistive elements (two of 28, 53, 54, 55) at least one of which is connected in parallel, in association with contactors (26, 57, 58, 59), a multi-point settable sensor relay (23) and a circuit breaker (24), are automatically connected across the fuel cell generator terminals (21, 22) at two or more contact points, in order to draw current, thereby depleting the fuel inventory in the generator.

  17. Super Marx Generator for Thermonuclear Ignition

    E-Print Network [OSTI]

    Winterberg, Friedwardt

    2008-01-01T23:59:59.000Z

    In ongoing electric pulse power driven inertial confinement fusion experiments, Marx generators are connected in parallel with the target in the center of a ring of the Marx generators. There the currents, not the voltages add up. Instead of connecting a bank of Marx generator in parallel, one may connect them in series, adding up their voltages, not the currents. If, for example, fifty 20 MV Marx generators are connected in series, they would add up to a gigavolt. But to prevent breakdown, the adding up of the voltages in such a super-Marx generator must be fast. For this reason, it is proposed that each of the Marx generators charges up a fast discharge capacitor, with the thusly charged fast capacitors becoming the elements of a second stage super Marx generator. In a super Marx generator, the Marx generators also assume the role of the resistors in the original Marx circuit. With a voltage of 10^9 Volt and a discharge current of 10^7 Ampere, the generation of a 10^16 Watt GeV proton beam becomes possible,...

  18. Distributed parallel messaging for multiprocessor systems

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Salapura, Valentina; Senger, Robert M; Steinmacher-Burrow, Burhard; Sugawara, Yutaka

    2013-06-04T23:59:59.000Z

    A method and apparatus for distributed parallel messaging in a parallel computing system. The apparatus includes, at each node of a multiprocessor network, multiple injection messaging engine units and reception messaging engine units, each implementing a DMA engine and each supporting both multiple packet injection into and multiple reception from a network, in parallel. The reception side of the messaging unit (MU) includes a switch interface enabling writing of data of a packet received from the network to the memory system. The transmission side of the messaging unit, includes switch interface for reading from the memory system when injecting packets into the network.

  19. Parallel path aspects of transmission modeling

    SciTech Connect (OSTI)

    Kavicky, J.A. [Argonne National Lab., IL (United States); Shahidehpour, S.M. [Illinois Inst. of Tech., Chicago, IL (United States). Dept. of Electrical and Computer Engineering

    1996-11-01T23:59:59.000Z

    This paper examines the present methods and modeling techniques available to address the effects of parallel flows resulting from various firm and short-term energy transactions. A survey of significant methodologies is conducted to determine the present status of parallel flow transaction modeling. The strengths and weaknesses of these approaches are identified to suggest areas of further modeling improvements. The motivating force behind this research is to improve transfer capability assessment accuracy by suggesting a real-time modeling environment that adequately represents the influences of parallel flows while recognizing operational constraints and objectives.

  20. Parallel phase-sensitive three-dimensional imaging camera

    DOE Patents [OSTI]

    Smithpeter, Colin L. (Albuquerque, NM); Hoover, Eddie R. (Sandia Park, NM); Pain, Bedabrata (Los Angeles, CA); Hancock, Bruce R. (Altadena, CA); Nellums, Robert O. (Albuquerque, NM)

    2007-09-25T23:59:59.000Z

    An apparatus is disclosed for generating a three-dimensional (3-D) image of a scene illuminated by a pulsed light source (e.g. a laser or light-emitting diode). The apparatus, referred to as a phase-sensitive 3-D imaging camera utilizes a two-dimensional (2-D) array of photodetectors to receive light that is reflected or scattered from the scene and processes an electrical output signal from each photodetector in the 2-D array in parallel using multiple modulators, each having inputs of the photodetector output signal and a reference signal, with the reference signal provided to each modulator having a different phase delay. The output from each modulator is provided to a computational unit which can be used to generate intensity and range information for use in generating a 3-D image of the scene. The 3-D camera is capable of generating a 3-D image using a single pulse of light, or alternately can be used to generate subsequent 3-D images with each additional pulse of light.

  1. Parallel Implementation of Gamma-Point Pseudopotential Plane...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Parallel Implementation of Gamma-Point Pseudopotential Plane-Wave DFT with Exact Exchange. Parallel Implementation of Gamma-Point Pseudopotential Plane-Wave DFT with Exact...

  2. Chassis Dynamometer Testing of Parallel and Series Diesel Hybrid...

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Chassis Dynamometer Testing of Parallel and Series Diesel Hybrid Buses Chassis Dynamometer Testing of Parallel and Series Diesel Hybrid Buses Emissions and fuel economy data were...

  3. An efficient parallelization scheme for molecular dynamics simulations...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    efficient parallelization scheme for molecular dynamics simulations with many-body, flexible, polarizable empirical An efficient parallelization scheme for molecular dynamics...

  4. Architecture, implementation and parallelization of the software to search for periodic gravitational wave signals

    E-Print Network [OSTI]

    Gevorg Poghosyan; Sanchit Matta; Achim Streit; Micha? Bejger; Andrzej Krlak

    2014-10-14T23:59:59.000Z

    The parallelization, design and scalability of the \\sky code to search for periodic gravitational waves from rotating neutron stars is discussed. The code is based on an efficient implementation of the F-statistic using the Fast Fourier Transform algorithm. To perform an analysis of data from the advanced LIGO and Virgo gravitational wave detectors' network, which will start operating in 2015, hundreds of millions of CPU hours will be required - the code utilizing the potential of massively parallel supercomputers is therefore mandatory. We have parallelized the code using the Message Passing Interface standard, implemented a mechanism for combining the searches at different sky-positions and frequency bands into one extremely scalable program. The parallel I/O interface is used to escape bottlenecks, when writing the generated data into file system. This allowed to develop a highly scalable computation code, which would enable the data analysis at large scales on acceptable time scales. Benchmarking of the code on a Cray XE6 system was performed to show efficiency of our parallelization concept and to demonstrate scaling up to 50 thousand cores in parallel.

  5. Center for Programming Models for Scalable Parallel Computing: Future Programming Models

    SciTech Connect (OSTI)

    Gao, Guang, R.

    2008-07-24T23:59:59.000Z

    The mission of the pmodel center project is to develop software technology to support scalable parallel programming models for terascale systems. The goal of the specific UD subproject is in the context developing an efficient and robust methodology and tools for HPC programming. More specifically, the focus is on developing new programming models which facilitate programmers in porting their application onto parallel high performance computing systems. During the course of the research in the past 5 years, the landscape of microprocessor chip architecture has witnessed a fundamental change the emergence of multi-core/many-core chip architecture appear to become the mainstream technology and will have a major impact to for future generation parallel machines. The programming model for shared-address space machines is becoming critical to such multi-core architectures. Our research highlight is the in-depth study of proposed fine-grain parallelism/multithreading support on such future generation multi-core architectures. Our research has demonstrated the significant impact such fine-grain multithreading model can have on the productivity of parallel programming models and their efficient implementation.

  6. Parallel programming with PCN. Revision 1

    SciTech Connect (OSTI)

    Foster, I.; Tuecke, S.

    1991-12-01T23:59:59.000Z

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. In includes both tutorial and reference material. It also presents the basic concepts that underly PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous FTP from Argonne National Laboratory in the directory pub/pcn at info.mcs.anl.gov (c.f. Appendix A).

  7. Constraint Satisfaction Via Partially Parallel Propagation Steps

    E-Print Network [OSTI]

    Walter Hower Institut; Walter Hower

    1992-01-01T23:59:59.000Z

    to variables according to existing constraints. Given n variables with n-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0

  8. Parallel magnetic resonance imaging: characterization and comparison

    E-Print Network [OSTI]

    Rane, Swati Dnyandeo

    2005-11-01T23:59:59.000Z

    [Sodickson, 1997], GRAPPA [Griswold, 2002] and SPACE RIP [Kyriakos, 2000]; developed in the past decade have been studied, simulated and compared in this research. Because of the dependence of the parallel imaging methods on numerous factors such as receiver...

  9. Speculative Parallelization of Sequential Loops on Multicores

    E-Print Network [OSTI]

    Tian, Chen; Feng, Min; Nagarajan, Vijay; Gupta, Rajiv

    2009-01-01T23:59:59.000Z

    le Bayes Simulator input Kmeans n2048-d16-c16 Labyrinth x32-and they include bayes, kmeans, Int J Parallel Prog (2009)535 Execution Speedup bayes kmeans labyrinth vacation yada

  10. Optimization Online - An inexact parallel splitting augmented ...

    E-Print Network [OSTI]

    Zheng Peng

    2009-06-05T23:59:59.000Z

    Jun 5, 2009 ... Abstract: Parallel iterative methods are power tool for solving large system of ... results are all most concentred to sparse system or others particular structure, and ... SOR, and AOR methods eciently on multiprcessor systems.

  11. CS 525: Parallel Computing Spring 2001

    E-Print Network [OSTI]

    Grama, Ananth

    by ping-ponging a message a large number of times and using it to estimate round-trip time and from it through the parallelization strategy carefully before implementing it! Document your results clearly

  12. Parallel Algorithms for Big Data Optimization

    E-Print Network [OSTI]

    2014-02-21T23:59:59.000Z

    Index TermsParallel optimization, Distributed methods, Ja- cobi method ... Usually the nonsmooth term is used to ..... dard Armijo-like line-search procedure or a (suitably small) constant ..... enter the identification phase xk i is not zero, the

  13. A Parallel Graph Partitioner for STAPL

    E-Print Network [OSTI]

    Castet, Nicolas

    2013-04-26T23:59:59.000Z

    Multi-core architectures are present throughout a large selection of computing devices from cell phones to super-computers. Parallel applications running on these devices solve bigger problems in a shorter time. Writing those applications is a...

  14. Honeywell/Capstone Parallel Stand-alone Tests Honeywell/Capstone Parallel Tests

    E-Print Network [OSTI]

    Appendix H Honeywell/Capstone Parallel Stand-alone Tests 6/20/2001 #12;Honeywell/Capstone Parallel3 (VAR) Honeywell power Capstone Derived Power Figure H-1: Ramp Up Load Bank Power and Start Grid and Shaft Speed #12;Honeywell/Capstone Parallel Tests 6/20/2001 -10,000 0 10,000 20,000 30,000 40,000 50

  15. Thermoelectric Generators 1. Thermoelectric generator

    E-Print Network [OSTI]

    Lee, Ho Sung

    1 Thermoelectric Generators HoSung Lee 1. Thermoelectric generator 1.1 Basic Equations In 1821 effects are called the thermoelectric effects. The mechanisms of thermoelectricity were not understood. Cold Hot I - -- - - - - -- Figure 1 Electron concentration in a thermoelectric material. #12;2 A large

  16. Machine Learning Based Online Performance Prediction for Runtime Parallelization and Task Scheduling

    SciTech Connect (OSTI)

    Li, J; Ma, X; Singh, K; Schulz, M; de Supinski, B R; McKee, S A

    2008-10-09T23:59:59.000Z

    With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as well as developing next-generation software requires assistance from hardware, compilers and runtime systems to exploit parallelism transparently within applications. These systems must decompose applications into tasks that can be executed in parallel and then schedule those tasks to minimize load imbalance. However, many systems lack a priori knowledge about the execution time of all tasks to perform effective load balancing with low scheduling overhead. In this paper, we approach this fundamental problem using machine learning techniques first to generate performance models for all tasks and then applying those models to perform automatic performance prediction across program executions. We also extend an existing scheduling algorithm to use generated task cost estimates for online task partitioning and scheduling. We implement the above techniques in the pR framework, which transparently parallelizes scripts in the popular R language, and evaluate their performance and overhead with both a real-world application and a large number of synthetic representative test scripts. Our experimental results show that our proposed approach significantly improves task partitioning and scheduling, with maximum improvements of 21.8%, 40.3% and 22.1% and average improvements of 15.9%, 16.9% and 4.2% for LMM (a real R application) and synthetic test cases with independent and dependent tasks, respectively.

  17. Trinomialtree based parallel option price Alexandros V. Gerbessiotis

    E-Print Network [OSTI]

    Gerbessiotis, Alexandros V.

    can be performed in parallel. We introduce a method in performing these valuations in parallelTrinomialtree based parallel option price valuations Alexandros V. Gerbessiotis Department; Trinomialtree based parallel option price valuations Alexandros V. Gerbessiotis CS Department New Jersey

  18. Parallel Computer Technology -A Solution for Automobiles? How car engineers can learn from parallel computing

    E-Print Network [OSTI]

    Zachmann, Gabriel

    Parallel Computer Technology - A Solution for Automobiles? How car engineers can learn from be improved by the adoption of well known parallel computing technologies. II. HISTORY OF CAR ELECTRONICS electronics in the past. The following Table I shows the history of the car- electronics since 1950 in note

  19. Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues

    E-Print Network [OSTI]

    Billey, Sara

    Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues Vaughan R on edge f closest to vertex v (thereby displacing the previous closest to v on f, if any, and possibly at Stanford; by the IBM T.J.Watson Research Center, Yorktown Heights, N.Y.; and by Project MAC, an MIT

  20. Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications

    E-Print Network [OSTI]

    Seinstra, Frank J.

    performance image processing applications is often sub-optimal. This is be- cause inter-operation optimization performance optimization to each library operation in isolation, and ignore global opti- mization for fullLazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image

  1. MPMM: A Massively Parallel Mesoscale Model

    SciTech Connect (OSTI)

    Foster, I.; Michalakes, J.

    1992-12-31T23:59:59.000Z

    Static domain decomposition is a technique that provides a quick path to porting atmospheric models on distributed memory parallel computers. However, parallel inefficiencies in the form of load imbalances and ill-tuned communication are difficult to correct without complicated and explicit recoding. Reconfiguring the code to run on larger or smaller numbers of processors may require recompiling. Modularity and machine independence may also suffer. If full advantage is to be taken of Massively Parallel Processing (MPP) technology, tools and techniques that allow for dynamic performance tuning and reconfiguration are required. Program Composition Notation (PCN) is a language and run-time system for expressing parallel programs developed at Argonne and at the California Institute of Technology. It provides an intermediate layer between the application program and the physical processors of a computer. It allows the model to be statically decomposed over a virtual machine, but this virtual machine can be mapped and remapped dynamically over the physical computer. Programs are portable to as many machines as PCN itself, modularity is easily preserved, and communication tuning for a particular computer is encapsulated within the PCN run-time system. In this paper we report on a project at Argonne National Laboratory to parallelize the Penn State/NCAR Mesoscale Model version 5 using a fine grain decomposition dynamically mapped and managed under PCN.

  2. 18.337J / 6.338J Applied Parallel Computing (SMA 5505), Spring 2005

    E-Print Network [OSTI]

    Edelman, Alan

    Applied Parallel Computing is an advanced interdisciplinary introduction to applied parallel computing on modern supercomputers.

  3. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2013-11-12T23:59:59.000Z

    Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer composed of compute nodes that execute a parallel application, each compute node including application processors that execute the parallel application and at least one management processor dedicated to gathering information regarding data communications. The PAMI is composed of data communications endpoints, each endpoint composed of a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources. Embodiments function by gathering call site statistics describing data communications resulting from execution of data communications instructions and identifying in dependence upon the call cite statistics a data communications algorithm for use in executing a data communications instruction at a call site in the parallel application.

  4. Wind energy as a significant source of electricity for the United States

    SciTech Connect (OSTI)

    Nix, R.G.

    1996-06-01T23:59:59.000Z

    This paper discusses wind energy and its potential to significantly impact the generation of electricity within the US. The principles and the equipment used to convert wind energy to electricity are described, as is the status of current technology. Markets and production projections are given. There is discussion of the advances required to reduce the selling cost of electricity generated from the wind from today`s price of about $0.05 per kilowatt-hour to full cost-competitiveness with gas- and coal-based electricity.

  5. Storing files in a parallel computing system based on user-specified parser function

    DOE Patents [OSTI]

    Faibish, Sorin; Bent, John M; Tzelnic, Percy; Grider, Gary; Manzanares, Adam; Torres, Aaron

    2014-10-21T23:59:59.000Z

    Techniques are provided for storing files in a parallel computing system based on a user-specified parser function. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a parser from the distributed application for processing the plurality of files prior to storage; and storing one or more of the plurality of files in one or more storage nodes of the parallel computing system based on the processing by the parser. The plurality of files comprise one or more of a plurality of complete files and a plurality of sub-files. The parser can optionally store only those files that satisfy one or more semantic requirements of the parser. The parser can also extract metadata from one or more of the files and the extracted metadata can be stored with one or more of the plurality of files and used for searching for files.

  6. A mirror for lab-based quasi-monochromatic parallel x-rays

    SciTech Connect (OSTI)

    Nguyen, Thanhhai; Lu, Xun; Lee, Chang Jun; Jeon, Insu, E-mail: i-jeon@chonnam.ac.kr [School of Mechanical Engineering, Chonnam National University, 300 Yongbong-dong, Buk-gu, Gwangju 500-757 (Korea, Republic of); Jung, Jin-Ho [Pro-optics Co., Ltd., 475 Ami-ri, Bubal-eup, Icheon 467-866 (Korea, Republic of); Jin, Gye-Hwan [Department of Radiology, Nambu University, 76 Chumdan Jungang 1-ro, Gwangsan-gu, Gwangju 506-706 (Korea, Republic of); Kim, Sung Youb [School of Mechanical and Advanced Materials Engineering, Ulsan National Institute of Science and Technology, 100 Banyeon-ri, Eonyang-eup, Ulju-gun, Ulsan 689-798 (Korea, Republic of)

    2014-09-15T23:59:59.000Z

    A multilayered parabolic mirror with six W/Al bilayers was designed and fabricated to generate monochromatic parallel x-rays using a lab-based x-ray source. Using this mirror, curved bright bands were obtained in x-ray images as reflected x-rays. The parallelism of the reflected x-rays was investigated using the shape of the bands. The intensity and monochromatic characteristics of the reflected x-rays were evaluated through measurements of the x-ray spectra in the band. High intensity, nearly monochromatic, and parallel x-rays, which can be used for high resolution x-ray microscopes and local radiation therapy systems, were obtained.

  7. Simulating Billion-Task Parallel Programs

    SciTech Connect (OSTI)

    Perumalla, Kalyan S [ORNL] [ORNL; Park, Alfred J [ORNL] [ORNL

    2014-01-01T23:59:59.000Z

    In simulating large parallel systems, bottom-up approaches exercise detailed hardware models with effects from simplified software models or traces, whereas top-down approaches evaluate the timing and functionality of detailed software models over coarse hardware models. Here, we focus on the top-down approach and significantly advance the scale of the simulated parallel programs. Via the direct execution technique combined with parallel discrete event simulation, we stretch the limits of the top-down approach by simulating message passing interface (MPI) programs with millions of tasks. Using a timing-validated benchmark application, a proof-of-concept scaling level is achieved to over 0.22 billion virtual MPI processes on 216,000 cores of a Cray XT5 supercomputer, representing one of the largest direct execution simulations to date, combined with a multiplexing ratio of 1024 simulated tasks per real task.

  8. Java Parallel Secure Stream for Grid Computing

    SciTech Connect (OSTI)

    Chen, Jie; Akers, Walter; Chen, Ying; Watson, William

    2001-09-01T23:59:59.000Z

    The emergence of high speed wide area networks makes grid computing a reality. However grid applications that need reliable data transfer still have difficulties to achieve optimal TCP performance due to network tuning of TCP window size to improve the bandwidth and to reduce latency on a high speed wide area network. This paper presents a pure Java package called JPARSS (Java Par-allel Secure Stream) that divides data into partitions that are sent over several parallel Java streams simultaneously and allows Java or Web applications to achieve optimal TCP performance in a gird environment without the necessity of tuning the TCP window size. Several experimental results are provided to show that using parallel stream is more effective than tuning TCP window size. In addi-tion X.509 certificate based single sign-on mechanism and SSL based connection establishment are integrated into this package. Finally a few applications using this package will be discussed.

  9. Parallel hybrid textures of lepton mass matrices

    E-Print Network [OSTI]

    S. Dev; Shivani Gupta; Radha Raman Gautam

    2010-09-28T23:59:59.000Z

    We analyse the parallel hybrid texture structures in the charged lepton and the neutrino sector. These parallel hybrid texture structures have physical implications as they cannot be obtained from arbitrary lepton mass matrices through weak basis transformations. The total sixty parallel hybrid texture structures can be grouped into twelve classes, and all the hybrid textures in the same class have identical physical implications. We examine all the twelve classes under the assumption of non-factorizable phases in the neutrino mass matrix. Five out of the total twelve classes are found to be phenomenologically disallowed. We study the phenomenological implications of the allowed classes for 1-3 mixing angle, Majorana and Dirac-type $CP$ violating phases. Interesting constraints on effective Majorana mass are obtained for all the allowed classes.

  10. Parallel hybrid textures of lepton mass matrices

    SciTech Connect (OSTI)

    Dev, S.; Gupta, Shivani; Gautam, Radha Raman [Department of Physics, Himachal Pradesh University, Shimla 171005 (India)

    2010-10-01T23:59:59.000Z

    We analyze the parallel hybrid texture structures in the charged lepton and the neutrino sector. These parallel hybrid texture structures have physical implications as they cannot be obtained from arbitrary lepton mass matrices through weak basis transformations. The total 60 parallel hybrid texture structures can be grouped into 12 classes, and all the hybrid textures in the same class have identical physical implications. We examine all 12 classes under the assumption of nonfactorizable phases in the neutrino mass matrix. Five out of the total 12 classes are found to be phenomenologically disallowed. We study the phenomenological implications of the allowed classes for 1-3 mixing angle, Majorana and Dirac-type CP violating phases. Interesting constraints on effective Majorana mass are obtained for all the allowed classes.

  11. Parallel hybrid textures of lepton mass matrices

    E-Print Network [OSTI]

    Dev, S; Gautam, Radha Raman

    2010-01-01T23:59:59.000Z

    We analyse the parallel hybrid texture structures in the charged lepton and the neutrino sector. These parallel hybrid texture structures have physical implications as they cannot be obtained from arbitrary lepton mass matrices through weak basis transformations. The total sixty parallel hybrid texture structures can be grouped into twelve classes, and all the hybrid textures in the same class have identical physical implications. We examine all the twelve classes under the assumption of non-factorizable phases in the neutrino mass matrix. Five out of the total twelve classes are found to be phenomenologically disallowed. We study the phenomenological implications of the allowed classes for 1-3 mixing angle, Majorana and Dirac-type $CP$ violating phases. Interesting constraints on effective Majorana mass are obtained for all the allowed classes.

  12. GPU-ABiSort: Optimal parallel sorting on stream architectures

    E-Print Network [OSTI]

    Alexander Gre; Gabriel Zachmann

    2006-01-01T23:59:59.000Z

    In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p stream processor units, this approach achieves the optimal time complexity O((n log n)/p). While this makes our approach competitive with common sequential sorting algorithms not only from a theoretical viewpoint, it is also very fast from a practical viewpoint. This is achieved by using efficient linear stream memory accesses and by combining the optimal time approach with algorithms optimized for small input sequences. We present an implementation on modern programmable graphics hardware (GPUs). On recent GPUs, our optimal parallel sorting approach has shown to be remarkably faster than sequential sorting on the CPU, and it is also faster than previous non-optimal sorting approaches on the GPU for sufficiently large input sequences. Because of the excellent scalability of our algorithm with the number of stream processor units p (up to n / log 2 n or even n / log n units, depending on the stream architecture), our approach profits heavily from the trend of increasing number of fragment processor units on GPUs, so that we can expect further speed improvement with upcoming GPU generations.

  13. Xyce parallel electronic simulator release notes.

    SciTech Connect (OSTI)

    Keiter, Eric Richard; Hoekstra, Robert John; Mei, Ting; Russo, Thomas V.; Schiek, Richard Louis; Thornquist, Heidi K.; Rankin, Eric Lamont; Coffey, Todd Stirling; Pawlowski, Roger Patrick; Santarelli, Keith R.

    2010-05-01T23:59:59.000Z

    The Xyce Parallel Electronic Simulator has been written to support, in a rigorous manner, the simulation needs of the Sandia National Laboratories electrical designers. Specific requirements include, among others, the ability to solve extremely large circuit problems by supporting large-scale parallel computing platforms, improved numerical performance and object-oriented code design and implementation. The Xyce release notes describe: Hardware and software requirements New features and enhancements Any defects fixed since the last release Current known defects and defect workarounds For up-to-date information not available at the time these notes were produced, please visit the Xyce web page at http://www.cs.sandia.gov/xyce.

  14. Parallel processor-based raster graphics system architecture

    DOE Patents [OSTI]

    Littlefield, Richard J. (Seattle, WA)

    1990-01-01T23:59:59.000Z

    An apparatus for generating raster graphics images from the graphics command stream includes a plurality of graphics processors connected in parallel, each adapted to receive any part of the graphics command stream for processing the command stream part into pixel data. The apparatus also includes a frame buffer for mapping the pixel data to pixel locations and an interconnection network for interconnecting the graphics processors to the frame buffer. Through the interconnection network, each graphics processor may access any part of the frame buffer concurrently with another graphics processor accessing any other part of the frame buffer. The plurality of graphics processors can thereby transmit concurrently pixel data to pixel locations in the frame buffer.

  15. Effecting Parallel Graph Eigensolvers Through Library Composition

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    is not possible in general. Conventional linear algebra libraries cannot operate on graph data types. Likewise exploitation of this duality. Graph libraries and matrix libraries use different data types, and despiteEffecting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottschling

  16. Message passing with parallel queue traversal

    DOE Patents [OSTI]

    Underwood, Keith D. (Albuquerque, NM); Brightwell, Ronald B. (Albuquerque, NM); Hemmert, K. Scott (Albuquerque, NM)

    2012-05-01T23:59:59.000Z

    In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.

  17. Parallel programming with PCN. Revision 2

    SciTech Connect (OSTI)

    Foster, I.; Tuecke, S.

    1993-01-01T23:59:59.000Z

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and Cthat allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous ftp from Argonne National Laboratory in the directory pub/pcn at info.mcs. ani.gov (cf. Appendix A). This version of this document describes PCN version 2.0, a major revision of the PCN programming system. It supersedes earlier versions of this report.

  18. Parallel Implementation of multipole-based

    E-Print Network [OSTI]

    California at Berkeley, University of

    Parallel Implementation of multipole-based Poisson-Boltzmann solver Eng Hui Yap CS 267 Project May sphere ki: 1. Calculate surface charge multipole Snm (i) Express in and out in terms of multipoles (ii. Repeat for all spheres until convergence criteria is reached Solving LPBE with Multipole Method

  19. (Parallel Linear Algebra Package) Jess Cmara Moreno

    E-Print Network [OSTI]

    Giménez, Domingo

    álgebra lineal (Linear Algebra Objects). También permite la utilización de vistas (objetos referenciadosPLAPACK (Parallel Linear Algebra Package) Jesús Cámara Moreno Programación Paralela y Computación Reducción de Vectores Inicialización de PLAPACK. Funciones. Templates. Funciones. Linear Algebra Objects

  20. The Compressor: Concurrent, Incremental, and Parallel Compaction

    E-Print Network [OSTI]

    Petrank, Erez

    The Compressor: Concurrent, Incremental, and Parallel Compaction Haim Kermany Erez Petrank Dept non-intrusive compactor is still missing. In this paper we present the Compressor, a novel compaction, thereby allowing acceptable runs on large heaps. Furthermore, the Compressor is the first compactor

  1. PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND

    E-Print Network [OSTI]

    Bader, David A.

    Chapter 5 PARALLEL ALGORITHM DESIGN FOR BRANCH AND BOUND David A. Bader Department of Electrical & Computer Engineering, University of New Mexico dbader@ece.unm.edu William E. Hart Discrete Mathematics communication net- work enables synchronous inter-processor communication. Grid com- pute platforms exemplify

  2. A parallel scaled conjugate-gradient

    E-Print Network [OSTI]

    Aykanat, Cevdet

    . The scaled conjugate- gradient method is a powerful technique for solving large sparse linear systems for form-factor computation. Key words: Gathering radiosity -- Scaled conjugate-gradient method -- Parallel, the Gauss--Jacobi (GJ) method is used in the solution phase. The scaled conjugate-gradient (SCG) method

  3. Automatic Loop Parallelization via Compiler Guided Refactoring

    E-Print Network [OSTI]

    . Lyngby, Denmark Email: {pl,ska}@imm.dtu.dk Computer Science Engineering Chalmers U. Technology, 412 96 by the computing industry today. Yet, applications are often written in ways that prevent automatic parallelization Gothenburg, Sweden Email: lidman@student.chalmers.se, mckee@chalmers.se IBM Haifa Research Labs Mount Carmel

  4. Titanium and Java Parallelism Arvind Krishnamurthy

    E-Print Network [OSTI]

    Krishnamurthy, Arvind

    1 Titanium and Java Parallelism Arvind Krishnamurthy Fall 2004 Titanium Take the best features: checked at compile time, no unsafe casts Automatic memory management Titanium is (almost) strict superset VisComplex extends Complex { ... } Immutable Classes in Titanium For small objects, would sometimes

  5. WEBPIE: A WEB-SCALE PARALLEL INFERENCE

    E-Print Network [OSTI]

    WEBPIE: A WEB-SCALE PARALLEL INFERENCE ENGINE Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Niels Amsterdam Monday 10 May 2010 #12;The Semantic Web The Semantic Web is an extension of the current Web where the semantics is defined Basically the idea is to move from Web of Documents (Traditional Web) Web of data

  6. Parallelism for quantum computation with qudits

    SciTech Connect (OSTI)

    O'Leary, Dianne P. [Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742, USA and Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, Maryland 20899 (United States); IDA Center for Computing Sciences, 17100 Science Drive, Bowie, Maryland 20715-4300 (United States); Brennen, Gavin K. [Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences, A-6020, Innsbruck (Austria); Bullock, Stephen S. [IDA Center for Computing Sciences, 17100 Science Drive, Bowie, Maryland 20715-4300 (United States)

    2006-09-15T23:59:59.000Z

    Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high-fidelity two-qudit gates. We first describe how to implement parallel single-qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth (time) of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the alkali-metal atoms {sup 87}Rb and {sup 133}Cs. Second, we provide a protocol for implementing parallelized nonlocal two-qudit gates using the assistance of entangled qubit pairs. Using known protocols for qubit entanglement purification, this offers the possibility of high-fidelity two-qudit gates.

  7. Original article Parallel selection of ethanol

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Original article Parallel selection of ethanol and acetic-acid tolerance in Drosophila melanogaster significantly with latitude (0.036 ! 0.004 for 1° latitude; genetic divergence FST = 0.25). Patterns of ethanol of latitudinal ethanol tolerance (10 to 15%) and acetic-acid tolerance (3.7 to 13.2%) were observed in adult

  8. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2013-10-29T23:59:59.000Z

    Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a data communications instruction, the instruction characterized by an instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance with the instruction type, the transfer data from the origin endpoint to the target endpoint.

  9. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2014-02-11T23:59:59.000Z

    Data communications in a parallel active messaging interface ('PAMI') or a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution of a compute node, including specification of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications instruction, the instruction characterized by instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance witht the instruction type, the transfer data from the origin endpoin to the target endpoint.

  10. VIP-FS: A Virtual, Parallel file System for High Performance Parallel and Distributed Computing *

    E-Print Network [OSTI]

    Kuzmanovic, Aleksandar

    -passing li- blclries only provide part of the support necessary for most high performan.ce distributed computing applzca- tzcjns - support for hagh speed parallel l/O is still lark- 211q. In this paper, we

  11. Electric power monthly, February 1999 with data for November 1998

    SciTech Connect (OSTI)

    NONE

    1999-02-01T23:59:59.000Z

    The Electric Power Monthly presents monthly electricity statistics for a wide audience including Congress, Federal and State agencies, the electric utility industry, and the general public. The purpose of this publication is to provide energy decision makers with accurate and timely information that may be used in forming various perspectives on electric issues that lie ahead. Statistics are provided for net generation, fossil fuel consumption and stocks, quantity and quality of fossil fuels, cost of fossil fuels, electricity retail sales, associated revenue, and average revenue per kilowatt-hour of electricity sold.

  12. Engineering innovation to reduce wind power COE

    SciTech Connect (OSTI)

    Ammerman, Curtt Nelson [Los Alamos National Laboratory

    2011-01-10T23:59:59.000Z

    There are enough wind resources in the US to provide 10 times the electric power we currently use, however wind power only accounts for 2% of our total electricity production. One of the main limitations to wind use is cost. Wind power currently costs 5-to-8 cents per kilowatt-hour, which is more than twice the cost of electricity generated by burning coal. Our Intelligent Wind Turbine LDRD Project is applying LANL's leading-edge engineering expertise in modeling and simulation, experimental validation, and advanced sensing technologies to challenges faced in the design and operation of modern wind turbines.

  13. Dow and Independent Power-- Yesterday, Today, Tomorrow

    E-Print Network [OSTI]

    Brunt, J. E.

    1989-01-01T23:59:59.000Z

    including petro chemicals such as styrene and ethylene glycol -- consume large quantities of steam or thermal energy. So you can understand that energy costs are a crucial factor in our competitive ness. That's why Dow has been a dual energy producer... waste heat. So what did we get for our money? The typical heat rates, or the number of BTUs required to generate a net kilowatt hour, is 15,000 for a typical old steam boiler and turbine facility. But for a combined cycle gas turbine, waste heat...

  14. Nuclear Waste Fund fee adequacy: An assessment

    SciTech Connect (OSTI)

    NONE

    1990-11-01T23:59:59.000Z

    The purpose of this report is to present the Department of Energy`s (the Department) analysis of the adequacy of the 1.00 mill per kilowatt-hour (kWh) fee being paid by the utilities generating nuclear power for the permanent disposal of their spent nuclear fuel (SNF). In accordance with the Nuclear Waste Policy Act (NWPA), the SNF would be disposed of in a geologic repository to be developed by the Department. An annual analysis of the fee`s adequacy is required by the NWPA.

  15. Cheaper, Cleaner, Cooler Ways to Meet our Needs for New Energy

    E-Print Network [OSTI]

    Smith, T.

    World Energy-Related Carbon Dioxide Emissions, 1990-2030 (billion metric tons) 0 5 10 15 20 25 30 35 40 45 50 1990 1995 2000 2005 2010 2015 2020 2025 2030 Coal Liquids Natural Gas Total International Energy Outlook 2007 History Projections 43% 39% 40... initiatives would generate $4.40 in savings Save energy at a cost of less than 2 cents per kilowatt- hour vs. 5 for coal Efficiency Renewables and CHP could save 76%-101% of the growth in demand in Texas Improved CHP policies 20% Utility savings...

  16. Creating a Parallel Version of VisIt for Microsoft Windows

    SciTech Connect (OSTI)

    Whitlock, B J; Biagas, K S; Rawson, P L

    2011-12-07T23:59:59.000Z

    VisIt is a popular, free interactive parallel visualization and analysis tool for scientific data. Users can quickly generate visualizations from their data, animate them through time, manipulate them, and save the resulting images or movies for presentations. VisIt was designed from the ground up to work on many scales of computers from modest desktops up to massively parallel clusters. VisIt is comprised of a set of cooperating programs. All programs can be run locally or in client/server mode in which some run locally and some run remotely on compute clusters. The VisIt program most able to harness today's computing power is the VisIt compute engine. The compute engine is responsible for reading simulation data from disk, processing it, and sending results or images back to the VisIt viewer program. In a parallel environment, the compute engine runs several processes, coordinating using the Message Passing Interface (MPI) library. Each MPI process reads some subset of the scientific data and filters the data in various ways to create useful visualizations. By using MPI, VisIt has been able to scale well into the thousands of processors on large computers such as dawn and graph at LLNL. The advent of multicore CPU's has made parallelism the 'new' way to achieve increasing performance. With today's computers having at least 2 cores and in many cases up to 8 and beyond, it is more important than ever to deploy parallel software that can use that computing power not only on clusters but also on the desktop. We have created a parallel version of VisIt for Windows that uses Microsoft's MPI implementation (MSMPI) to process data in parallel on the Windows desktop as well as on a Windows HPC cluster running Microsoft Windows Server 2008. Initial desktop parallel support for Windows was deployed in VisIt 2.4.0. Windows HPC cluster support has been completed and will appear in the VisIt 2.5.0 release. We plan to continue supporting parallel VisIt on Windows so our users will be able to take full advantage of their multicore resources.

  17. Investigation of anti-islanding schemes for utility interconnection of distributed fuel cell powered generations

    E-Print Network [OSTI]

    Jeraputra, Chuttchaval

    2006-04-12T23:59:59.000Z

    The rapid emergence of distributed fuel cell powered generations (DFPGs) operating in parallel with utility has brought a number of technical concerns as more DFPGs are connected to utility grid. One of the most challenging ...

  18. Towards next generation ocean models : novel discontinuous Galerkin schemes for 2D unsteady biogeochemical models

    E-Print Network [OSTI]

    Ueckermann, Mattheus Percy

    2009-01-01T23:59:59.000Z

    A new generation of efficient parallel, multi-scale, and interdisciplinary ocean models is required for better understanding and accurate predictions. The purpose of this thesis is to quantitatively identify promising ...

  19. Parallel Algorithms for Time and Frequency Domain Circuit Simulation

    E-Print Network [OSTI]

    Dong, Wei

    2010-10-12T23:59:59.000Z

    parallelization due to its explicit nature. For frequency-domain simulation, this dissertation presents a parallel harmonic balance approach, applicable to the steady-state and envelope-following analyses of both driven and autonomous circuits. The new approach...

  20. Shape-based Cost Analysis of Skeletal Parallel Programs

    E-Print Network [OSTI]

    Hayashi, Yasushi

    This work presents an automatic cost-analysis system for an implicitly parallel skeletal programming language. Although deducing interesting dynamic characteristics of parallel programs (and in particular, run time) is ...

  1. Data Parallel SwitchLevel Simulation \\Lambda Randal E. Bryant

    E-Print Network [OSTI]

    Bryant, Randal E.

    Data Parallel SwitchLevel Simulation \\Lambda Randal E. Bryant Computer Science Department Carnegie the bitlevel paral lelism inherent in conventional machine operations. Bryant---Data Parallel Simulation

  2. Parallel Web Scripting with Reactive Constraints Thibaud Hottelier

    E-Print Network [OSTI]

    Bodik, Rastisla

    Parallel Web Scripting with Reactive Constraints Thibaud Hottelier James Ide Doug Kimelman Ras Bodik Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report to lists, requires prior specific permission. #12;Parallel Web Scripting with Reactive Constraints Thibaud

  3. Parallel Solutions of Partial Differential Equations with Adaptive Multigrid Methods

    E-Print Network [OSTI]

    Wieners, Christian

    Parallel Solutions of Partial Differential Equations with Adaptive Multigrid Methods results for the solution of partial differential equations based on the software platform UG. State/coarsening, robust parallel multigrid methods, various dis cretizations, dynamic load balancing, mapping and grid

  4. Effect on Non-Uniform Heat Generation on Thermionic Reactions

    SciTech Connect (OSTI)

    Schock, Alfred

    2012-01-19T23:59:59.000Z

    The penalty resulting from non-uniform heat generation in a thermionic reactor is examined. Operation at sub-optimum cesium pressure is shown to reduce this penalty, but at the risk of a condition analogous to burnout. For high pressure diodes, a simple empirical correlation between current, voltage and heat flux is developed and used to analyze the performance penalty associated with two different heat flux profiles, for series-and parallel-connected converters. The results demonstrate that series-connected converters require much finer power flattening than parallel converters. For example, a 10% variation in heat generation across a series array can result in a 25 to 50% power penalty.

  5. A parallel interior point decomposition algorithm for block angular ...

    E-Print Network [OSTI]

    2008-05-24T23:59:59.000Z

    a parallel and distributed high performance computing environment. We compare our. MPI (Message Passing Interface) implementation of the decomposition...

  6. On Optimal Slicing of Parallel Programs Markus Muller-Olm

    E-Print Network [OSTI]

    Müller-Olm, Markus

    On Optimal Slicing of Parallel Programs Markus M¨uller-Olm Universit¨at Dortmund, FB Informatik, LS

  7. Nonlinear parallel momentum transport in strong turbulence

    E-Print Network [OSTI]

    Wang, Lu; Diamond, P H

    2015-01-01T23:59:59.000Z

    Most existing theoretical studies of momentum transport focus on calculating the Reynolds stress based on quasilinear theory, without considering the \\emph{nonlinear} momentum flux-$$. However, a recent experiment on TORPEX found that the nonlinear toroidal momentum flux induced by blobs makes a significant contribution as compared to the Reynolds stress [Labit et al., Phys. Plasmas {\\bf 18}, 032308 (2011)]. In this work, the nonlinear parallel momentum flux in strong turbulence is calculated by using three dimensional Hasegawa-Mima equation. It is shown that nonlinear diffusivity is smaller than quasilinear diffusivity from Reynolds stress. However, the leading order nonlinear residual stress can be comparable to the quasilinear residual stress, and so could be important to intrinsic rotation in tokamak edge plasmas. A key difference from the quasilinear residual stress is that parallel fluctuation spectrum asymmetry is not required for nonlinear residual stress.

  8. Kalman Filter Tracking on Parallel Architectures

    E-Print Network [OSTI]

    Cerati, Giuseppe; Lantz, Steven; McDermott, Kevin; Riley, Dan; Tadel, Matev; Wittich, Peter; Wrthwein, Frank; Yagil, Avi

    2015-01-01T23:59:59.000Z

    Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors, but the future will be even more exciting. In order to stay within the power density limits but still obtain Moore's Law performance/price gains, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Example technologies today include Intel's Xeon Phi and GPGPUs. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High Luminosity LHC, for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques including Cellular Automata or returning to Hough Transform. The most common track finding techniques in use today are however those based on the Kalman Filter. Significant experience has...

  9. Parallel State Estimation Assessment with Practical Data

    SciTech Connect (OSTI)

    Chen, Yousu; Jin, Shuangshuang; Rice, Mark J.; Huang, Zhenyu

    2013-07-31T23:59:59.000Z

    This paper presents a parallel state estimation (PSE) implementation using a preconditioned gradient algorithm and an orthogonal decomposition-based algorithm. The preliminary tests against a commercial Energy Management System (EMS) State Estimation (SE) tool using real-world data are performed. The results show that while the precondition gradient algorithm can solve the SE problem quicker with the help of parallel computing techniques, it might not be good for real-world data due to the large condition number of gain matrix introduced by the wide range of measurement weights. With the help of PETSc package and considering one iteration of the SE process, the orthogonal decomposition-based PSE algorithm can achieve 5-20 times speedup comparing against the commercial EMS tool. It is very promising that the developed PSE can solve the SE problem for large power systems at the SCADA rate, to improve grid reliability.

  10. Instruction sets for Parallel Random Access Machines

    SciTech Connect (OSTI)

    Trahan, J.L.

    1988-01-01T23:59:59.000Z

    The computational powers of time-bounded Parallel Random Access Machines (PRAMs) with different instruction sets are compared. A basic PRAM can perform the following operations in unit-time: addition, subtraction, Boolean operations, comparisons, and indirect addressing. Multiple processors may concurrently read and concurrently write a single cell. This thesis establishes that the class of languages accepted in polynomial time on a PRAM(*, {up arrow}, {down arrow}) contains the class of languages accepted in exponential time on a nondeterministic Turing machine (NEXPTIME) and is contained in the class of languages accepted in exponential space on a Turing machine. Efficient simulations are presented of PRAMs with enhanced instruction sets by sequential RAMs with the same instruction sets; also simulations of probabilistic PRAMs by deterministic PRAMs, using parallelism to replace randomness. Also given are simulations of PRAM(op)s by PRAMs, where both the simulated machine and the simulating machine are exclusive-read, exclusive-write machines.

  11. Locating hardware faults in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Megerian, Mark G.; Ratterman, Joseph D.; Smith, Brian E.

    2010-04-13T23:59:59.000Z

    Locating hardware faults in a parallel computer, including defining within a tree network of the parallel computer two or more sets of non-overlapping test levels of compute nodes of the network that together include all the data communications links of the network, each non-overlapping test level comprising two or more adjacent tiers of the tree; defining test cells within each non-overlapping test level, each test cell comprising a subtree of the tree including a subtree root compute node and all descendant compute nodes of the subtree root compute node within a non-overlapping test level; performing, separately on each set of non-overlapping test levels, an uplink test on all test cells in a set of non-overlapping test levels; and performing, separately from the uplink tests and separately on each set of non-overlapping test levels, a downlink test on all test cells in a set of non-overlapping test levels.

  12. Parallel machine architecture for production rule systems

    DOE Patents [OSTI]

    Allen, Jr., John D. (Knoxville, TN); Butler, Philip L. (Knoxville, TN)

    1989-01-01T23:59:59.000Z

    A parallel processing system for production rule programs utilizes a host processor for storing production rule right hand sides (RHS) and a plurality of rule processors for storing left hand sides (LHS). The rule processors operate in parallel in the recognize phase of the system recognize -Act Cycle to match their respective LHS's against a stored list of working memory elements (WME) in order to find a self consistent set of WME's. The list of WME is dynamically varied during the Act phase of the system in which the host executes or fires rule RHS's for those rules for which a self-consistent set has been found by the rule processors. The host transmits instructions for creating or deleting working memory elements as dictated by the rule firings until the rule processors are unable to find any further self-consistent working memory element sets at which time the production rule system is halted.

  13. Parallel revised simplex for primal block angular LP problems

    E-Print Network [OSTI]

    Hall, Julian

    Parallel revised simplex for primal block angular LP problems Julian Hall and Edmund Smith School) problems and their identification Computational components of the revised simplex method Exploiting parallelism via BALP structure Results Observations J. A. J. Hall and E. Smith Parallel revised simplex

  14. Update procedures for the parallel revised simplex method

    E-Print Network [OSTI]

    Hall, Julian

    Update procedures for the parallel revised simplex method J. A. J. Hall and K. I. M. McKinnon 30th #12;Update procedures for the parallel revised simplex method J. A. J. Hall K. I. M. McKinnon 30th September 1992 Abstract In the parallel revised simplex method proposed by Hall et al. in 8], the inversion

  15. A Generalisation of Indexing for Parallel Document Search

    E-Print Network [OSTI]

    Graham, Nick

    A Generalisation of Indexing for Parallel Document Search D.B. Skillicorn skill Science Queen's University Kingston, Ontario K7L 3N6 Document prepared March 21, 1995 Copyright c fl1995 D.B. Skillicorn #12; A Generalisation of Indexing for Parallel Document Search Abstract Parallelism is useful

  16. A Generalisation of Indexing for Parallel Document Search

    E-Print Network [OSTI]

    Graham, Nick

    A Generalisation of Indexing for Parallel Document Search D.B. Skillicorn skill Science Queen's University Kingston, Ontario K7L 3N6 Document prepared March 21, 1995 Copyright c 1995 D.B. Skillicorn #12;A Generalisation of Indexing for Parallel Document Search Abstract Parallelism is useful

  17. Equivalency-processing parallel photonic integrated circuit EP3

    E-Print Network [OSTI]

    Louri, Ahmed

    Equivalency-processing parallel photonic integrated circuit EP3 IC : equivalence search module present an optoelectronic module called the equivalency-processing parallel photonic integrated circuit EP3 IC that is created specifically to implement high-speed parallel equivalence searches i

  18. Architecture independent parallel binomial tree option price valuations

    E-Print Network [OSTI]

    Gerbessiotis, Alexandros V.

    Architecture independent parallel binomial tree option price valuations Alexandros V. Gerbessiotis02 #12; Architecture independent parallel binomial tree option price valuations Alexandros V in American or Europeanstyle option valuations can be performed in parallel in the binomialtree model

  19. Comparing the Parix and PVM parallel programming environments

    E-Print Network [OSTI]

    Amsterdam, Universiteit van

    1 Comparing the Parix and PVM parallel programming environments A.G. Hoekstra, P.M.A. Sloot, and L Genericity of parallel programming environments, enabling development of portable parallel programs environments are important issues if a choice between programming environments has to be made. We propose

  20. Mono inverter Multi parallel PMSM -Structure and Control strategy

    E-Print Network [OSTI]

    Boyer, Edmond

    Mono inverter Multi parallel PMSM - Structure and Control strategy Damien Bidarta , Maria Pietrzak a new and original Mono inverter Multi parallel Permanent Magnet Synchronous Motor (PMSM) system. Experimental results are given for a system with 2 PMSM plugged in parallel. The proposed solution can however

  1. 32 TaskSpaces: A Software Framework for Parallel

    E-Print Network [OSTI]

    De Sterck, Hans

    and Computational Biology, A. Zomaya, editor, John Wiley and Sons, 2005. i #12;Contents 32 Parallel Bioinformatics32 TaskSpaces: A Software Framework for Parallel Bioinformatics on Computational Grids HANS DE, there is a natural drive towards applying parallel and distributed computing to bioinformatics problems. Grid

  2. Columnar discharge mode between parallel dielectric barrier electrodes in atmospheric pressure helium

    SciTech Connect (OSTI)

    Hao, Yanpeng; Zheng, Bin; Liu, Yaoge [School of Electric Power, South China University of Technology, Guangzhou 510640 (China)] [School of Electric Power, South China University of Technology, Guangzhou 510640 (China)

    2014-01-15T23:59:59.000Z

    Using a fast-gated intensified charge-coupled device, end- and side-view photographs were taken of columnar discharge between parallel dielectric barrier electrodes in atmospheric pressure helium. Based on three-dimensional images generated from end-view photographs, the number of discharge columns increased, whereas the diameter of each column decreased as the applied voltage was increased. Side-view photographs indicate that columnar discharges exhibited a mode transition ranging from Townsend to glow discharges generated by the same discharge physics as atmospheric pressure glow discharge.

  3. Stochastic Particle Acceleration in Parallel Relativistic Shocks

    E-Print Network [OSTI]

    Joni J. P. Virtanen; Rami Vainio

    2005-03-03T23:59:59.000Z

    We present results of test-particle simulations on both the first- and the second-order Fermi acceleration for relativistic parallel shock waves. Our studies suggest that the role of the second-order mechanism in the turbulent downstream of a relativistic shock may have been underestimated in the past, and that the stochastic mechanism may have significant effects on the form of the particle spectra and its time evolution.

  4. Parallel implementation of sparse matrix solvers

    E-Print Network [OSTI]

    Pujari, Sushant Kumar

    1992-01-01T23:59:59.000Z

    faster, utilizing its sparseness and adaptibility to parallel architecture, is of practical significance. It was observed that the sparse solvers used in this work are very efficient in solving sparse matrices, in fact a significant reduction... Performance results for Harwell sparse solver. 25 Performance of Yale's solver for matrices of various sizes, with 50% spar- sity, on different architecture. 27 IV Performance of Harwell so! ver for matrices of various sizes, with 50% spar- sity...

  5. Kalman Filter Tracking on Parallel Architectures

    E-Print Network [OSTI]

    Giuseppe Cerati; Peter Elmer; Steven Lantz; Kevin McDermott; Dan Riley; Matev Tadel; Peter Wittich; Frank Wrthwein; Avi Yagil

    2015-05-18T23:59:59.000Z

    Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors, but the future will be even more exciting. In order to stay within the power density limits but still obtain Moore's Law performance/price gains, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Example technologies today include Intel's Xeon Phi and GPGPUs. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High Luminosity LHC, for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques including Cellular Automata or returning to Hough Transform. The most common track finding techniques in use today are however those based on the Kalman Filter. Significant experience has been accumulated with these techniques on real tracking detector systems, both in the trigger and offline. They are known to provide high physics performance, are robust and are exactly those being used today for the design of the tracking system for HL-LHC. Our previous investigations showed that, using optimized data structures, track fitting with Kalman Filter can achieve large speedup both with Intel Xeon and Xeon Phi. We report here our further progress towards an end-to-end track reconstruction algorithm fully exploiting vectorization and parallelization techniques in a realistic simulation setup.

  6. Intelligent spatial ecosystem modeling using parallel processors

    SciTech Connect (OSTI)

    Maxwell, T.; Costanza, R. (Maryland International Inst. for Ecological Economics, Solomons (United States))

    1993-05-01T23:59:59.000Z

    Spatial modeling of ecosystems is essential if one's modeling goals include developing a relatively realistic description of past behavior and predictions of the impacts of alternative management policies on future ecosystem behavior. Development of these models has been limited in the past by the large amount of input data required and the difficulty of even large mainframe serial computers in dealing with large spatial arrays. These two limitations have begun to erode with the increasing availability of remote sensing data and GIS systems to manipulate it, and the development of parallel computer systems which allow computation of large, complex, spatial arrays. Although many forms of dynamic spatial modeling are highly amenable to parallel processing, the primary focus in this project is on process-based landscape models. These models simulate spatial structure by first compartmentalizing the landscape into some geometric design and then describing flows within compartments and spatial processes between compartments according to location-specific algorithms. The authors are currently building and running parallel spatial models at the regional scale for the Patuxent River region in Maryland, the Everglades in Florida, and Barataria Basin in Louisiana. The authors are also planning a project to construct a series of spatially explicit linked ecological and economic simulation models aimed at assessing the long-term potential impacts of global climate change.

  7. Xyce parallel electronic simulator : reference guide.

    SciTech Connect (OSTI)

    Mei, Ting; Rankin, Eric Lamont; Thornquist, Heidi K.; Santarelli, Keith R.; Fixel, Deborah A.; Coffey, Todd Stirling; Russo, Thomas V.; Schiek, Richard Louis; Warrender, Christina E.; Keiter, Eric Richard; Pawlowski, Roger Patrick

    2011-05-01T23:59:59.000Z

    This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users Guide. The Xyce Parallel Electronic Simulator has been written to support, in a rigorous manner, the simulation needs of the Sandia National Laboratories electrical designers. It is targeted specifically to run on large-scale parallel computing platforms but also runs well on a variety of architectures including single processor workstations. It also aims to support a variety of devices and models specific to Sandia needs. This document is intended to complement the Xyce Users Guide. It contains comprehensive, detailed information about a number of topics pertinent to the usage of Xyce. Included in this document is a netlist reference for the input-file commands and elements supported within Xyce; a command line reference, which describes the available command line arguments for Xyce; and quick-references for users of other circuit codes, such as Orcad's PSpice and Sandia's ChileSPICE.

  8. Generation Planning (pbl/generation)

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOEThe Bonneville Power AdministrationField8,Dist.Newof EnergyFundingGene ControlsCounselGeneral User Generation

  9. Parallel Dimers and Anti-parallel Tetramers Formed by Epidermal Growth Factor Receptor Pathway Substrate Clone 15 (EPS15)*

    E-Print Network [OSTI]

    Kirchhausen, Tomas

    Parallel Dimers and Anti-parallel Tetramers Formed by Epidermal Growth Factor Receptor Pathway- dependent endocytic traffic. We report here that Eps15 forms dimers and tetramers of distinct shape. The Eps tetramer has a "dumbbell" shape, 31 nm in length; it is formed by the anti-parallel association of two Eps

  10. ASCI Red -- Experiences and lessons learned with a massively parallel teraFLOP supercomputer

    SciTech Connect (OSTI)

    Christon, M.A.; Crawford, D.A.; Hertel, E.S.; Peery, J.S.; Robinson, A.C. [Sandia National Labs., Albuquerque, NM (United States). Computational Physics R and D Dept.

    1997-06-01T23:59:59.000Z

    The Accelerated Strategic Computing Initiative (ASCI) program involves Sandia, Los Alamos and Lawrence Livermore National Laboratories. At Sandia National Laboratories, ASCI applications include large deformation transient dynamics, shock propagation, electromechanics, and abnormal thermal environments. In order to resolve important physical phenomena in these problems, it is estimated that meshes ranging from 10{sup 6} to 10{sup 9} grid points will be required. The ASCI program is relying on the use of massively parallel supercomputers initially capable of delivering over 1 TFLOPs to perform such demanding computations. The ASCI Red machine at Sandia National Laboratories consists of over 4,500 computational nodes with a peak computational rate of 1.8 TFLOPs, 567 GBytes of memory, and 2 TBytes of disk storage. Regardless of the peak FLOP rate, there are many issues surrounding the use of massively parallel supercomputers in a production environment. These issues include parallel I/O, mesh generation, visualization, archival storage, high-bandwidth networking and the development of parallel algorithms. In order to illustrate these issues and their solution with respect to ASCI Red, demonstration calculations of time-dependent buoyancy-dominated plumes, electromechanics, and shock propagation will be presented.

  11. Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers

    E-Print Network [OSTI]

    Shahabi, Cyrus

    Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers Ulrich Neumann rendering algorithms. This issue has not been addressed in papers describing particular parallel implementations, but is pertinent to anyone dc- signing or implementing parallel rendering algorithms. Parallel

  12. Parallel heater system for subsurface formations

    DOE Patents [OSTI]

    Harris, Christopher Kelvin (Houston, TX); Karanikas, John Michael (Houston, TX); Nguyen, Scott Vinh (Houston, TX)

    2011-10-25T23:59:59.000Z

    A heating system for a subsurface formation is disclosed. The system includes a plurality of substantially horizontally oriented or inclined heater sections located in a hydrocarbon containing layer in the formation. At least a portion of two of the heater sections are substantially parallel to each other. The ends of at least two of the heater sections in the layer are electrically coupled to a substantially horizontal, or inclined, electrical conductor oriented substantially perpendicular to the ends of the at least two heater sections.

  13. Carbothermic reduction with parallel heat sources

    DOE Patents [OSTI]

    Troup, Robert L. (Murrysville, PA); Stevenson, David T. (Washington Township, Washington County, PA)

    1984-12-04T23:59:59.000Z

    Disclosed are apparatus and method of carbothermic direct reduction for producing an aluminum alloy from a raw material mix including aluminum oxide, silicon oxide, and carbon wherein parallel heat sources are provided by a combustion heat source and by an electrical heat source at essentially the same position in the reactor, e.g., such as at the same horizontal level in the path of a gravity-fed moving bed in a vertical reactor. The present invention includes providing at least 79% of the heat energy required in the process by the electrical heat source.

  14. Parallel State Estimation Assessment with Practical Data

    SciTech Connect (OSTI)

    Chen, Yousu; Jin, Shuangshuang; Rice, Mark J.; Huang, Zhenyu

    2014-10-31T23:59:59.000Z

    This paper presents a full-cycle parallel state estimation (PSE) implementation using a preconditioned conjugate gradient algorithm. The developed code is able to solve large-size power system state estimation within 5 seconds using real-world data, comparable to the Supervisory Control And Data Acquisition (SCADA) rate. This achievement allows the operators to know the system status much faster to help improve grid reliability. Case study results of the Bonneville Power Administration (BPA) system with real measurements are presented. The benefits of fast state estimation are also discussed.

  15. Efficient Parallel Text Compression on GPUs

    E-Print Network [OSTI]

    Zhang, Xiaoxi

    2012-02-14T23:59:59.000Z

    comparison with FreeArc (0.66) on 6x2.8 GHz core, FreeArc (0.66) on 1x2.8GHz core, winrar (4.01), winzip (15.5), gzip (1.3.12) and 7zip (9.20). . . . . . . . . . . . . . . 35 1 CHAPTER I INTRODUCTION The textual content of the Web is growing at a... run on multi-core CPU while their approach is splitting a big file to blocks 5 and then assigning them to different cores, therefore the algorithm is in fact sequen- tial. PBZIP2 [8] is a parallel Bzip implementation which is inherently feasible...

  16. COMPUTER GENERATION OF TYPE CURVES SUBMITIED TO THE DEPARTMENTOF PETROLEUMENGINEERING

    E-Print Network [OSTI]

    Stanford University

    COMPUTER GENERATION OF TYPE CURVES A REPORT SUBMITIED TO THE DEPARTMENTOF PETROLEUMENGINEERING data. This paper presents some previously published type curves and the computer programs that were between two parallel sealing faults. The governing equations for these curves are derived. The computer

  17. Coiled transmission line pulse generators

    DOE Patents [OSTI]

    McDonald, Kenneth Fox (Columbia, MO)

    2010-11-09T23:59:59.000Z

    Methods and apparatus are provided for fabricating and constructing solid dielectric "Coiled Transmission Line" pulse generators in radial or axial coiled geometries. The pour and cure fabrication process enables a wide variety of geometries and form factors. The volume between the conductors is filled with liquid blends of monomers, polymers, oligomers, and/or cross-linkers and dielectric powders; and then cured to form high field strength and high dielectric constant solid dielectric transmission lines that intrinsically produce ideal rectangular high voltage pulses when charged and switched into matched impedance loads. Voltage levels may be increased by Marx and/or Blumlein principles incorporating spark gap or, preferentially, solid state switches (such as optically triggered thyristors) which produce reliable, high repetition rate operation. Moreover, these Marxed pulse generators can be DC charged and do not require additional pulse forming circuitry, pulse forming lines, transformers, or an a high voltage spark gap output switch. The apparatus accommodates a wide range of voltages, impedances, pulse durations, pulse repetition rates, and duty cycles. The resulting mobile or flight platform friendly cylindrical geometric configuration is much more compact, light-weight, and robust than conventional linear geometries, or pulse generators constructed from conventional components. Installing additional circuitry may accommodate optional pulse shape improvements. The Coiled Transmission Lines can also be connected in parallel to decrease the impedance, or in series to increase the pulse length.

  18. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B. (DeSoto, TX)

    1994-01-01T23:59:59.000Z

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination.

  19. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19T23:59:59.000Z

    A communication switch apparatus and a method for use in a geographically extensive serial, parallel or hybrid communication network linking a multi-processor or parallel processing system has a very low software processing overhead in order to accommodate random burst of high density data. Associated with each processor is a communication switch. A data source and a data destination, a sensor suite or robot for example, may also be associated with a switch. The configuration of the switches in the network are coordinated through a master processor node and depends on the operational phase of the multi-processor network: data acquisition, data processing, and data exchange. The master processor node passes information on the state to be assumed by each switch to the processor node associated with the switch. The processor node then operates a series of multi-state switches internal to each communication switch. The communication switch does not parse and interpret communication protocol and message routing information. During a data acquisition phase, the communication switch couples sensors producing data to the processor node associated with the switch, to a downlink destination on the communications network, or to both. It also may couple an uplink data source to its processor node. During the data exchange phase, the switch couples its processor node or an uplink data source to a downlink destination (which may include a processor node or a robot), or couples an uplink source to its processor node and its processor node to a downlink destination. 9 figs.

  20. Analysis and selection of optimal function implementations in massively parallel computer

    DOE Patents [OSTI]

    Archer, Charles Jens (Rochester, MN); Peters, Amanda (Rochester, MN); Ratterman, Joseph D. (Rochester, MN)

    2011-05-31T23:59:59.000Z

    An apparatus, program product and method optimize the operation of a parallel computer system by, in part, collecting performance data for a set of implementations of a function capable of being executed on the parallel computer system based upon the execution of the set of implementations under varying input parameters in a plurality of input dimensions. The collected performance data may be used to generate selection program code that is configured to call selected implementations of the function in response to a call to the function under varying input parameters. The collected performance data may be used to perform more detailed analysis to ascertain the comparative performance of the set of implementations of the function under the varying input parameters.

  1. Formation of electron kappa distributions due to interactions with parallel propagating whistler waves

    SciTech Connect (OSTI)

    Tao, X., E-mail: xtao@ustc.edu.cn; Lu, Q. [CAS Key Laboratory of Geospace Environment, Department of Geophysics and Planetary Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China) [CAS Key Laboratory of Geospace Environment, Department of Geophysics and Planetary Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China); Mengcheng National Geophysical Observatory, School of Earth and Space Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China)

    2014-02-15T23:59:59.000Z

    In space plasmas, charged particles are frequently observed to possess a high-energy tail, which is often modeled by a kappa-type distribution function. In this work, the formation of the electron kappa distribution in generation of parallel propagating whistler waves is investigated using fully nonlinear particle-in-cell (PIC) simulations. A previous research concluded that the bi-Maxwellian character of electron distributions is preserved in PIC simulations. We now demonstrate that for interactions between electrons and parallel propagating whistler waves, a non-Maxwellian high-energy tail can be formed, and a kappa distribution can be used to fit the electron distribution in time-asymptotic limit. The ?-parameter is found to decrease with increasing initial temperature anisotropy or decreasing ratio of electron plasma frequency to cyclotron frequency. The results might be helpful to understanding the origin of electron kappa distributions observed in space plasmas.

  2. MC++: Parallel, portable, Monte Carlo neutron transport in C++

    SciTech Connect (OSTI)

    Lee, S.R.; Cummings, J.C. [Los Alamos National Lab., NM (United States); Nolen, S.D. [Texas A& M Univ., College Station, TX (United States). Dept. of Nuclear Engineering

    1997-02-01T23:59:59.000Z

    We have developed an implicit Monte Carlo neutron transport code in C++ using the Parallel Object-Oriented Methods and Applications (POOMA) class library. MC++ runs in parallel on and is portable to a wide variety of platforms, including MPPs, clustered SMPs, and individual workstations. It contains appropriate classes and abstractions for particle transport and parallelism. Current capabilities of MC++ are discussed, along with future plans and physics and performance results on many different platforms.

  3. Parallel Pruning for KMeans Clustering on Shared Memory Architectures

    E-Print Network [OSTI]

    Gursoy, Attila

    Parallel Pruning for K­Means Clustering on Shared Memory Architectures Attila G¨ursoy and ?? Ilker@cs.bilkent.edu.tr Abstract. We have developed and evaluated two parallelization schemes for a tree­based k­means clustering, but the efficiency is re­ duced due to thread synchronizations. In both cases, parallel tree­based k­means clustering

  4. Sub-Second Parallel State Estimation

    SciTech Connect (OSTI)

    Chen, Yousu; Rice, Mark J.; Glaesemann, Kurt R.; Wang, Shaobu; Huang, Zhenyu

    2014-10-31T23:59:59.000Z

    This report describes the performance of Pacific Northwest National Laboratory (PNNL) sub-second parallel state estimation (PSE) tool using the utility data from the Bonneville Power Administrative (BPA) and discusses the benefits of the fast computational speed for power system applications. The test data were provided by BPA. They are two-days worth of hourly snapshots that include power system data and measurement sets in a commercial tool format. These data are extracted out from the commercial tool box and fed into the PSE tool. With the help of advanced solvers, the PSE tool is able to solve each BPA hourly state estimation problem within one second, which is more than 10 times faster than todays commercial tool. This improved computational performance can help increase the reliability value of state estimation in many aspects: (1) the shorter the time required for execution of state estimation, the more time remains for operators to take appropriate actions, and/or to apply automatic or manual corrective control actions. This increases the chances of arresting or mitigating the impact of cascading failures; (2) the SE can be executed multiple times within time allowance. Therefore, the robustness of SE can be enhanced by repeating the execution of the SE with adaptive adjustments, including removing bad data and/or adjusting different initial conditions to compute a better estimate within the same time as a traditional state estimators single estimate. There are other benefits with the sub-second SE, such as that the PSE results can potentially be used in local and/or wide-area automatic corrective control actions that are currently dependent on raw measurements to minimize the impact of bad measurements, and provides opportunities to enhance the power grid reliability and efficiency. PSE also can enable other advanced tools that rely on SE outputs and could be used to further improve operators actions and automated controls to mitigate effects of severe events on the grid. The power grid continues to grow and the number of measurements is increasing at an accelerated rate due to the variety of smart grid devices being introduced. A parallel state estimation implementation will have better performance than traditional, sequential state estimation by utilizing the power of high performance computing (HPC). This increased performance positions parallel state estimators as valuable tools for operating the increasingly more complex power grid.

  5. Understanding and Managing Generation Y

    E-Print Network [OSTI]

    Wallace, Kevin

    2007-12-14T23:59:59.000Z

    There are four generations in the workplace today; they consist of the Silent Generation, Baby Boom Generation, Generation X, and Generation Y. Generation Y, being the newest generation, is the least understood generation although marketers...

  6. Hybrid MPI/OpenMP parallel support vector machine training

    E-Print Network [OSTI]

    Kristian Woodsend

    2009-01-12T23:59:59.000Z

    Jan 12, 2009 ... A parallel implementation of Support Vector Machine training has been developed, using a combination of MPI and OpenMP. Using an interior...

  7. Optimization Online - Parallelizing the dual revised simplex method

    E-Print Network [OSTI]

    Q. Huangfu

    2015-03-06T23:59:59.000Z

    Mar 6, 2015 ... Abstract: This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear...

  8. Balanced Decomposition for Power System Simulation on Parallel Computers

    E-Print Network [OSTI]

    Catholic University of Chile (Universidad Catlica de Chile)

    industry and the associated academic research are requiring complex de- velopments in high performance computing tools, such as parallel computers, e cient compilers, graphic interfaces and algorithms including

  9. automated parallel performance: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Next Page Last Page Topic Index 1 Motivation Measuring Speedup Parallel Out of Mem Automation Introduction to High-Performance R Mathematics Websites Summary: Motivation...

  10. A parallel between two classes of pricing problems in transportation ...

    E-Print Network [OSTI]

    G raldine Heilporn

    2009-01-05T23:59:59.000Z

    Jan 5, 2009 ... A parallel between two classes of pricing problems in transportation and economics. G raldine Heilporn (Geraldine.Heilporn ***at*** hec.ca)

  11. advanced parallel processing: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Meets Markov Jaillet, Patrick 83 January 9, 2014 10:13 WSPCINSTRUCTION FILE ppl-benoit Parallel Processing Letters Physics Websites Summary: January 9, 2014 10:13...

  12. Massively parallel DNA sequencing: the new frontier in biogeography

    E-Print Network [OSTI]

    Rocha, Luiz A.; Bernal, Moiss A.; Gaither, Michelle R.; Alfaro, Michael E.

    2013-01-01T23:59:59.000Z

    2007)Popula? tion genomics: whole?genome analysis ofevolutionaryscales. BMC Genomics,13,403. Bickford,2012) Population genomics of parallel adaptation in

  13. Scalable Parallel File System for Data and Metadata-intensive...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Host: Rob Ross A critical purpose for parallel file systems used in high performance computing is to capture quickly and durably hold checkpoints of long running massive...

  14. Substantially parallel flux uncluttered rotor machines

    DOE Patents [OSTI]

    Hsu, John S.

    2012-12-11T23:59:59.000Z

    A permanent magnet-less and brushless synchronous system includes a stator that generates a magnetic rotating field when sourced by polyphase alternating currents. An uncluttered rotor is positioned within the magnetic rotating field and is spaced apart from the stator. An excitation core is spaced apart from the stator and the uncluttered rotor and magnetically couples the uncluttered rotor. The brushless excitation source generates a magnet torque by inducing magnetic poles near an outer peripheral surface of the uncluttered rotor, and the stator currents also generate a reluctance torque by a reaction of the difference between the direct and quadrature magnetic paths of the uncluttered rotor. The system can be used either as a motor or a generator

  15. Optimized data communications in a parallel computer

    DOE Patents [OSTI]

    Faraj, Daniel A.

    2014-08-19T23:59:59.000Z

    A parallel computer includes nodes that include a network adapter that couples the node in a point-to-point network and supports communications in opposite directions of each dimension. Optimized communications include: receiving, by a network adapter of a receiving compute node, a packet--from a source direction--that specifies a destination node and deposit hints. Each hint is associated with a direction within which the packet is to be deposited. If a hint indicates the packet to be deposited in the opposite direction: the adapter delivers the packet to an application on the receiving node; forwards the packet to a next node in the opposite direction if the receiving node is not the destination; and forwards the packet to a node in a direction of a subsequent dimension if the hints indicate that the packet is to be deposited in the direction of the subsequent dimension.

  16. Internode data communications in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Miller, Douglas R; Parker, Jeffrey J; Ratterman, Joseph D; Smith, Brian E

    2014-02-11T23:59:59.000Z

    Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory.

  17. Intranode data communications in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Miller, Douglas R; Ratterman, Joseph D; Smith, Brian E

    2013-07-23T23:59:59.000Z

    Intranode data communications in a parallel computer that includes compute nodes configured to execute processes, where the data communications include: allocating, upon initialization of a first process of a compute node, a region of shared memory; establishing, by the first process, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; sending, to a second process on the same compute node, a data communications message without determining whether the second process has been initialized, including storing the data communications message in the message buffer of the second process; and upon initialization of the second process: retrieving, by the second process, a pointer to the second process's message buffer; and retrieving, by the second process from the second process's message buffer in dependence upon the pointer, the data communications message sent by the first process.

  18. Intranode data communications in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Miller, Douglas R; Ratterman, Joseph D; Smith, Brian E

    2014-01-07T23:59:59.000Z

    Intranode data communications in a parallel computer that includes compute nodes configured to execute processes, where the data communications include: allocating, upon initialization of a first process of a computer node, a region of shared memory; establishing, by the first process, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; sending, to a second process on the same compute node, a data communications message without determining whether the second process has been initialized, including storing the data communications message in the message buffer of the second process; and upon initialization of the second process: retrieving, by the second process, a pointer to the second process's message buffer; and retrieving, by the second process from the second process's message buffer in dependence upon the pointer, the data communications message sent by the first process.

  19. Broadcasting a message in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Faraj, Ahmad A

    2013-04-16T23:59:59.000Z

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

  20. Internode data communications in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J.; Blocksome, Michael A.; Miller, Douglas R.; Parker, Jeffrey J.; Ratterman, Joseph D.; Smith, Brian E.

    2013-09-03T23:59:59.000Z

    Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory.

  1. Broadcasting a message in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Faraj, Daniel A

    2014-11-18T23:59:59.000Z

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

  2. Optimized data communications in a parallel computer

    DOE Patents [OSTI]

    Faraj, Daniel A

    2014-10-21T23:59:59.000Z

    A parallel computer includes nodes that include a network adapter that couples the node in a point-to-point network and supports communications in opposite directions of each dimension. Optimized communications include: receiving, by a network adapter of a receiving compute node, a packet--from a source direction--that specifies a destination node and deposit hints. Each hint is associated with a direction within which the packet is to be deposited. If a hint indicates the packet to be deposited in the opposite direction: the adapter delivers the packet to an application on the receiving node; forwards the packet to a next node in the opposite direction if the receiving node is not the destination; and forwards the packet to a node in a direction of a subsequent dimension if the hints indicate that the packet is to be deposited in the direction of the subsequent dimension.

  3. Parallel detecting, spectroscopic ellipsometers/polarimeters

    DOE Patents [OSTI]

    Furtak, Thomas E. (15927 W. Ellsworth, Golden, CO 80401)

    2002-01-01T23:59:59.000Z

    The parallel detecting spectroscopic ellipsometer/polarimeter sensor has no moving parts and operates in real-time for in-situ monitoring of the thin film surface properties of a sample within a processing chamber. It includes a multi-spectral source of radiation for producing a collimated beam of radiation directed towards the surface of the sample through a polarizer. The thus polarized collimated beam of radiation impacts and is reflected from the surface of the sample, thereby changing its polarization state due to the intrinsic material properties of the sample. The light reflected from the sample is separated into four separate polarized filtered beams, each having individual spectral intensities. Data about said four individual spectral intensities is collected within the processing chamber, and is transmitted into one or more spectrometers. The data of all four individual spectral intensities is then analyzed using transformation algorithms, in real-time.

  4. Parallelism of the SANDstorm hash algorithm.

    SciTech Connect (OSTI)

    Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree

    2009-09-01T23:59:59.000Z

    Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.

  5. Link failure detection in a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN); Megerian, Mark G. (Rochester, MN); Smith, Brian E. (Rochester, MN)

    2010-11-09T23:59:59.000Z

    Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

  6. Clock Agreement Among Parallel Supercomputer Nodes

    DOE Data Explorer [Office of Scientific and Technical Information (OSTI)]

    Jones, Terry R.; Koenig, Gregory A.

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  7. Clock Agreement Among Parallel Supercomputer Nodes

    SciTech Connect (OSTI)

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30T23:59:59.000Z

    This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

  8. Parallel multiscale simulations of a brain aneurysm

    SciTech Connect (OSTI)

    Grinberg, Leopold [Division of Applied Mathematics, Brown University, Providence, RI 02912 (United States)] [Division of Applied Mathematics, Brown University, Providence, RI 02912 (United States); Fedosov, Dmitry A. [Institute of Complex Systems and Institute for Advanced Simulation, Forschungszentrum Jlich, Jlich 52425 (Germany)] [Institute of Complex Systems and Institute for Advanced Simulation, Forschungszentrum Jlich, Jlich 52425 (Germany); Karniadakis, George Em, E-mail: george_karniadakis@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI 02912 (United States)

    2013-07-01T23:59:59.000Z

    Cardiovascular pathologies, such as a brain aneurysm, are affected by the global blood circulation as well as by the local microrheology. Hence, developing computational models for such cases requires the coupling of disparate spatial and temporal scales often governed by diverse mathematical descriptions, e.g., by partial differential equations (continuum) and ordinary differential equations for discrete particles (atomistic). However, interfacing atomistic-based with continuum-based domain discretizations is a challenging problem that requires both mathematical and computational advances. We present here a hybrid methodology that enabled us to perform the first multiscale simulations of platelet depositions on the wall of a brain aneurysm. The large scale flow features in the intracranial network are accurately resolved by using the high-order spectral element NavierStokes solver N??T?r. The blood rheology inside the aneurysm is modeled using a coarse-grained stochastic molecular dynamics approach (the dissipative particle dynamics method) implemented in the parallel code LAMMPS. The continuum and atomistic domains overlap with interface conditions provided by effective forces computed adaptively to ensure continuity of states across the interface boundary. A two-way interaction is allowed with the time-evolving boundary of the (deposited) platelet clusters tracked by an immersed boundary method. The corresponding heterogeneous solvers (N??T?r and LAMMPS) are linked together by a computational multilevel message passing interface that facilitates modularity and high parallel efficiency. Results of multiscale simulations of clot formation inside the aneurysm in a patient-specific arterial tree are presented. We also discuss the computational challenges involved and present scalability results of our coupled solver on up to 300 K computer processors. Validation of such coupled atomistic-continuum models is a main open issue that has to be addressed in future work.

  9. Data communications for a collective operation in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Faraj, Daniel A

    2013-07-16T23:59:59.000Z

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks, a data communications algorithm in dependence upon the constructed bit mask; and executing the collective instruction, transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  10. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Davis, Kristan D; Faraj, Daniel A

    2013-07-09T23:59:59.000Z

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and ranges of message sizes so that each algorithm is associated with a separate range of message sizes; receiving in an origin endpoint of the PAMI a data communications instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint, the data communications message characterized by a message size; selecting, from among the associated algorithms and ranges, a data communications algorithm in dependence upon the message size; and transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  11. Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A; Mamidala, Amith R

    2014-02-11T23:59:59.000Z

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  12. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-09-02T23:59:59.000Z

    Eager send data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.

  13. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-09-16T23:59:59.000Z

    Eager send data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.

  14. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Davis, Kristan D.; Faraj, Daniel A.

    2014-07-22T23:59:59.000Z

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and ranges of message sizes so that each algorithm is associated with a separate range of message sizes; receiving in an origin endpoint of the PAMI a data communications instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint, the data communications message characterized by a message size; selecting, from among the associated algorithms and ranges, a data communications algorithm in dependence upon the message size; and transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  15. Data communications in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Ratterman, Joseph D; Smith, Brian E

    2014-11-18T23:59:59.000Z

    Data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI and through data communications resources, including receiving in an origin endpoint of the PAMI a SEND instruction, the SEND instruction specifying a transmission of transfer data from the origin endpoint to a first target endpoint; transmitting from the origin endpoint to the first target endpoint a Request-To-Send (`RTS`) message advising the first target endpoint of the location and size of the transfer data; assigning by the first target endpoint to each of a plurality of target endpoints separate portions of the transfer data; and receiving by the plurality of target endpoints the transfer data.

  16. Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Blocksome, Michael A.; Mamidala, Amith R.

    2013-09-03T23:59:59.000Z

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  17. Parallel In Situ Indexing for Data-intensive Computing

    SciTech Connect (OSTI)

    Kim, Jinoh; Abbasi, Hasan; Chacon, Luis; Docan, Ciprian; Klasky, Scott; Liu, Qing; Podhorszki, Norbert; Shoshani, Arie; Wu, Kesheng

    2011-09-09T23:59:59.000Z

    As computing power increases exponentially, vast amount of data is created by many scientific re- search activities. However, the bandwidth for storing the data to disks and reading the data from disks has been improving at a much slower pace. These two trends produce an ever-widening data access gap. Our work brings together two distinct technologies to address this data access issue: indexing and in situ processing. From decades of database research literature, we know that indexing is an effective way to address the data access issue, particularly for accessing relatively small fraction of data records. As data sets increase in sizes, more and more analysts need to use selective data access, which makes indexing an even more important for improving data access. The challenge is that most implementations of in- dexing technology are embedded in large database management systems (DBMS), but most scientific datasets are not managed by any DBMS. In this work, we choose to include indexes with the scientific data instead of requiring the data to be loaded into a DBMS. We use compressed bitmap indexes from the FastBit software which are known to be highly effective for query-intensive workloads common to scientific data analysis. To use the indexes, we need to build them first. The index building procedure needs to access the whole data set and may also require a significant amount of compute time. In this work, we adapt the in situ processing technology to generate the indexes, thus removing the need of read- ing data from disks and to build indexes in parallel. The in situ data processing system used is ADIOS, a middleware for high-performance I/O. Our experimental results show that the indexes can improve the data access time up to 200 times depending on the fraction of data selected, and using in situ data processing system can effectively reduce the time needed to create the indexes, up to 10 times with our in situ technique when using identical parallel settings.

  18. Endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Cernohous, Bob R; Ratterman, Joseph D; Smith, Brian E

    2014-11-18T23:59:59.000Z

    Methods, apparatuses, and computer program products for endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface (`PAMI`) of a parallel computer are provided. Embodiments include establishing by a parallel application a data communications geometry, the geometry specifying a set of endpoints that are used in collective operations of the PAMI, including associating with the geometry a list of collective algorithms valid for use with the endpoints of the geometry. Embodiments also include registering in each endpoint in the geometry a dispatch callback function for a collective operation and executing without blocking, through a single one of the endpoints in the geometry, an instruction for the collective operation.

  19. The Parallel BGL: A Generic Library for Distributed Graph Computations

    E-Print Network [OSTI]

    Lumsdaine, Andrew

    ] and written in a style similar to the C++ Standard Template Library (STL) [38, 46], 1 #12;data types providedThe Parallel BGL: A Generic Library for Distributed Graph Computations Douglas Gregor and Andrew,lums}@osl.iu.edu Abstract This paper presents the Parallel BGL, a generic C++ library for distributed graph computation

  20. Design and Implementation of a Parallel Constraint Satisfaction Algorithm

    E-Print Network [OSTI]

    Hellebrand, Sybille

    simulator QSim. The presented parallel algorithm is based on partitioning the search space of a CSP into independent subspaces. These subspaces are then searched for solutions in parallel with a backtracking introduce a newpartitioning method, called variable-based partitioning (VBP). This method discards many

  1. A Methodology for the Derivation of Parallel Programs

    E-Print Network [OSTI]

    Goodman, Joy

    A Methodology for the Derivation of Parallel Programs Joy Goodman Department of Computer Science, University of Glasgow Abstract. I am currently developing a methodology for deriving paral­ lel programs from equational reasoning, a more efficient parallel program in a variety of languages and styles can be derived

  2. Parallel matrix inversion for the revised simplex method -A study

    E-Print Network [OSTI]

    Hall, Julian

    Parallel matrix inversion for the revised simplex method - A study Julian Hall School of Mathematics University of Edinburgh June 15th 2006 Parallel matrix inversion for the revised simplex method - a study #12;Overview Nature of the challenge of matrix inversion for the revised simplex method #12

  3. Parallel matrix inversion for the revised simplex method -A study

    E-Print Network [OSTI]

    Hall, Julian

    Parallel matrix inversion for the revised simplex method - A study Julian Hall School of Mathematics University of Edinburgh June 15th 2006 Parallel matrix inversion for the revised simplex method - a study #12;Overview Nature of the challenge of matrix inversion for the revised simplex method

  4. The Effect of Communication Time Delays in Parallel Computations

    E-Print Network [OSTI]

    in the literature. Various taxonomies of load balanc- ing algorithms exist. Direct methods examine the global a shared network. To make use of parallel computing resources, problems must be broken down into smaller Indexing System (CODIS) software are candidates for parallelization. New methods developed by Wang et al

  5. architecture parallele pour: Topics by E-print Network

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    architecture parallele pour First Page Previous Page 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Next Page Last Page Topic Index 1 CSCE 3030: Parallel...

  6. A Taxonomy of Parallel Prefix Networks David Harris

    E-Print Network [OSTI]

    Harris, David Money

    A Taxonomy of Parallel Prefix Networks David Harris Harvey Mudd College / Sun Microsystems of logic levels, fanout, and wiring tracks. This paper presents a three-dimensional taxonomy that not only for wide adders. This paper develops a taxonomy of parallel prefix networks based on stages, fanout

  7. G 2 MANIFOLDS WITH PARALLEL CHARACTERISTIC TORSION THOMAS FRIEDRICH

    E-Print Network [OSTI]

    Friedrich, Thomas

    these spaces admit a metric connec tion # c with totally skewsymmetric torsion and a spinor field #1 solvingG 2 MANIFOLDS WITH PARALLEL CHARACTERISTIC TORSION THOMAS FRIEDRICH Abstract. We classify 7dimensional cocalibrated G2manifolds with parallel char acteristic torsion and nonabelian holonomy. All

  8. Analyzing Parallelism and Domain Similarities in the MAREC Patent Corpus

    E-Print Network [OSTI]

    Riezler, Stefan

    Analyzing Parallelism and Domain Similarities in the MAREC Patent Corpus Katharina W}@cl.uni-heidelberg.de Abstract. Statistical machine translation of patents requires large a- mounts of sentence-parallel data. Translations of patent text often exist for parts of the patent document, namely title, abstract and claims

  9. A Lightweight, Scalable Grid Computing Framework for Parallel Bioinformatics Applications

    E-Print Network [OSTI]

    De Sterck, Hans

    and methods for solving large scientific and engineering problems on such parallel and distributed computersA Lightweight, Scalable Grid Computing Framework for Parallel Bioinformatics Applications Hans De Sterck Department of Applied Mathematics University of Waterloo Waterloo, Ontario N2L 3G1, Canada Email

  10. Comparison Between Synchronous and Asynchronous Implementation of Parallel Genetic Programming

    E-Print Network [OSTI]

    Fernandez, Thomas

    the processing time by using a coarse-grained model for parallelization and an asyn- chronous migration. The problem chosen to examine the parallel GP is a mobile robot navigation problem. The experimental results environments that were different from the original one. As a result, the substantial pro- cessing time

  11. Application of Parallel Imaging to Murine Magnetic Resonance Imaging

    E-Print Network [OSTI]

    Chang, Chieh-Wei 1980-

    2012-09-21T23:59:59.000Z

    . This dissertation describes foundational level work to enable parallel imaging of mice on a 4.7 Tesla/40 cm bore research scanner. Reducing the size of the hardware setup associated with typical parallel imaging was an integral part of achieving the work, as animal...

  12. Parallel Computation In Econometrics: A Simplified Approach Jurgen A. Doornik

    E-Print Network [OSTI]

    Wolfe, Patrick J.

    Parallel Computation In Econometrics: A Simplified Approach Jurgen A. Doornik , Neil Shephard Parallel computation has a long history in econometric computing, but is not at all wide spread. We believe optimization; Econometrics; High-performance computing; Matrix-programming language; Monte Carlo; MPI; Ox

  13. Parallel Picoliter RT-PCR Assays Using Microfluidics

    E-Print Network [OSTI]

    Quake, Stephen R.

    Parallel Picoliter RT-PCR Assays Using Microfluidics Joshua S. Marcus,, W. French Anderson The development of microfluidic tools for high-throughput nucleic acid analysis has become a burgeoning area of research in the post-genome era. Here, we have developed a microfluidic chip to perform 72 parallel 450-p

  14. OSCAR Parallelizing Compiler Cooperative Heterogeneous Multi-core Architecture

    E-Print Network [OSTI]

    Kasahara, Hironori

    OSCAR Parallelizing Compiler Cooperative Heterogeneous Multi-core Architecture Akihiro Hayashi,kamiyama,watanabe,takeshi,mase}@kasahara.cs.waseda.ac.jp 1. Background Heterogeneous multi-core architectures, which integrates multiple general purpose CPU, powerful parallelizing compiler for hetero- geneous multi-core architectures is expected. Furthermore

  15. Exploiting parallelism within multidimensional multirate digital signal processing systems

    E-Print Network [OSTI]

    Peng, Dongming

    2004-09-30T23:59:59.000Z

    . . . . . . . . . . . 4 a. Non-RAM-based Architectural Designs of Wavelet- Based Systems . . . . . . . . . . . . . . . . . . . 5 b. Achieving Intra-iteration Parallelism in Mul- tidimensional Multirate Systems . . . . . . . . . . 6 c. Exploiting Inter... for zerotree construction : 30 5 The systolic and parallel wavelet lters integrating low-pass and high-pass ltering : : : : : : : : : : : : : : : : : : : : : : : : : : : : 33 6 The architecture of Transpose Unit (TU) : : : : : : : : : : : : : : : 34 7...

  16. Parallel optical nanolithography using nanoscale bowtie aperture array

    E-Print Network [OSTI]

    Xu, Xianfan

    Parallel optical nanolithography using nanoscale bowtie aperture array Sreemanth M.V. Uppuluri of parallel optical nanolithography using nanoscale bowtie aperture array. These nanoscale bowtie aperture1805 photoresist. An interference-based optical alignment system was employed to position the bowtie

  17. Parallel FPGA Implementation of RSA with Residue Number Systems

    E-Print Network [OSTI]

    Parallel FPGA Implementation of RSA with Residue Number Systems --- Can sidechannel threats Multiplication based on Residue Num ber Systems. Thanks to RNS, we develop a design able to perform an RSA signature in parallel on a set of identical and independent copro cessors. Of independent interest, we

  18. Parallel FPGA Implementation of RSA with Residue Number Systems

    E-Print Network [OSTI]

    Parallel FPGA Implementation of RSA with Residue Number Systems -- Can side-channel threats Multiplication based on Residue Num- ber Systems. Thanks to RNS, we develop a design able to perform an RSA signature in parallel on a set of identical and independent copro- cessors. Of independent interest, we

  19. Parallel Kahler submanifolds of quaternionic Kahler symmetric spaces

    E-Print Network [OSTI]

    Alekseevsky, Dmiti

    is a full parallel Kahler submanifold of M . 2) If C = 0 then M = HPm and (M2m , J) is a Hermitian , with the canonical Tsukada imbedding into HPm as described in [Tsu2] . Thus, the classification of parallel K

  20. Parallel Formulations of Tree-Projection-Based Sequence Mining Algorithm

    E-Print Network [OSTI]

    Karypis, George

    , database projection algorithms, data mining, parallel processing This work was supported by NSF CCR-9972519 Institute. 1 #12;1 Introduction In recent years there has been an increased interest in using data miningParallel Formulations of Tree-Projection-Based Sequence Mining Algorithm Valerie Guralnik

  1. NDetermin: Inferring Nondeterministic Sequential Specifications for Parallelism Correctness

    E-Print Network [OSTI]

    Necula, George

    NDetermin: Inferring Nondeterministic Sequential Specifications for Parallelism Correctness Jacob and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post;NDetermin: Inferring Nondeterministic Sequential Specifications for Parallelism Correctness Jacob Burnim

  2. Wrench-Closure Workspace Generation for Cable Driven Parallel Manipulators using a Hybrid

    E-Print Network [OSTI]

    Melbourne, University of

    . The manipulator's movement is regulated through the actuation of the individual cables that are attached the dynamics, modelling and control of the system. In addition, cable mounting points at the base platform can). This limitation creates challenging problems in the control of the manipulator [15] and workspace #12

  3. J. Parallel Distrib. Comput. 64 (2004) 689691 Middleware: the key to next generation computing

    E-Print Network [OSTI]

    Sun, Xian-He

    made computing devices ever smaller and faster then before. However, after the dot com bubble, where

  4. A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle

    E-Print Network [OSTI]

    Lai, Lin

    2013-01-28T23:59:59.000Z

    Commercially available Hybrid Electric Vehicles (HEVs) have been around for more than ten years. However, their market share remains small. Focusing only on the improvement of fuel economy, the design tends to reduce the size of the internal...

  5. A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle

    E-Print Network [OSTI]

    Lai, Lin

    2013-01-28T23:59:59.000Z

    Commercially available Hybrid Electric Vehicles (HEVs) have been around for more than ten years. However, their market share remains small. Focusing only on the improvement of fuel economy, the design tends to reduce the size of the internal...

  6. Investigation of the Role of Trap States in Solar Cell Reliability using Photothermal Deflection Spectroscopy

    E-Print Network [OSTI]

    Bezryadina, Anna Sergeyevna

    2012-01-01T23:59:59.000Z

    electricity. The average cost per kWh (Kilowatt Hour) ofdirectly currently cost around $0.24 per kWh in Central and

  7. Assessment of Indoor Air Quality Benefits and Energy Costs of Mechanical Ventilation

    E-Print Network [OSTI]

    Logue, J.M.

    2012-01-01T23:59:59.000Z

    heating, given the higher cost per KWh for electricity, aaverage cost of electrical energy per kilowatt-hour (kWh) is

  8. Microsoft Word - CX-SnohomishPUD Equipment Purchase_140521

    Broader source: Energy.gov (indexed) [DOE]

    data acquisition equipment (including kilowatt hour quantity) Bay 15: three current transformers Bay 15: three voltage transformers Bay 2: SCADA 5 systems, plus Snohomish data...

  9. 2010 Wind Technologies Market Report

    E-Print Network [OSTI]

    Wiser, Ryan

    2012-01-01T23:59:59.000Z

    kilowatt-hour Midwest Independent System Operator megawattPJM), Midwest Independent System Operator (MISO), New Yorkin 2009. The Midwest Independent System Operator (MISO) (net

  10. DOE Office of Indian Energy Project Development and Finance Course...

    Broader source: Energy.gov (indexed) [DOE]

    renewable energy based on the electrical output of the project in kilowatt hours 10 PV - photovoltaic. This is a solar resource converter to electricity. R Remaining Life - the...

  11. Broadcasting collective operation contributions throughout a parallel computer

    DOE Patents [OSTI]

    Faraj, Ahmad (Rochester, MN)

    2012-02-21T23:59:59.000Z

    Methods, systems, and products are disclosed for broadcasting collective operation contributions throughout a parallel computer. The parallel computer includes a plurality of compute nodes connected together through a data communications network. Each compute node has a plurality of processors for use in collective parallel operations on the parallel computer. Broadcasting collective operation contributions throughout a parallel computer according to embodiments of the present invention includes: transmitting, by each processor on each compute node, that processor's collective operation contribution to the other processors on that compute node using intra-node communications; and transmitting on a designated network link, by each processor on each compute node according to a serial processor transmission sequence, that processor's collective operation contribution to the other processors on the other compute nodes using inter-node communications.

  12. Parallel Astronomical Data Processing with Python: Recipes for multicore machines

    E-Print Network [OSTI]

    Singh, Navtej; Butler, Ray

    2013-01-01T23:59:59.000Z

    High performance computing has been used in various fields of astrophysical research. But most of it is implemented on massively parallel systems (supercomputers) or graphical processing unit clusters. With the advent of multicore processors in the last decade, many serial software codes have been re-implemented in parallel mode to utilize the full potential of these processors. In this paper, we propose parallel processing recipes for multicore machines for astronomical data processing. The target audience are astronomers who are using Python as their preferred scripting language and who may be using PyRAF/IRAF for data processing. Three problems of varied complexity were benchmarked on three different types of multicore processors to demonstrate the benefits, in terms of execution time, of parallelizing data processing tasks. The native multiprocessing module available in Python makes it a relatively trivial task to implement the parallel code. We have also compared the three multiprocessing approaches - Po...

  13. Transparent runtime parallelization of the R scripting language

    SciTech Connect (OSTI)

    Yoginath, Srikanth B [ORNL

    2011-01-01T23:59:59.000Z

    Scripting languages such as R and Matlab are widely used in scientific data processing. As the data volume and the complexity of analysis tasks both grow, sequential data processing using these tools often becomes the bottleneck in scientific workflows. We describe pR, a runtime framework for automatic and transparent parallelization of the popular R language used in statistical computing. Recognizing scripting languages interpreted nature and data analysis codes use pattern, we propose several novel techniques: (1) applying parallelizing compiler technology to runtime, whole-program dependence analysis of scripting languages, (2) incremental code analysis assisted with evaluation results, and (3) runtime parallelization of file accesses. Our framework does not require any modification to either the source code or the underlying R implementation. Experimental results demonstrate that pR can exploit both task and data parallelism transparently and overall has better performance as well as scalability compared to an existing parallel R package that requires code modification.

  14. Does Anti-Parallel Spin Always Contain more Information ?

    E-Print Network [OSTI]

    Sibasish Ghosh; Anirban Roy; Ujjwal Sen

    2000-05-09T23:59:59.000Z

    We show that the Bloch vectors lying on any great circle is the largest set S(L) for which the parallel states |n,n> can always be transformed into the anti-parallel states |n,-n>. Thus more information about the Bloch vector is not extractable from |n,-n> than from |n,n> by any measuring strategy, for the Bloch vector belonging to S(L). Surprisingly, the largest set of Bloch vectors for which the corresponding qubits can be flipped is again S(L). We then show that probabilistic exact parallel to anti-parallel transformation is not possible if the corresponding anti-parallel spins span the whole Hilbert space of the two qubits. These considerations allow us to generalise a conjecture of Gisin and Popescu (Phys. Rev. Lett. 83 432 (1999)).

  15. Generator stator core vent duct spacer posts

    DOE Patents [OSTI]

    Griffith, John Wesley (Schenectady, NY); Tong, Wei (Clifton Park, NY)

    2003-06-24T23:59:59.000Z

    Generator stator cores are constructed by stacking many layers of magnetic laminations. Ventilation ducts may be inserted between these layers by inserting spacers into the core stack. The ventilation ducts allow for the passage of cooling gas through the core during operation. The spacers or spacer posts are positioned between groups of the magnetic laminations to define the ventilation ducts. The spacer posts are secured with longitudinal axes thereof substantially parallel to the core axis. With this structure, core tightness can be assured while maximizing ventilation duct cross section for gas flow and minimizing magnetic loss in the spacers.

  16. Particle Transport in Parallel-Plate Reactors

    SciTech Connect (OSTI)

    Rader, D.J.; Geller, A.S.

    1999-08-01T23:59:59.000Z

    A major cause of semiconductor yield degradation is contaminant particles that deposit on wafers while they reside in processing tools during integrated circuit manufacturing. This report presents numerical models for assessing particle transport and deposition in a parallel-plate geometry characteristic of a wide range of single-wafer processing tools: uniform downward flow exiting a perforated-plate showerhead separated by a gap from a circular wafer resting on a parallel susceptor. Particles are assumed to originate either upstream of the showerhead or from a specified position between the plates. The physical mechanisms controlling particle deposition and transport (inertia, diffusion, fluid drag, and external forces) are reviewed, with an emphasis on conditions encountered in semiconductor process tools (i.e., sub-atmospheric pressures and submicron particles). Isothermal flow is assumed, although small temperature differences are allowed to drive particle thermophoresis. Numerical solutions of the flow field are presented which agree with an analytic, creeping-flow expression for Re < 4. Deposition is quantified by use of a particle collection efficiency, which is defined as the fraction of particles in the reactor that deposit on the wafer. Analytic expressions for collection efficiency are presented for the limiting case where external forces control deposition (i.e., neglecting particle diffusion and inertia). Deposition from simultaneous particle diffusion and external forces is analyzed by an Eulerian formulation; for creeping flow and particles released from a planar trap, the analysis yields an analytic, integral expression for particle deposition based on process and particle properties. Deposition from simultaneous particle inertia and external forces is analyzed by a Lagrangian formulation, which can describe inertia-enhanced deposition resulting from particle acceleration in the showerhead. An approximate analytic expression is derived for particle velocity at the showerhead exit as a function of showerhead geometry, flow rate, and gas and particle properties. The particle showerhead-exit velocity is next used as an initial condition for particle transport between the plates to determine whether the particle deposits on the wafer, as a function of shower-head-exit particle velocity, the plate separation, flow rate, and gas and particle properties. Based on the numerical analysis, recommendations of best practices are presented that should help tool operators and designers reduce particle deposition in real tools. These guidelines are not intended to replace detailed calculations, but to provide the user with a general feel for inherently-clean practices.

  17. Generation gaps in engineering?

    E-Print Network [OSTI]

    Kim, David J. (David Jinwoo)

    2008-01-01T23:59:59.000Z

    There is much enthusiastic debate on the topic of generation gaps in the workplace today; what the generational differences are, how to address the apparent challenges, and if the generations themselves are even real. ...

  18. Stochastic Acceleration in Relativistic Parallel Shocks

    E-Print Network [OSTI]

    Joni J. P. Virtanen; Rami Vainio

    2004-11-08T23:59:59.000Z

    (abridged) We present results of test-particle simulations on both the first and the second order Fermi acceleration at relativistic parallel shock waves. We consider two scenarios for particle injection: (i) particles injected at the shock front, then accelerated at the shock by the first order mechanism and subsequently by the stochastic process in the downstream region; and (ii) particles injected uniformly throughout the downstream region to the stochastic process. We show that regardless of the injection scenario, depending on the magnetic field strength, plasma composition, and the employed turbulence model, the stochastic mechanism can have considerable effects on the particle spectrum on temporal and spatial scales too short to be resolved in extragalactic jets. Stochastic acceleration is shown to be able to produce spectra that are significantly flatter than the limiting case of particle energy spectral index -1 of the first order mechanism. Our study also reveals a possibility of re-acceleration of the stochastically accelerated spectrum at the shock, as particles at high energies become more and more mobile as their mean free path increases with energy. Our findings suggest that the role of the second order mechanism in the turbulent downstream of a relativistic shock with respect to the first order mechanism at the shock front has been underestimated in the past, and that the second order mechanism may have significant effects on the form of the particle spectra and its evolution.

  19. Symmetry related dynamics in parallel shear flows

    E-Print Network [OSTI]

    Tobias Kreilos; Stefan Zammert; Bruno Eckhardt

    2014-04-23T23:59:59.000Z

    Parallel shear flows come with continuous symmetries of translation in the downstream and spanwise direction. As a consequence, flow states that differ in their spanwise or downstream location but are otherwise identical are dynamically equivalent. In the case of travelling waves, this trivial degree of freedom can be removed by going to a frame of reference that moves with the state, thereby turning the travelling wave in the laboratory frame to a fixed point in the comoving frame of reference. We here discuss a general method by which the translational displacements can be removed also for more complicated and dynamically active states and demonstrate its application for several examples. For flows states in the asymptotic suction boundary layer we show that in the case of the long-period oscillatory edge state we can find local phase speeds which remove the fast oscillations and reveal the slow vortex dynamics underlying the burst phenomenon. For spanwise translating states we show that the method removes the drift but not the dynamical events that cause the big spanwise displacement. For a turbulent case we apply the method to the spanwise shifts and find slow components that are correlated over very long times. Calculations for plane Poiseuille flow show that the long correlations in the transverse motions are not special to the asymptotic suction boundary layer.

  20. Small Generator Aggregation (Maine)

    Broader source: Energy.gov [DOE]

    This section establishes requirements for electricity providers to purchase electricity from small generators, with the goal of ensuring that small electricity generators (those with a nameplate...

  1. Hydrogen and electricity: Parallels, interactions,and convergence

    E-Print Network [OSTI]

    Yang, Christopher

    2008-01-01T23:59:59.000Z

    the network of electricity generation plants that determinesredundancy in electricity generation plants. The diversionelectricity generation can come from baseload, intermediate or peaking power plants

  2. A Parallel Coiled-Coil Tetramer with Offset Helices

    SciTech Connect (OSTI)

    Liu,J.; Deng, Y.; Zheng, Q.; Cheng, C.; Kallenbach, N.; Lu, M.

    2006-01-01T23:59:59.000Z

    Specific helix-helix interactions are fundamental in assembling the native state of proteins and in protein-protein interfaces. Coiled coils afford a unique model system for elucidating principles of molecular recognition between {alpha} helices. The coiled-coil fold is specified by a characteristic seven amino acid repeat containing hydrophobic residues at the first (a) and fourth (d) positions. Nonpolar side chains spaced three and four residues apart are referred to as the 3-4 hydrophobic repeat. The presence of apolar amino acids at the e or g positions (corresponding to a 3-3-1 hydrophobic repeat) can provide new possibilities for close-packing of {alpha}-helices that includes examples such as the lac repressor tetramerization domain. Here we demonstrate that an unprecedented coiled-coil interface results from replacement of three charged residues at the e positions in the dimeric GCN4 leucine zipper by nonpolar valine side chains. Equilibrium circular dichroism and analytical ultracentrifugation studies indicate that the valine-containing mutant forms a discrete {alpha}-helical tetramer with a significantly higher stability than the parent leucine-zipper molecule. The 1.35 {angstrom} resolution crystal structure of the tetramer reveals a parallel four-stranded coiled coil with a three-residue interhelical offset. The local packing geometry of the three hydrophobic positions in the tetramer conformation is completely different from that seen in classical tetrameric structures yet bears resemblance to that in three-stranded coiled coils. These studies demonstrate that distinct van der Waals interactions beyond the a and d side chains can generate a diverse set of helix-helix interfaces and three-dimensional supercoil structures.

  3. Xyce Parallel Electronic Simulator : users' guide, version 4.1.

    SciTech Connect (OSTI)

    Mei, Ting; Rankin, Eric Lamont; Thornquist, Heidi K.; Santarelli, Keith R.; Fixel, Deborah A.; Coffey, Todd Stirling; Russo, Thomas V.; Schiek, Richard Louis; Keiter, Eric Richard; Pawlowski, Roger Patrick

    2009-02-01T23:59:59.000Z

    This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: (1) Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers. (2) Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. (3) Device models which are specifically tailored to meet Sandia's needs, including some radiation-aware devices (for Sandia users only). (4) Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an 'in-house' capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory.

  4. Xyce parallel electronic simulator : users' guide. Version 5.1.

    SciTech Connect (OSTI)

    Mei, Ting; Rankin, Eric Lamont; Thornquist, Heidi K.; Santarelli, Keith R.; Fixel, Deborah A.; Coffey, Todd Stirling; Russo, Thomas V.; Schiek, Richard Louis; Keiter, Eric Richard; Pawlowski, Roger Patrick

    2009-11-01T23:59:59.000Z

    This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: (1) Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers. (2) Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. (3) Device models which are specifically tailored to meet Sandia's needs, including some radiation-aware devices (for Sandia users only). (4) Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an 'in-house' capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory.

  5. A novel scheme for rapid parallel parameter estimation of gravitational waves from compact binary coalescences

    E-Print Network [OSTI]

    Pankow, C; Ochsner, E; O'Shaughnessy, R

    2015-01-01T23:59:59.000Z

    We introduce a highly-parallelizable architecture for estimating parameters of compact binary coalescence using gravitational-wave data and waveform models. Using a spherical harmonic mode decomposition, the waveform is expressed as a sum over modes that depend on the intrinsic parameters (e.g. masses) with coefficients that depend on the observer dependent extrinsic parameters (e.g. distance, sky position). The data is then prefiltered against those modes, at fixed intrinsic parameters, enabling efficiently evaluation of the likelihood for generic source positions and orientations, independent of waveform length or generation time. We efficiently parallelize our intrinsic space calculation by integrating over all extrinsic parameters using a Monte Carlo integration strategy. Since the waveform generation and prefiltering happens only once, the cost of integration dominates the procedure. Also, we operate hierarchically, using information from existing gravitational-wave searches to identify the regions of pa...

  6. Tile-based Level of Detail for the Parallel Age

    SciTech Connect (OSTI)

    Niski, K; Cohen, J D

    2007-08-15T23:59:59.000Z

    Today's PCs incorporate multiple CPUs and GPUs and are easily arranged in clusters for high-performance, interactive graphics. We present an approach based on hierarchical, screen-space tiles to parallelizing rendering with level of detail. Adapt tiles, render tiles, and machine tiles are associated with CPUs, GPUs, and PCs, respectively, to efficiently parallelize the workload with good resource utilization. Adaptive tile sizes provide load balancing while our level of detail system allows total and independent management of the load on CPUs and GPUs. We demonstrate our approach on parallel configurations consisting of both single PCs and a cluster of PCs.

  7. Wavelet analyses using parallel computing for plasma turbulence studies

    SciTech Connect (OSTI)

    Fujisawa, A.; Inagaki, S.; Matsuoka, K.; Itoh, S.-I. [Research Institute for Applied Mechanics and Itoh Research Center for Plasma Turbulence, Kyushu University, Kasuga-kouen, Kasuga 816-8580 (Japan); Shimizu, A.; Itoh, K. [National Institute for Fusion Science, Oroshi-cho, Toki-shi 509-52 (Japan); Nagashima, Y.; Yamada, T. [Graduate School of Frontier Sciences, University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa-shi, Chiba 277-8561 (Japan)

    2010-10-15T23:59:59.000Z

    The wavelet analyses have been carried out, using a cluster of personal computer, on the signal of electric field fluctuations measured with heavy ion beam probes in the compact helical system stellarator. The results have revealed the intermittent characteristics of turbulence and of the nonlinear couplings between elemental waves of turbulence. The usage of parallel computing is found to successfully reduce the calculation time as inversely proportional to the CPU number used the cluster, which shows the nature of 'embarrassingly parallel computation'. The present example of the wavelet analyses clearly demonstrates the importance of the advanced analyzing methods and the parallel computation for the modern studies of plasma turbulence.

  8. Parallel Multiphysics Simulations of Charged Particles in Microfluidic Flows

    E-Print Network [OSTI]

    Bartuschat, Dominik

    2014-01-01T23:59:59.000Z

    The article describes parallel multiphysics simulations of charged particles in microfluidic flows with the waLBerla framework. To this end, three physical effects are coupled: rigid body dynamics, fluid flow modelled by a lattice Boltzmann algorithm, and electric potentials represented by a finite volume discretisation. For solving the finite volume discretisation for the electrostatic forces, a cell-centered multigrid algorithm is developed that conforms to the lattice Boltzmann meshes and the parallel communication structure of waLBerla. The new functionality is validated with suitable benchmark scenarios. Additionally, the parallel scaling and the numerical efficiency of the algorithms are analysed on an advanced supercomputer.

  9. TECA: A Parallel Toolkit for Extreme Climate Analysis

    SciTech Connect (OSTI)

    Prabhat, Mr; Ruebel, Oliver; Byna, Surendra; Wu, Kesheng; Li, Fuyu; Wehner, Michael; Bethel, E. Wes

    2012-03-12T23:59:59.000Z

    We present TECA, a parallel toolkit for detecting extreme events in large climate datasets. Modern climate datasets expose parallelism across a number of dimensions: spatial locations, timesteps and ensemble members. We design TECA to exploit these modes of parallelism and demonstrate a prototype implementation for detecting and tracking three classes of extreme events: tropical cyclones, extra-tropical cyclones and atmospheric rivers. We process a modern TB-sized CAM5 simulation dataset with TECA, and demonstrate good runtime performance for the three case studies.

  10. Generation to Generation: The Heart of Family Medicine

    E-Print Network [OSTI]

    Winter, Robin O

    2012-01-01T23:59:59.000Z

    Ageism in the Workplace. Generations Spring, 5. Westman,of caring for multiple generations simultaneously. StronglyGeneration to Generation: The Heart of Family Medicine

  11. Parallel I/O Software Infrastructure for Large-Scale Systems

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Parallel IO Software Infrastructure for Large-Scale Systems Parallel IO Software Infrastructure for Large-Scale Systems | Tags: Math & Computer Science Choudhary.png An...

  12. final report for Center for Programming Models for Scalable Parallel Computing

    SciTech Connect (OSTI)

    Johnson, Ralph E

    2013-04-10T23:59:59.000Z

    This is the final report of the work on parallel programming patterns that was part of the Center for Programming Models for Scalable Parallel Computing

  13. Gamma ray generator

    DOE Patents [OSTI]

    Firestone, Richard B; Reijonen, Jani

    2014-05-27T23:59:59.000Z

    An embodiment of a gamma ray generator includes a neutron generator and a moderator. The moderator is coupled to the neutron generator. The moderator includes a neutron capture material. In operation, the neutron generator produces neutrons and the neutron capture material captures at least some of the neutrons to produces gamma rays. An application of the gamma ray generator is as a source of gamma rays for calibration of gamma ray detectors.

  14. Endpoint-based parallel data processing with non-blocking collective instructions in a parallel active messaging interface of a parallel computer

    DOE Patents [OSTI]

    Archer, Charles J; Blocksome, Michael A; Cernohous, Bob R; Ratterman, Joseph D; Smith, Brian E

    2014-11-11T23:59:59.000Z

    Endpoint-based parallel data processing with non-blocking collective instructions in a PAMI of a parallel computer is disclosed. The PAMI is composed of data communications endpoints, each including a specification of data communications parameters for a thread of execution on a compute node, including specifications of a client, a context, and a task. The compute nodes are coupled for data communications through the PAMI. The parallel application establishes a data communications geometry specifying a set of endpoints that are used in collective operations of the PAMI by associating with the geometry a list of collective algorithms valid for use with the endpoints of the geometry; registering in each endpoint in the geometry a dispatch callback function for a collective operation; and executing without blocking, through a single one of the endpoints in the geometry, an instruction for the collective operation.

  15. Design algorithms for parallel transmission in magnetic resonance imaging

    E-Print Network [OSTI]

    Setsompop, Kawin

    2008-01-01T23:59:59.000Z

    The focus of this dissertation is on the algorithm design, implementation, and validation of parallel transmission technology in Magnetic Resonance Imaging (MRI). Novel algorithms are proposed which yield excellent excitation ...

  16. Optimized control studies of a parallel hybrid electric vehicle

    E-Print Network [OSTI]

    Bougler, Benedicte Bernadette

    1995-01-01T23:59:59.000Z

    This thesis addresses the development of a control scheme to maximize automobile fuel economy and battery state-of-charge (SOC) while meeting exhaust emission standards for parallel hybrid electric vehicles, which are an alternative to conventional...

  17. A parallel hypothesis method of autonomous underwater vehicle navigation

    E-Print Network [OSTI]

    LaPointe, Cara Elizabeth Grupe

    2009-01-01T23:59:59.000Z

    This research presents a parallel hypothesis method for autonomous underwater vehicle navigation that enables a vehicle to expand the operating envelope of existing long baseline acoustic navigation systems by incorporating ...

  18. Optimization Online - Parallel distributed-memory simplex for large ...

    E-Print Network [OSTI]

    Miles Lubin

    2012-04-17T23:59:59.000Z

    Apr 17, 2012 ... Parallel distributed-memory simplex for large-scale stochastic LP problems. Miles Lubin (mlubin ***at*** mcs.anl.gov) J. A. Julian Hall (j.a.j.hall...

  19. Large-Scale Molecular Dynamics Simulations for Highly Parallel Infrastructures

    E-Print Network [OSTI]

    Pazrikov, Jana

    2014-01-01T23:59:59.000Z

    Computational chemistry allows researchers to experiment in sillico: by running a computer simulations of a biological or chemical processes of interest. Molecular dynamics with molecular mechanics model of interactions simulates N-body problem of atoms$-$it computes movements of atoms according to Newtonian physics and empirical descriptions of atomic electrostatic interactions. These simulations require high performance computing resources, as evaluations within each step are computationally demanding and billions of steps are needed to reach interesting timescales. Current methods decompose the spatial domain of the problem and calculate on parallel/distributed infrastructures. Even the methods with the highest strong scaling hit the limit at half a million cores: they are not able to cut the time to result if provided with more processors. At the dawn of exascale computing with massively parallel computational resources, we want to increase the level of parallelism by incorporating parallel-in-time comput...

  20. Reducing Concurrency Bottlenecks in Parallel I/O Workloads

    SciTech Connect (OSTI)

    Manzanares, Adam C. [Los Alamos National Laboratory; Bent, John M. [Los Alamos National Laboratory; Wingate, Meghan [Los Alamos National Laboratory

    2011-01-01T23:59:59.000Z

    To enable high performance parallel checkpointing we introduced the Parallel Log Structured File System (PLFS). PLFS is middleware interposed on the file system stack to transform concurrent writing of one application file into many non-concurrently written component files. The promising effectiveness of PLFS makes it important to examine its performance for workloads other than checkpoint capture, notably the different ways that state snapshots may be later read, to make the case for using PLFS in the Exascale I/O stack. Reading a PLFS file involved reading each of its component files. In this paper we identify performance limitations on broader workloads in an early version of PLFS, specifically the need to build and distribute an index for the overall file, and the pressure on the underlying parallel file system's metadata server, and show how PLFS's decomposed components architecture can be exploited to alleviate bottlenecks in the underlying parallel file system.

  1. Evaluation of Parallel Decomposition Methods for Biomechanical Optimizations

    E-Print Network [OSTI]

    George, Alan D.

    that parallelizes the analysis function (i.e., a kinematic or dynamic simulation) called repeatedly by the optimizer , Jeffrey A. Reinbolt2,3 , Benjamin J. Fregly2,3 , and Alan D. George1 1 Department of Electrical & Computer

  2. A parallel fast multipole method for elliptic difference Sebastian Liska

    E-Print Network [OSTI]

    Colonius, Tim

    A parallel fast multipole method for elliptic difference equations Sebastian Liska , Tim Colonius Abstract A new fast multipole formulation for solving elliptic difference equations on unbounded domains multipole method. Unlike other fast multipole algorithms, our approach exploits the regularity

  3. RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging

    E-Print Network [OSTI]

    Liu, Yinan

    2012-07-16T23:59:59.000Z

    Parallel excitation is an emerging technique to improve or accelerate multi-dimensional spatially selective excitations in magnetic resonance imaging (MRI) using multi-channel transmit arrays. The technique has potential in many applications...

  4. A hybrid parallel framework for computational solid mechanics

    E-Print Network [OSTI]

    Fidkowski, Piotr

    2011-01-01T23:59:59.000Z

    A novel, hybrid parallel C++ framework for computational solid mechanics is developed and presented. The modular and extensible design of this framework allows it to support a wide variety of numerical schemes including ...

  5. Parallel Stochastic Gradient Algorithms for Large-Scale Matrix ...

    E-Print Network [OSTI]

    2013-03-21T23:59:59.000Z

    parallel implementation that admits a speed-up nearly proportional to the ... On large-scale matrix completion tasks, Jellyfish is orders of magnitude more ...... get a consistent build of NNLS with mex optimizations at the time of this submission.

  6. Thread Scheduling Mechanisms for Multiple-Context Parallel Processors

    E-Print Network [OSTI]

    Fiske, James A. Stuart

    1995-06-01T23:59:59.000Z

    Scheduling tasks to efficiently use the available processor resources is crucial to minimizing the runtime of applications on shared-memory parallel processors. One factor that contributes to poor processor utilization ...

  7. Some applications of pipelining techniques in parallel scientific computing

    E-Print Network [OSTI]

    Deng, Yuanhua

    1996-01-01T23:59:59.000Z

    In this thesis, we study the applicability of pipelining techniques to the development of parallel algorithms for scientific computation. General principles for pipelining techniques are discussed and two applications, Gram-Schmidt orthogonalization...

  8. Design and Evaluation of the Hamal Parallel Computer

    E-Print Network [OSTI]

    Grossman, J.P.

    2002-12-05T23:59:59.000Z

    Parallel shared-memory machines with hundreds or thousands of processor-memory nodes have been built; in the future we will see machines with millions or even billions of nodes. Associated with such large systems is a new ...

  9. Design and evaluation of the Hamal parallel computer

    E-Print Network [OSTI]

    Grossman, J. P., 1973-

    2003-01-01T23:59:59.000Z

    Parallel shared-memory machines with hundreds or thousands of processor-memory nodes have been built; in the future we will see machines with millions or even billions of nodes. Associated with such large systems is a new ...

  10. Some applications of pipelining techniques in parallel scientific computing

    E-Print Network [OSTI]

    Deng, Yuanhua

    1996-01-01T23:59:59.000Z

    In this thesis, we study the applicability of pipelining techniques to the development of parallel algorithms for scientific computation. General principles for pipelining techniques are discussed and two applications, Gram-Schmidt orthogonalization...

  11. Implementation and testing of a parallel layer peeling algorithm

    E-Print Network [OSTI]

    Gandapur, Tasneem Kausar

    1996-01-01T23:59:59.000Z

    events into account. Two different implementations of the above mentioned serial algorithm viz., Layer Peeling and Characteristic Tracing have been previously described, and the characteristic tracing method has been implemented in parallel...

  12. Shot level parallelization of a seismic inversion code using PVM

    SciTech Connect (OSTI)

    Versteeg, R.J.; Gockenback, M.; Symes, W.W. [Rice Univ., Houston, TX (United States); Kern, M. [Inria, Le Chesnay (France)

    1994-12-31T23:59:59.000Z

    This paper presents experience with parallelization using PVM of DSO, a seismic inversion code developed in The Rice Inversion Project. It focuses on one aspect: trying to run efficiently on a cluster of 4 workstations. The authors use a coarse grain parallelism in which they dynamically distribute the shots over the available machines in the cluster. The modeling and migration of their code is parallelized very effectively by this strategy; they have reached a overall performance of 104 Mflops using a configuration of one manager with 3 workers, a speedup of 2.4 versus the serial version, which according to Amdahl`s law is optimal given the current design of their code. Further speedup is currently limited by the non parallelized part of their code optimization, linear algebra and i(o).

  13. Natural convection flows in parallel connected vertical channels with boiling

    E-Print Network [OSTI]

    Eselgroth, Peter Ward

    1967-01-01T23:59:59.000Z

    The steady-state flow configuration in an array of parallel heated channels is examined with the objective of predicting the behavior of a reactor during a loss of flow accident. A method of combining the results of single ...

  14. Scalable Parallel Algorithms for Massive Scale-free Graphs

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

  15. Circuit and bond polytopes on series-parallel graphs$

    E-Print Network [OSTI]

    2014-07-10T23:59:59.000Z

    Jul 10, 2014 ... If G is a non trivial 2-connected series-parallel graph, an open nested ear decomposition ... no interior point of an ear Ei belongs to Ej for all j < i,.

  16. Provably good race detection that runs in parallel

    E-Print Network [OSTI]

    Fineman, Jeremy T

    2005-01-01T23:59:59.000Z

    A multithreaded parallel program that is intended to be deterministic may exhibit nondeterminism clue to bugs called determinacy races. A key capability of race detectors is to determine whether one thread executes logically ...

  17. Intelligent energy management agent for a parallel hybrid vehicle

    E-Print Network [OSTI]

    Won, Jong-Seob

    2004-09-30T23:59:59.000Z

    This dissertation proposes an Intelligent Energy Management Agent (IEMA) for parallel hybrid vehicles. A key concept adopted in the development of an IEMA is based on the premise that driving environment would affect fuel ...

  18. Scalable Parallel Algorithms for Massive Scale-free Graphs

    E-Print Network [OSTI]

    Pearce, Roger Allan

    2013-12-05T23:59:59.000Z

    , distributed, and external memory. This dissertation develops new techniques to parallelize the storage, computation, and communication for scale-free graphs with high-degree vertices. Our work facilitates the processing of large real-world graph datasets...

  19. Parallel-Flow-Shear Driven Low-Frequency Plasma Instability

    SciTech Connect (OSTI)

    Ishiguro, Seiji [Theory and Computer Simulation Center, National Institute for Fusion Science, Toki-shi, Gifu 509-5292 (Japan); Matsumoto, Noriaki; Kaneko, Toshiro; Hatakeyama, Rikizo [Department of Electronic Engineering, Tohoku University, Sendai 980-8579 (Japan)

    2004-12-01T23:59:59.000Z

    Full three dimensional Particle-in-Cell (PIC) simulations are performed in order to investigate effects of field-aligned (parallel) ion flow shears on low-frequency plasma instabilities. It is shown that the parallel ion flow velocity shear can induce the ion-acoustic instability, even when the ion flow velocity is so small that the instability can not take place. Simulation results are consistent with the analysis based on the local theory.

  20. Shift: A Massively Parallel Monte Carlo Radiation Transport Package

    SciTech Connect (OSTI)

    Pandya, Tara M [ORNL; Johnson, Seth R [ORNL; Davidson, Gregory G [ORNL; Evans, Thomas M [ORNL; Hamilton, Steven P [ORNL

    2015-01-01T23:59:59.000Z

    This paper discusses the massively-parallel Monte Carlo radiation transport package, Shift, de- veloped at Oak Ridge National Laboratory. It reviews the capabilities, implementation, and parallel performance of this code package. Scaling results demonstrate very good strong and weak scaling behavior of the implemented algorithms. Benchmark results from various reactor problems show that Shift results compare well to other contemporary Monte Carlo codes and experimental results.

  1. Instruction sets for Parallel Random Access Machines. Doctoral thesis

    SciTech Connect (OSTI)

    Trahan, J.L.

    1988-08-01T23:59:59.000Z

    An important model of parallel computation is the Parallel Random Access Machine (PRAM), which comprises multiple processors that execute instructions synchronously and share a common memory. Formalized by Fortune and Wyllie (1978) and Goldschlager (1982), the PRAM is a much more natural model of parallel computation than older models such as combinational circuits and alternating Turing machines (Ruzzo, 1981) because the PRAM abstracts the salient features of a modern multiprocessor computer. Eventually an algorithm developed for the PRAM can be implemented on a parallel network computer such as a mesh-connected array computer (Thompson and Kung, 1977), a hypercube machine (Seitz, 1985), a cube-connected cycles machine (Preparata and Vuillemin, 1981) or a bounded degree processor network (Alt et al., 1987); on all network computers the routing of data complicates the implementation of algorithms. The PRAM provides the foundation for the design of highly parallel algorithms (Luby, 1986; Miller and Reif, 1985; among many others). This model permits the exposure of the intrinsic parallelism in a computational problem because it simplifies the communication of data through a shared memory. To quantify differences in computational performance, the time complexities of simulations between PRAMS with different instruction sets are determined. Focus is on the computational complexity of simulations between PRAMs with the following operations: multiplication, division, arbitrary left shift, arbitrary right shift, and probabilistic choice.

  2. Allinea DDT as a Parallel Debugging Alternative to Totalview

    SciTech Connect (OSTI)

    Antypas, K.B.

    2007-03-05T23:59:59.000Z

    Totalview, from the Etnus Corporation, is a sophisticated and feature rich software debugger for parallel applications. As Totalview has gained in popularity and market share its pricing model has increased to the point where it is often prohibitively expensive for massively parallel supercomputers. Additionally, many of Totalview's advanced features are not used by members of the scientific computing community. For these reasons, supercomputing centers have begun to search for a basic parallel debugging tool which can be used as an alternative to Totalview. As the cost and complexity of Totalview has increased over the years, scientific computing centers have started searching for a viable parallel debugging alternative. DDT (Distributed Debugging Tool) from Allinea Software is a relatively new parallel debugging tool which aims to provide much of the same functionality as Totalview. This review outlines the basic features and limitations of DDT to determine if it can be a reasonable substitute for Totalview. DDT was tested on the NERSC platforms Bassi, Seaborg, Jacquard and Davinci with Fortran90, C, and C++ codes using MPI and OpenMP for parallelism.

  3. Cylindrical neutron generator

    DOE Patents [OSTI]

    Leung, Ka-Ngo (Hercules, CA)

    2008-04-22T23:59:59.000Z

    A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.

  4. Cylindrical neutron generator

    DOE Patents [OSTI]

    Leung, Ka-Ngo (Hercules, CA)

    2009-12-29T23:59:59.000Z

    A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.

  5. Cylindrical neutron generator

    DOE Patents [OSTI]

    Leung, Ka-Ngo

    2005-06-14T23:59:59.000Z

    A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.

  6. Parallel object-oriented data mining system

    DOE Patents [OSTI]

    Kamath, Chandrika; Cantu-Paz, Erick

    2004-01-06T23:59:59.000Z

    A data mining system uncovers patterns, associations, anomalies and other statistically significant structures in data. Data files are read and displayed. Objects in the data files are identified. Relevant features for the objects are extracted. Patterns among the objects are recognized based upon the features. Data from the Faint Images of the Radio Sky at Twenty Centimeters (FIRST) sky survey was used to search for bent doubles. This test was conducted on data from the Very Large Array in New Mexico which seeks to locate a special type of quasar (radio-emitting stellar object) called bent doubles. The FIRST survey has generated more than 32,000 images of the sky to date. Each image is 7.1 megabytes, yielding more than 100 gigabytes of image data in the entire data set.

  7. New wave generation

    E-Print Network [OSTI]

    Mercier, Matthieu J.

    We present the results of a combined experimental and numerical study of the generation of internal waves using the novel internal wave generator design of Gostiaux et al. (Exp. Fluids, vol. 42, 2007, pp. 123130). This ...

  8. PARALLEL ACTIVITY ROADMAPS Daniel Citron, Dror G. Feitelson \\Lambda , and Iaakov Exman

    E-Print Network [OSTI]

    Feitelson, Dror

    1 PARALLEL ACTIVITY ROADMAPS Daniel Citron, Dror G. Feitelson \\Lambda , and Iaakov Exman Institute@cs.huji.ac.il Parallel Roadmaps are simple visual constructs, useful for displaying the evolution of largescale parallel programs with dynamic parallelism. Roadmaps remain intelligible and provide invaluable debugging clues even

  9. A Design Pattern Language for Engineering (Parallel) Kurt Keutzer (EECS UC Berkeley) and Tim Mattson (Intel)

    E-Print Network [OSTI]

    , in the one community with a long tradition of parallel computing (high performance computing) the old

  10. Mobile Agents Based Collective Communication: An Application to a Parallel Plasma Simulation

    E-Print Network [OSTI]

    Vlad, Gregorio

    to communicate by Internet. In high performance computing it represents a parallel programming paradigm

  11. Motor/generator

    DOE Patents [OSTI]

    Hickam, Christopher Dale (Glasford, IL)

    2008-05-13T23:59:59.000Z

    A motor/generator is provided for connecting between a transmission input shaft and an output shaft of a prime mover. The motor/generator may include a motor/generator housing, a stator mounted to the motor/generator housing, a rotor mounted at least partially within the motor/generator housing and rotatable about a rotor rotation axis, and a transmission-shaft coupler drivingly coupled to the rotor. The transmission-shaft coupler may include a clamp, which may include a base attached to the rotor and a plurality of adjustable jaws.

  12. Enabling Rapid Development of Parallel Tree Search Applications

    E-Print Network [OSTI]

    Jeffrey P. Gardner; Andrew Connolly; Cameron McBride

    2007-09-12T23:59:59.000Z

    Virtual observatories will give astronomers easy access to an unprecedented amount of data. Extracting scientific knowledge from these data will increasingly demand both efficient algorithms as well as the power of parallel computers. Nearly all efficient analyses of large astronomical datasets use trees as their fundamental data structure. Writing efficient tree-based techniques, a task that is time-consuming even on single-processor computers, is exceedingly cumbersome on massively parallel platforms (MPPs). Most applications that run on MPPs are simulation codes, since the expense of developing them is offset by the fact that they will be used for many years by many researchers. In contrast, data analysis codes change far more rapidly, are often unique to individual researchers, and therefore accommodate little reuse. Consequently, the economics of the current high-performance computing development paradigm for MPPs does not favor data analysis applications. We have therefore built a library, called Ntropy, that provides a flexible, extensible, and easy-to-use way of developing tree-based data analysis algorithms for both serial and parallel platforms. Our experience has shown that not only does our library save development time, it can also deliver excellent serial performance and parallel scalability. Furthermore, Ntropy makes it easy for an astronomer with little or no parallel programming experience to quickly scale their application to a distributed multiprocessor environment. By minimizing development time for efficient and scalable data analysis, we enable wide-scale knowledge discovery on massive datasets.

  13. Parallel Breadth-First Search on Distributed Memory Systems

    SciTech Connect (OSTI)

    Computational Research Division; Buluc, Aydin; Madduri, Kamesh

    2011-04-15T23:59:59.000Z

    Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

  14. Distance-Two Interpolation for Parallel Algebraic Multigrid

    SciTech Connect (OSTI)

    De Sterck, H; Falgout, R; Nolting, J; Yang, U M

    2007-05-08T23:59:59.000Z

    Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large three-dimensional problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such as those obtained by the Parallel Modified Independent Set coarsening algorithm (PMIS) [7], remedy this complexity growth, but lead to non-scalable AMG convergence factors when traditional distance-one interpolation methods are used. In this paper we study the scalability of AMG methods that combine PMIS coarse grids with long distance interpolation methods. AMG performance and scalability is compared for previously introduced interpolation methods as well as new variants of them for a variety of relevant test problems on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability of AMG convergence factors for PMIS-coarsened grids, and in combination with complexity reducing methods, such as interpolation truncation, one obtains a class of parallel AMG methods that enjoy excellent scalability properties on large parallel computers.

  15. Hydrogen and electricity: Parallels, interactions,and convergence

    E-Print Network [OSTI]

    Yang, Christopher

    2008-01-01T23:59:59.000Z

    tion. A higher level of coal generation would decrease thea lower level of coal generation would lead to an increaseElectricity Generation (2004) Coal Steam CO 2 emissions [gCO

  16. Explicit spatial scattering for load balancing in conservatively synchronized parallel discrete-event simulations

    SciTech Connect (OSTI)

    Thulasidasan, Sunil [Los Alamos National Laboratory; Kasiviswanathan, Shiva [Los Alamos National Laboratory; Eidenbenz, Stephan [Los Alamos National Laboratory; Romero, Philip [Los Alamos National Laboratory

    2010-01-01T23:59:59.000Z

    We re-examine the problem of load balancing in conservatively synchronized parallel, discrete-event simulations executed on high-performance computing clusters, focusing on simulations where computational and messaging load tend to be spatially clustered. Such domains are frequently characterized by the presence of geographic 'hot-spots' - regions that generate significantly more simulation events than others. Examples of such domains include simulation of urban regions, transportation networks and networks where interaction between entities is often constrained by physical proximity. Noting that in conservatively synchronized parallel simulations, the speed of execution of the simulation is determined by the slowest (i.e most heavily loaded) simulation process, we study different partitioning strategies in achieving equitable processor-load distribution in domains with spatially clustered load. In particular, we study the effectiveness of partitioning via spatial scattering to achieve optimal load balance. In this partitioning technique, nearby entities are explicitly assigned to different processors, thereby scattering the load across the cluster. This is motivated by two observations, namely, (i) since load is spatially clustered, spatial scattering should, intuitively, spread the load across the compute cluster, and (ii) in parallel simulations, equitable distribution of CPU load is a greater determinant of execution speed than message passing overhead. Through large-scale simulation experiments - both of abstracted and real simulation models - we observe that scatter partitioning, even with its greatly increased messaging overhead, significantly outperforms more conventional spatial partitioning techniques that seek to reduce messaging overhead. Further, even if hot-spots change over the course of the simulation, if the underlying feature of spatial clustering is retained, load continues to be balanced with spatial scattering leading us to the observation that spatial scattering can often obviate the need for dynamic load balancing.

  17. Electric power monthly, December 1996 with data for September 1996

    SciTech Connect (OSTI)

    NONE

    1996-12-01T23:59:59.000Z

    The report presents monthly electricity statistics for a wide audience including Congress, Federal and State agencies, the electric utility industry, and the general public. The purpose of this publication is to provide energy decisionmakers with accurate and timely information that may be used in forming various perspectives on electric issues that lie ahead. This publication provides monthly statistics at the State, Census division, and US levels for net generation, fossil fuel consumption and stocks, quantity and quality of fossil fuels, cost of fossil fuels, electricity retail sales, associated revenue, and average revenue per kilowatt hour of electricity sold. In addition, data on net generation, fuel consumption, fuel stocks, quantity and cost of fossil fuels are also displayed for the North American Electric Reliability Council (NERC) regions. The EIA publishes statistics on net generation by energy source; consumption, stocks, quantity, quality, and cost of fossil fuels; and capability of new generating units by company and plant. 57 tabs.

  18. Electric power monthly, September 1996, with data for June 1996

    SciTech Connect (OSTI)

    NONE

    1996-09-01T23:59:59.000Z

    The Coal and Electric Data and Renewables Division; Office of Coal, Nuclear, Electric and Alternate Fuels, Energy Information Administration (EIA), Department of Energy prepares the EPM. This publication provides monthly statistics at the State, Census division, and U.S. levels for net generation, fossil fuel consumption and stocks, quantity and quality of fossil fuels, cost of fossil fuels, electricity retail sales, associated revenue, and average revenue per kilowatt hour of electricity sold. In addition, data on net generation, fuel consumption, fuel stocks, quantity and cost of fossil fuels are also displayed for the North American Electric Reliability Council (NERC) regions. The EIA publishes statistics in the EPM on net generation by energy source; consumption, stocks, quantity, quality, and cost of fossil fuels; and capability of new generating units by company and plant.

  19. Electric power monthly, July 1999, with data for April 1999

    SciTech Connect (OSTI)

    NONE

    1999-07-01T23:59:59.000Z

    The Electric Power Division, Office of Coal, Nuclear, Electric and Alternate Fuels, Energy Information Administration (EIA), Department of Energy prepares the Electric Power Monthly (EPM). This publication provides monthly statistics at the State, Census division, and US levels for net generation, fossil fuel consumption and stocks, quantity and quality of fossil fuels, cost of fossil fuels, electricity retail sales, associated revenue, and average revenue per kilowatt hour of electricity sold. In addition, data on net generation, fuel consumption, fuel stocks, quantity and cost of fossil fuels are also displayed for the North American Electric Reliability Council (NERC) regions. The EIA publishes statistics in the EPM on net generation by energy source; consumption, stocks, quantity, quality, and cost of fossil fuels; and capability of new generating units by company and plant. 1 fig., 64 tabs.

  20. Creating a Cognitive Agent in a Virtual World: Planning, Navigation, and Natural Language Generation

    E-Print Network [OSTI]

    Hewlett, William

    2013-01-01T23:59:59.000Z

    Generation . . . . . . . . . . . . . . . . . . . . .Language Generation . . . . . . . . . . . . . . . . .Language Generation . . . . . . . . . . . . . . . . . . . .

  1. Combined fuel and air staged power generation system

    SciTech Connect (OSTI)

    Rabovitser, Iosif K; Pratapas, John M; Boulanov, Dmitri

    2014-05-27T23:59:59.000Z

    A method and apparatus for generation of electric power employing fuel and air staging in which a first stage gas turbine and a second stage partial oxidation gas turbine power operated in parallel. A first portion of fuel and oxidant are provided to the first stage gas turbine which generates a first portion of electric power and a hot oxidant. A second portion of fuel and oxidant are provided to the second stage partial oxidation gas turbine which generates a second portion of electric power and a hot syngas. The hot oxidant and the hot syngas are provided to a bottoming cycle employing a fuel-fired boiler by which a third portion of electric power is generated.

  2. ENERGY RECOVERY COUNCIL WEEKLY UPDATE

    E-Print Network [OSTI]

    apply to calendar year 2009 sales of kilowatt hours of electricity produced in the United States or one-loop biomass, geothermal energy, and solar energy; and 1.1 cent per kilowatt hour on the sale of electricity the House Education and Labor Committee where he served as Senior Labor Policy Advisor for Health and Safety

  3. 3Energy in the Home Every month, we get the Bad

    E-Print Network [OSTI]

    operating, the accelerator requires 70 megaWatts of electricity ­ about the same as the power consumption) What is the Tevatron's electricity consumption in kilowatt hours? B) At $0.11 per kilowatt hour, how operating, the accelerator requires 70 megaWatts of electricity ­ about the same as the power consumption

  4. PARALLEL ION BEAM PROFILE SCAN USING LASER WIRE

    SciTech Connect (OSTI)

    Liu, Yun [ORNL; Aleksandrov, Alexander V [ORNL; Huang, Chunning [ORNL; Long, Cary D [ORNL; Dickson, Richard W [ORNL

    2013-01-01T23:59:59.000Z

    We report on the world s first experiment of a parallel profile scan of the hydrogen ion (H-) beam using a laser wire system. The system was developed at the superconducting linac of the Spallation Neutron Source (SNS) accelerator complex. The laser wire profile scanner is based on a photo-detachment process and therefore can be conducted on an operational H- beam in a nonintrusive manner. The parallel profile scanning system makes it possible to simultaneously measure profiles of the 1-MW neutron production H- beam at 9 different locations of the linac by using a single light source. This paper describes the design, optical system and software platform development, and measurement results of the parallel profile scanning system.

  5. Parallel vacuum arc discharge with microhollow array dielectric and anode

    SciTech Connect (OSTI)

    Feng, Jinghua; Zhou, Lin; Fu, Yuecheng; Zhang, Jianhua; Xu, Rongkun; Chen, Faxin; Li, Linbo; Meng, Shijian, E-mail: mengshijian04@126.com [Institute of Nuclear Physics and Chemistry, China Academy of Engineering Physics, Mianyang 621900 (China)

    2014-07-15T23:59:59.000Z

    An electrode configuration with microhollow array dielectric and anode was developed to obtain parallel vacuum arc discharge. Compared with the conventional electrodes, more than 10 parallel microhollow discharges were ignited for the new configuration, which increased the discharge area significantly and made the cathode eroded more uniformly. The vacuum discharge channel number could be increased effectively by decreasing the distances between holes or increasing the arc current. Experimental results revealed that plasmas ejected from the adjacent hollow and the relatively high arc voltage were two key factors leading to the parallel discharge. The characteristics of plasmas in the microhollow were investigated as well. The spectral line intensity and electron density of plasmas in microhollow increased obviously with the decease of the microhollow diameter.

  6. Augmented heat transfer in square channels with parallel, crossed, and V-shaped angled ribs

    SciTech Connect (OSTI)

    Han, J.C.; Zhang, Y.M. (Texas A and M Univ., College Station (United States)); Lee, C.P. (General Electric Co., Cincinnati, OH (United States))

    1991-08-01T23:59:59.000Z

    The effect of the rib angle orientation on the local heat transfer distributions and pressure drop in a square channel with two opposite in-line ribbed walls was investigated for Reynolds numbers from 15,000 to 90,000. The square channel composed of ten isolated copper sections has a length-to-hydraulic diameter ratio of 20; the rib height-to-hydraulic diameter ratio is 0.0625; the rib pitch-to-height ratio equals 10. Nine rib configurations were studied: 90 deg rib, 60 and 45 deg parallel ribs, 60 and 45 deg crossed ribs, 60 and 45 deg V-shaped ribs, and 60 and 45 deg {Lambda}-shaped ribs. The results show that the 60 deg (or 45 deg) V-shaped rib performs better than the 60 deg (or 45 deg) parallel rib and, subsequently, better than the 60 deg (or 45 deg) crossed rib and the 90 deg rib. The V-shaped rib produces the highest heat transfer augmentation, while the {Lambda}-shaped rib generates the greatest pressure drop. The crossed rib has the lowest heat transfer enhancement and the smallest pressure drop penalty.

  7. Radiation transport on unstructured mesh with parallel computers

    SciTech Connect (OSTI)

    Fan, W.C.; Drumm, C.R.

    2000-07-01T23:59:59.000Z

    This paper summarizes the developmental work on a deterministic transport code that provides multidimensional radiation transport capabilities on an unstructured mesh. The second-order form of the Boltzmann transport equation is solved utilizing the discrete ordinates angular differencing and the Galerkin finite element spatial differencing. The discretized system, which couples the spatial-angular dependence, is solved simultaneously using a parallel conjugate-gradient (CG) iterative solver. This approach eliminates the need for the conventional inner iterations over the discrete directions and is well-suited for massively parallel computers.

  8. Intelligent energy management agent for a parallel hybrid vehicle

    E-Print Network [OSTI]

    Won, Jong-Seob

    2004-09-30T23:59:59.000Z

    INTELLIGENT ENERGY MANAGEMENT AGENT FOR A PARALLEL HYBRID VEHICLE A Dissertation by JONG-SEOB WON Submitted to the O ce of Graduate Studies of Texas A&M University in partial ful llment of the requirements for the degree of DOCTOR OF PHILOSOPHY May... 2003 Major Subject: Mechanical Engineering INTELLIGENT ENERGY MANAGEMENT AGENT FOR A PARALLEL HYBRID VEHICLE A Dissertation by JONG-SEOB WON Submitted to Texas A&M University in partial ful llment of the requirements for the degree of DOCTOR...

  9. Performance analysis of parallel supernodal sparse LU factorization

    SciTech Connect (OSTI)

    Grigori, Laura; Li, Xiaoye S.

    2004-02-05T23:59:59.000Z

    We investigate performance characteristics for the LU factorization of large matrices with various sparsity patterns. We consider supernodal right-looking parallel factorization on a bi-dimensional grid of processors, making use of static pivoting. We develop a performance model and we validate it using the implementation in SuperLU-DIST, the real matrices and the IBM Power3 machine at NERSC. We use this model to obtain performance bounds on parallel computers, to perform scalability analysis and to identify performance bottlenecks. We also discuss the role of load balance and data distribution in this approach.

  10. Methods for operating parallel computing systems employing sequenced communications

    DOE Patents [OSTI]

    Benner, R.E.; Gustafson, J.L.; Montry, G.R.

    1999-08-10T23:59:59.000Z

    A parallel computing system and method are disclosed having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system. 15 figs.

  11. Parallel matrix computations. Interim report, April 1984-April 1985

    SciTech Connect (OSTI)

    Stewart, G.W.; O'Leary, D.P.

    1985-04-01T23:59:59.000Z

    This project concerns the design and analysis of algorithms to be run in a processor-rich environment. It focuses primarily on algorithms that require no global control and that can be run on systems with only local connections among processors. The properties of these algorithms both theoretically and experimentally are investigated. The experimental work is done on the ZMOB, a working parallel computer operated by the Laboratory for Parallel Computation of the Computer Science Department at the University of Maryland. The emphasis is on two areas: 1) Dense problems from numerical linear algebra; and 2) The iterative and direct solution of sparse linear systems.

  12. Data-flow algorithms for parallel matrix computations

    SciTech Connect (OSTI)

    O'Leary, D.P.; Stewart, G.W.

    1985-08-01T23:59:59.000Z

    This document develops some algorithms and tools for solving matrix problems on parallel-processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, the authors present algorithms that form the main modules for solving Liapounov matrix equations. They compare this approach to wave-front array processors and systolic arrays, and note its advantages in handling mis-sized problems, in evaluating variations of algorithms or architectures, in moving algorithms from system to system, and in debugging parallel algorithms on sequential machines.

  13. Parallel matrix computations. Interim report, April 1985-April 1986

    SciTech Connect (OSTI)

    Stewart, G.W.; O'Leary, D.P.

    1986-05-12T23:59:59.000Z

    This project concerns the design and analysis of algorithms to be run in a processor-rich environment. The authors focus primarily on algorithms that require no global control and that can be run on systems with only local connections among processors. They investigate the properties of these algorithms both theoretically and experimentally. The experimental work is done on the ZMOB, a working parallel computer operated by the Laboratory for Parallel Computation of the Computer Science Department at the University of Maryland. To give this work direction, they focused on two areas: Dense problems from numerical linear algebra; and The iterative and direct solution of sparse linear systems.

  14. Parallel and Antiparallel Interfacial Coupling in AF-FM Bilayers

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:Energy: Grid Integration Redefining What's Possible for RenewableSpeedingBiomassPPPO WebsitePalms Village Resort B a g|setsParallelParallel

  15. Method of grid generation

    DOE Patents [OSTI]

    Barnette, Daniel W. (Veguita, NM)

    2002-01-01T23:59:59.000Z

    The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.

  16. Steam generator support system

    DOE Patents [OSTI]

    Moldenhauer, J.E.

    1987-08-25T23:59:59.000Z

    A support system for connection to an outer surface of a J-shaped steam generator for use with a nuclear reactor or other liquid metal cooled power source is disclosed. The J-shaped steam generator is mounted with the bent portion at the bottom. An arrangement of elongated rod members provides both horizontal and vertical support for the steam generator. The rod members are interconnected to the steam generator assembly and a support structure in a manner which provides for thermal distortion of the steam generator without the transfer of bending moments to the support structure and in a like manner substantially minimizes forces being transferred between the support structure and the steam generator as a result of seismic disturbances. 4 figs.

  17. Steam generator support system

    DOE Patents [OSTI]

    Moldenhauer, James E. (Simi Valley, CA)

    1987-01-01T23:59:59.000Z

    A support system for connection to an outer surface of a J-shaped steam generator for use with a nuclear reactor or other liquid metal cooled power source. The J-shaped steam generator is mounted with the bent portion at the bottom. An arrangement of elongated rod members provides both horizontal and vertical support for the steam generator. The rod members are interconnected to the steam generator assembly and a support structure in a manner which provides for thermal distortion of the steam generator without the transfer of bending moments to the support structure and in a like manner substantially minimizes forces being transferred between the support structure and the steam generator as a result of seismic disturbances.

  18. A Study of Successive Over-relaxation Method Parallelization over Modern HPC Languages

    SciTech Connect (OSTI)

    Mittal, Sparsh [ORNL

    2014-01-01T23:59:59.000Z

    Successive over-relaxation (SOR) is a computationally intensive, yet extremely important iterative solver for solving linear systems. Due to recent trends of exponential growth in amount of data generated and increasing problem sizes, serial platforms have proved to be insucient in providing the required computational power. In this paper, we present parallel implementations of red-black SOR method using three modern programming languages namely Chapel, D and Go. We employ SOR method for solving 2D steady-state heat conduction problem. We discuss the optimizations incorporated and the features of these languages which are crucial for improving the program performance. Experiments have been performed using 2, 4, and 8 threads and performance results are compared with serial execution. The analysis of results provides important insights into working of SOR method.

  19. Talkin Bout Wind Generation

    Broader source: Energy.gov [DOE]

    The amount of electricity generated by the wind industry started to grow back around 1999, and since 2007 has been increasing at a rapid pace.

  20. SNE TRAFIC GENERATOR

    Energy Science and Technology Software Center (OSTI)

    003027MLTPL00 Network Traffic Generator for Low-rate Small Network Equipment Software http://eln.lbl.gov/sne_traffic_gen.html

  1. Hydrogen Generation for Refineries

    Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

    Single Cycle Shown for ATB SteamCarbon 3 * ATB reforming * Steamcarbon 3 * Syngas generated during reforming * 70% H 2 * 20% CO * Syngas composition agrees with...

  2. Life Cycle Greenhouse Gas Emissions of Trough and Tower Concentrating Solar Power Electricity Generation: Systematic Review and Harmonization

    SciTech Connect (OSTI)

    Burkhardt, J. J.; Heath, G.; Cohen, E.

    2012-04-01T23:59:59.000Z

    In reviewing life cycle assessment (LCA) literature of utility-scale concentrating solar power (CSP) systems, this analysis focuses on reducing variability and clarifying the central tendency of published estimates of life cycle greenhouse gas (GHG) emissions through a meta-analytical process called harmonization. From 125 references reviewed, 10 produced 36 independent GHG emissions estimates passing screens for quality and relevance: 19 for parabolic trough (trough) technology and 17 for power tower (tower) technology. The interquartile range (IQR) of published estimates for troughs and towers were 83 and 20 grams of carbon dioxide equivalent per kilowatt-hour (g CO2-eq/kWh),1 respectively; median estimates were 26 and 38 g CO2-eq/kWh for trough and tower, respectively. Two levels of harmonization were applied. Light harmonization reduced variability in published estimates by using consistent values for key parameters pertaining to plant design and performance. The IQR and median were reduced by 87% and 17%, respectively, for troughs. For towers, the IQR and median decreased by 33% and 38%, respectively. Next, five trough LCAs reporting detailed life cycle inventories were identified. The variability and central tendency of their estimates are reduced by 91% and 81%, respectively, after light harmonization. By harmonizing these five estimates to consistent values for global warming intensities of materials and expanding system boundaries to consistently include electricity and auxiliary natural gas combustion, variability is reduced by an additional 32% while central tendency increases by 8%. These harmonized values provide useful starting points for policy makers in evaluating life cycle GHG emissions from CSP projects without the requirement to conduct a full LCA for each new project.

  3. Next-generation transcriptome assembly

    E-Print Network [OSTI]

    Martin, Jeffrey A.

    2012-01-01T23:59:59.000Z

    technologies - the next generation. Nat Rev Genet 11, 31-algorithms for next-generation sequencing data. Genomicsassembly from next- generation sequencing data. Genome Res

  4. MADmap: A Massively Parallel Maximum-Likelihood Cosmic Microwave Background Map-Maker

    SciTech Connect (OSTI)

    Cantalupo, Christopher; Borrill, Julian; Jaffe, Andrew; Kisner, Theodore; Stompor, Radoslaw

    2009-06-09T23:59:59.000Z

    MADmap is a software application used to produce maximum-likelihood images of the sky from time-ordered data which include correlated noise, such as those gathered by Cosmic Microwave Background (CMB) experiments. It works efficiently on platforms ranging from small workstations to the most massively parallel supercomputers. Map-making is a critical step in the analysis of all CMB data sets, and the maximum-likelihood approach is the most accurate and widely applicable algorithm; however, it is a computationally challenging task. This challenge will only increase with the next generation of ground-based, balloon-borne and satellite CMB polarization experiments. The faintness of the B-mode signal that these experiments seek to measure requires them to gather enormous data sets. MADmap is already being run on up to O(1011) time samples, O(108) pixels and O(104) cores, with ongoing work to scale to the next generation of data sets and supercomputers. We describe MADmap's algorithm based around a preconditioned conjugate gradient solver, fast Fourier transforms and sparse matrix operations. We highlight MADmap's ability to address problems typically encountered in the analysis of realistic CMB data sets and describe its application to simulations of the Planck and EBEX experiments. The massively parallel and distributed implementation is detailed and scaling complexities are given for the resources required. MADmap is capable of analysing the largest data sets now being collected on computing resources currently available, and we argue that, given Moore's Law, MADmap will be capable of reducing the most massive projected data sets.

  5. International Conference on Machine Control & Guidance 2008 1 Generation and Analysis of Digital Terrain Models with

    E-Print Network [OSTI]

    1st International Conference on Machine Control & Guidance 2008 1 Generation and Analysis of Digital Terrain Models with Parallel Guidance Systems for Precision Agriculture Grres GRENZDRFFER models at no or little additional cost. In the paper the achievable data accuracy under different

  6. A NEW GENERATION CHEMICAL FLOODING SIMULATOR

    SciTech Connect (OSTI)

    Gary A. Pope; Kamy Sepehrnoori; Mojdeh Delshad

    2005-01-01T23:59:59.000Z

    The premise of this research is that a general-purpose reservoir simulator for several improved oil recovery processes can and should be developed so that high-resolution simulations of a variety of very large and difficult problems can be achieved using state-of-the-art algorithms and computers. Such a simulator is not currently available to the industry. The goal of this proposed research is to develop a new-generation chemical flooding simulator that is capable of efficiently and accurately simulating oil reservoirs with at least a million gridblocks in less than one day on massively parallel computers. Task 1 is the formulation and development of solution scheme, Task 2 is the implementation of the chemical module, and Task 3 is validation and application. In this final report, we will detail our progress on Tasks 1 through 3 of the project.

  7. Parallel Belief Revision: Revising by Sets of Formulas

    E-Print Network [OSTI]

    Delgrande, James P.

    Parallel Belief Revision: Revising by Sets of Formulas James Delgrande and Yi Jin School of Computing Science Simon Fraser University Burnaby, B.C. V5A 1S6 Canada {jim,yij}@cs.sfu.ca March 15, 2012 Abstract The area of belief revision studies how a rational agent may incorporate new information about

  8. Parallel Belief Revision James Delgrande and Yi Jin

    E-Print Network [OSTI]

    Delgrande, James P.

    Parallel Belief Revision James Delgrande and Yi Jin School of Computing Science Simon Fraser University Burnaby, B.C. V5A 1S6 Canada {jim,yij}@cs.sfu.ca Abstract A recalcitrant problem in approaches to iterated belief revi- sion is that, after first revising by a formula and then by a formula

  9. Parallel algorithm and hybrid regularization for dynamic PET reconstruction

    E-Print Network [OSTI]

    Boyer, Edmond

    Parallel algorithm and hybrid regularization for dynamic PET reconstruction N. Pustelnik, Student Abstract--To improve the estimation at the voxel level in dynamic Positron Emission Tomography (PET in the presence of Poisson noise and it is extended here to (dynamic) space + time PET image reconstruction

  10. Parallel semiToeplitz preconditioners for combustor flows

    E-Print Network [OSTI]

    Parallel semiToeplitz preconditioners for combustor flows Andreas Kahari and Samuel Sundberg aspects of combustor flows. 2 Model problem We study the Euler equations on a backwardsfacing step, whereToeplitz preconditioners for combustor flows 3 4 Results At the conference we will present results concerning convergence

  11. Evaluating Memory Energy Efficiency in Parallel I/O Workloads

    E-Print Network [OSTI]

    Zhu, Yifeng

    Evaluating Memory Energy Efficiency in Parallel I/O Workloads Jianhui Yue,Yifeng Zhu , Zhao Cai the ever- widening gap between disk and processor speeds, memory energy efficiency becomes an increasingly management policies heavily influence the overall memory energy efficiency. In partic- ular, under the same

  12. Efficiency Assessment of Parallel Workloads on Virtualized Resources Javier Delgado,

    E-Print Network [OSTI]

    Sadjadi, S. Masoud

    Efficiency Assessment of Parallel Workloads on Virtualized Resources Javier Delgado, S. Masoud,ygliu,bobroff,sseelam}@us.ibm.com Abstract--In cloud computing, virtual containers on phys- ical resources are provisioned to requesting users. Resource providers may pack as many containers as possible onto each of their physical machines

  13. Distributed Point Objects: A new concept for parallel nite elements

    E-Print Network [OSTI]

    Wieners, Christian

    Distributed Point Objects: A new concept for parallel #12;nite elements applied to a geomechanical problem ( for a special issue on \\Numerical Modeling in Geomechanics and Geodynamics" of the Elsevier. Mech. 29 (2002) 75-87), where the geomechanical model, the interface of the #12;nite element code

  14. Hardware packet pacing using a DMA in a parallel computer

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Phillip; Vranas, Pavlos

    2013-08-13T23:59:59.000Z

    Method and system for hardware packet pacing using a direct memory access controller in a parallel computer which, in one aspect, keeps track of a total number of bytes put on the network as a result of a remote get operation, using a hardware token counter.

  15. Automatic differentiation for message-passing parallel programs.

    SciTech Connect (OSTI)

    Hovland, P.

    1998-01-27T23:59:59.000Z

    Many applications require the derivatives of functions defined by computer programs. Automatic differentiation (AD) is a means of developing code to compute the derivatives of complicated functions accurately and efficiently, without the difficulties associated with developing correct code by hand. We discuss some of the issues involved in developing automatic differentiation tools for parallel programming environments.

  16. AUTOMATIC PARALLELIZATION OF OBJECT ORIENTED MODELS ACROSS METHOD AND

    E-Print Network [OSTI]

    Zhao, Yuxiao

    was done on the system only. Keywords: Modelica, automatic parallelization. Presenting Author's biography and Modelica Modelica is a rather new language for equation-based object-oriented mathematical modeling which object- oriented modeling languages. Modelica is intended to become a de facto standard. It allows

  17. Modelling unbounded parallel sessions of security protocols in CSP

    E-Print Network [OSTI]

    Roscoe, Bill

    Modelling unbounded parallel sessions of security protocols in CSP E. Kleiner and A.W. Roscoe that a simplification to earlier CSP models designed to prove protocols correct on the FDR model checker is valid of injective authentication. Essentially for historical reasons, that paper created a model with both

  18. TDDC78TDDC78 Programming of Parallel Computers

    E-Print Network [OSTI]

    Kessler, Christoph

    - OpenMP Distributed memory, message passing - MPI Distributed memory, message passing - MPI (Data-term evaluation by muddy cards Lesson 2: pthreads, OpenMP (MC) Lecture plan (2) ... ------------ Easter vacation code 5 lab groups (3 classes) in 2 passes Grupp_A (Usman Dastgeer): 32 students in parallel Grupp

  19. Fundamental Parallel Algorithms for Private-Cache Chip Multiprocessors

    E-Print Network [OSTI]

    Goodrich, Michael T.

    multiprocessors (CMPs), focusing on methods for foun- dational problems that can scale to hundreds or even thou to handle part of this load, but part of the load will also need to be carried by parallel algorithms. This paper is directed at this latter goal. There is a sizable literature on algorithms for shared- memory

  20. Parallel Implementation of Raytracing on Shared Memory Architecture

    E-Print Network [OSTI]

    Havran, Vlastimil

    the same. There are some methods for distribution the computation load among the processors. Let us supposeParallel Implementation of Raytracing on Shared Memory Architecture Vlastimil Havran, havran@cs.felk.cvut.cz CTU Prague, Dept. of Computer Science 1 Introduction The raytracing has become very popular method

  1. VIPP: Visual Interactive Parallel Performance Tool Edmund M. Johnson

    E-Print Network [OSTI]

    Baden, Scott B.

    tool for exploring performance tradeoffs that arise when load balanc ing various particle methods, Performance Visualization, Particle Methods, Education in Parallel Processing. 1 Introduction The load, and distributed shared memory architectures. It is intended for two dimensional particle methods that employ

  2. CX: A Scalable, Robust Network for Parallel Computing

    E-Print Network [OSTI]

    Cappello, Peter

    CX: A Scalable, Robust Network for Parallel Computing}@cs.ucsb.edu telephone: 805.893.4383; fax: 805.893.853 Abstract CX, a network are distributed throughout the server network via a simple "diffusion" process. CX is intended as a test

  3. All Optical Interface for Parallel, Remote, and Spatiotemporal Control of

    E-Print Network [OSTI]

    Trauner, Dirk

    All Optical Interface for Parallel, Remote, and Spatiotemporal Control of Neuronal Activity Sheng and detection of activity in a large number of neurons. Here, we report an all-optical system for achieving optical stimuli through a digital micromirror spatiotemporal light modulator to cells expressing the light

  4. MODELING AND CONTROLLING PARALLEL TASKS IN DROPLET-BASED MICROFLUIDIC

    E-Print Network [OSTI]

    Chapter 12 MODELING AND CONTROLLING PARALLEL TASKS IN DROPLET-BASED MICROFLUIDIC SYSTEMS Karl F-independent models and algorithms to automate the operation of droplet-based microfluidic systems. In these systems mapping of a biochemical analysis task onto a droplet-based microfluidic system is investigated. Achieving

  5. Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms

    E-Print Network [OSTI]

    Balasubramonian, Rajeev

    1 Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) At each clock, processors receive input output #12;4 Control at Each Processor Each processor stores the minimum number it has seen

  6. Energy-Efficient Sensing and Communication of Parallel Gaussian Sources

    E-Print Network [OSTI]

    Erkip, Elza

    Energy-Efficient Sensing and Communication of Parallel Gaussian Sources Xi Liu, Osvaldo Simeone to be operated in an energy-efficient manner in order to attain a satisfactory lifetime. Energy consumption efficiency [2] [3]. We refer to the energy cost associated with measurements and compression of information

  7. Energy Efficient Implementation of Parallel CMOS Multipliers with Improved Compressors

    E-Print Network [OSTI]

    California at Davis, University of

    Energy Efficient Implementation of Parallel CMOS Multipliers with Improved Compressors Dursun Baran targets. In addition, novel 3:2 and 4:2 compressors are pre- sented to save energy at the same target delay. The proposed compressors provide up to 20% energy reduction depending on the target delay at 65nm

  8. Detection of multiple sinusoids using a parallel ale

    SciTech Connect (OSTI)

    David, R.A.

    1984-01-01T23:59:59.000Z

    This paper introduces an Adaptive Line Enhancer (ALE) whose parallel structure enables the detection and enhancement of multiple sinusoids. A function describing the performance surface is derived for the case where several line signals are buried in white noise. A steepest descent adaptive algorithm is derived, and simulations are used to demonstrate its performance.

  9. CSE 557: Parallel Combinatorial Search-Introduction Padma Raghavan

    E-Print Network [OSTI]

    Raghavan, Padma

    problem that we will use as an example to consider parallelization. Consider a robot arm that must visit a a large number of drill sites. A decision problem is of the form: `Is there a way to route the robot arm search problem if of the form: `Find all ways to to route the robot arm so it visits every drill site

  10. tchen@engr.smu.edu Parallels Between Biological

    E-Print Network [OSTI]

    Chen, Thomas M.

    Tom Chen SMU tchen@engr.smu.edu Parallels Between Biological and Computer Epidemics #12;TC/Londonmet/11-10-04 SMU Engineering p. 2 Microscopic: How Biological and Computer Pathogens Spread/Londonmet/11-10-04 SMU Engineering p. 3 Viruses and worms are characterized by capability for self

  11. Performance impact of dynamic parallelism on different clustering algorithms

    E-Print Network [OSTI]

    Taufer, Michela

    will be measured using two well-known clustering algorithms that exhibit data dependencies: the K-means clustering and the hierarchical clustering. K-means has a sequential data dependence wherein iterations occur in a linear fashion drawbacks of CUDA 5's new dynamic parallelism feature. Keywords: K-means, Divisive hierarchical clustering

  12. GPU-ABiSort: Optimal Parallel Sorting on Stream Architectures

    E-Print Network [OSTI]

    Zachmann, Gabriel

    and Gabriel Zachmann2 IfI Technical Report Series IfI-06-11 #12;Impressum Publisher:Institut für Informatik. Gabriel Zachmann (Computer Graphics) #12;GPU-ABiSort: Optimal Parallel Sorting on Stream Architectures (extended version) Alexander Gre?1 and Gabriel Zachmann2 1 Institute of Computer Science II 2 Institute

  13. Towards a Parallel Data Mining Toolbox Peter Christen

    E-Print Network [OSTI]

    Strazdins, Peter

    are highly interactive: The data miner investigates the data and extracts subsets of attributes and help the data miner to concentrate on knowledge extraction. Today data collections have the size the functional- ity to process multiple SQL queries in parallel, and enables fast data retrieval using

  14. Dynamic Algorithm Selection in Parallel GAMESS Calculations Nurzhan Ustemirov

    E-Print Network [OSTI]

    Sosonkina, Masha

    and Molecular Electronic Structure System (GAMESS) used for ab initio molecular quantum chemistry calculationsDynamic Algorithm Selection in Parallel GAMESS Calculations Nurzhan Ustemirov Masha Sosonkina, network, or disk I/O. For large-scale scientific applications, dynamic adjustments to a computationally

  15. A Library Hierarchy for Implementing Scalable Parallel Search Algorithms

    E-Print Network [OSTI]

    Ralphs, Ted

    of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, ladanyi@us.ibm for performing large-scale parallel search in distributed-memory computing environments. To support the devel a hierarchy implementing additional functionality needed for specific applications. Department of Industrial

  16. Computational Experience with a Software Framework for Parallel Integer Programming

    E-Print Network [OSTI]

    Ralphs, Ted

    from NSF grant DMI-0522796 Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, ladanyi@us.ibm.com Department of Mathematical Sciences, Clemson UniversityComputational Experience with a Software Framework for Parallel Integer Programming Y. Xu T. K

  17. A Library Hierarchy for Implementing Scalable Parallel Search Algorithms

    E-Print Network [OSTI]

    Ralphs, Ted

    Partnership Award y Department of Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598, ladanyi@us.ibm.com z Department of Mathematical Sciences, Clemson University, Clemson, SC scalable algorithms for performing large-scale parallel search in distributed-memory computing environments

  18. Adding Parallel I/O to PARA-BMU

    E-Print Network [OSTI]

    Johnson, Nick; Bethune, Iain

    2012-10-01T23:59:59.000Z

    VOX-FE is a voxel-based bone modelling suite. The solver part of the suite - PARA-BMU - currently uses only serial I/O routines which lead to poor scalability. We enhance the code by adding parallel I/O routines based on the netCDF and HDF5...

  19. Titanium: Parallel Java http://titanium.cs.berkeley.edu/

    E-Print Network [OSTI]

    Titanium: Parallel Java http://titanium.cs.berkeley.edu/ #12;"Hello World" class Hello Titanium processes must synchronize at the same textual point in the program: Legal barrier example guarantees made #12;Arrays and Domains Two types of Arrays in Titanium Java arrays Work exactly the same

  20. Hierarchical Algorithms and Architectures for Parallel Scientific Computing

    E-Print Network [OSTI]

    Chan, Tony F.

    agreement that paral lelism is a costeffective way (some may ar gue it is the only way) to provide. There is much less agreement, however, on how to design effective parallel machines. It is well on certain data types, such as bit, scalar, vector and arrays. 3. Interconnection network machines: dis

  1. Relativistic addition of parallel velocities from time dilation

    E-Print Network [OSTI]

    Bernhard Rothenstein; Stefan Popescu

    2006-08-11T23:59:59.000Z

    The relativistic addition of parallel velocities is derived involving relativity only via the time dilation formula, avoiding the length contraction used by many authors in conjunction with time dilation. The followed scenario involves a machine gun that fires successive bullets, considered from its rest frame and from the rest frame of the target, the bullets hit.

  2. Review of Parallel Computing Techniques for Computed Tomography Image Reconstruction

    E-Print Network [OSTI]

    Wang, Ge

    Review of Parallel Computing Techniques for Computed Tomography Image Reconstruction Jun Ni1, 3 representative analytic and iterative reconstruction algorithms for X-ray computed tomography (CT), we address X-ray computed tomography (CT) is one of the most important non-invasive medical imaging techniques

  3. Measurements of parallel electron velocity distributions using whistler wave absorption

    SciTech Connect (OSTI)

    Thuecks, D. J.; Skiff, F.; Kletzing, C. A. [Department of Physics and Astronomy, University of Iowa, 203 Van Allen Hall, Iowa City, Iowa 52242 (United States)

    2012-08-15T23:59:59.000Z

    We describe a diagnostic to measure the parallel electron velocity distribution in a magnetized plasma that is overdense ({omega}{sub pe} > {omega}{sub ce}). This technique utilizes resonant absorption of whistler waves by electrons with velocities parallel to a background magnetic field. The whistler waves were launched and received by a pair of dipole antennas immersed in a cylindrical discharge plasma at two positions along an axial background magnetic field. The whistler wave frequency was swept from somewhat below and up to the electron cyclotron frequency {omega}{sub ce}. As the frequency was swept, the wave was resonantly absorbed by the part of the electron phase space density which was Doppler shifted into resonance according to the relation {omega}-k{sub ||v||} = {omega}{sub ce}. The measured absorption is directly related to the reduced parallel electron distribution function integrated along the wave trajectory. The background theory and initial results from this diagnostic are presented here. Though this diagnostic is best suited to detect tail populations of the parallel electron distribution function, these first results show that this diagnostic is also rather successful in measuring the bulk plasma density and temperature both during the plasma discharge and into the afterglow.

  4. A General Formulation for the Stiffness Matrix of Parallel Mechanisms

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    of the Cartesian stiffness matrix of parallel mechanisms. The proposed formulation is more general than any other is given in order to illustrate the correctness of this matrix. 1 Introduction A robotic manipulator is a mechanism designed to displace objects in space or in a plane. Therefore, a high precision in the position

  5. A HIGHLY PARALLEL TURBO PRODUCT CODE DECODER WITHOUT INTERLEAVING RESOURCE

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A HIGHLY PARALLEL TURBO PRODUCT CODE DECODER WITHOUT INTERLEAVING RESOURCE Camille Leroux-STICC firstname.lastname@telecom-bretagne.eu ABSTRACT This article presents an innovative Turbo Product Code (TPC of such an architecture compared with exist- ing previous solutions. Considering a 6-iteration turbo de- coder of a (32

  6. Diabetes is an epidemic worldwide, growing in parallel to obesity

    E-Print Network [OSTI]

    Toledo, University of

    Diabetes is an epidemic worldwide, growing in parallel to obesity 1 out of 10 American adults have diabetes. By 2034, the incidence is expected to triple. More then one million Ohioans have diabe reported a more than 10.1% incidence of diabetes among adults in Lucas County. Ohio is among the leading

  7. Geometric Characterization of Series-Parallel Variable Resistor Networks

    E-Print Network [OSTI]

    Tygar, Doug

    simultaneously by an algorithm of complexity O(nk). Key Words: Worst case analysis, linear circuits, series-parallel networks, projective geometry. 1. Introduction The task of worst case circuit analysis [7] involves a method for performing a worst case analysis of a variable linear resistor network by casting

  8. The Average Case Complexity of the Parallel Prefix Problem

    E-Print Network [OSTI]

    Reischuk, Rdiger

    double logarithmic delay while keeping the circuit size linear. The analysis and results are illustrated this can be done in parallel using only linear circuit size [LF80]. Snir has obtained exact boundsfanin circuits and classify semigroups according to the property of having linear size prefix circuits

  9. Geometric Characterization of SeriesParallel Variable Resistor Networks #

    E-Print Network [OSTI]

    Bryant, Randal E.

    simultaneously by an algorithm of complexity O(nk). Key Words: Worst case analysis, linear circuits, seriesparallel networks, projective geometry. 1. Introduction The task of worst case circuit analysis [7] involves. In his book on circuit theory [2], Calahan describes a method for performing a worst case analysis

  10. Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach

    E-Print Network [OSTI]

    Feitelson, Dror

    Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach Gerald Sabin, Matthew OH 43201, USA, {sabin, langma, saday}@cse.ohio-state.edu Abstract. Currently, job schedulers require "rigid" job submissions from users, who must specify a particular number of processors for each paral

  11. Digital tomosynthesis mammography using a parallel maximum likelihood reconstruction method

    E-Print Network [OSTI]

    Meleis, Waleed

    Digital tomosynthesis mammography using a parallel maximum likelihood reconstruction method Tao Wu , a Radiology Department, Massachusetts General Hospital, Boston, MA 02114 b Dept. of Electrical and Computer on an iterative maximum likelihood (ML) algorithm, is developed to provide fast reconstruction for digital

  12. A Generic Grid Interface for Parallel and Adaptive Scientific Computing.

    E-Print Network [OSTI]

    Kornhuber, Ralf

    A Generic Grid Interface for Parallel and Adaptive Scientific Computing. Part I: Abstract Framework definition of a grid for al- gorithms solving partial differential equations. Unlike previous ap- proaches [2, 3], our grids have a hierarchical structure. This makes them suitable for geometric multigrid

  13. FUTURE POWER GRID INITIATIVE GridPACK: Grid Parallel Advanced

    E-Print Network [OSTI]

    FUTURE POWER GRID INITIATIVE GridPACK: Grid Parallel Advanced Computational Kernels OBJECTIVE The U of the power grid will also have to evolve to insure accurate and timely simulations. On the other hand, the software tools available for power grid simulation today are primarily sequential single core programs

  14. Parallel Seismic Ray Tracing in a Global Earth Model

    E-Print Network [OSTI]

    Genaud, Stéphane

    1 Parallel Seismic Ray Tracing in a Global Earth Model Marc Grunberg * , Stéphane Genaud of the Earth interior, and seismic tomogra- phy is a means to improve knowledge in this #28;eld. In order present in this paper the de- sign of a software program implement- ing a fast seismic ray

  15. A MICROFLUIDIC BIOCHIP DEDICATED TO HIGHLY PARALLELIZED ELECTROFUSION

    E-Print Network [OSTI]

    Paris-Sud XI, Universit de

    0065 A MICROFLUIDIC BIOCHIP DEDICATED TO HIGHLY PARALLELIZED ELECTROFUSION F. Hamdi1, 2 , O: Microfluidics, Biochip, Electrofusion, Cell trapping INTRODUCTION The electrofusion between a dendritic i) the trapping of cells flowing in the microfluidic channel ii) their pairing prior to fusion, iii

  16. Sonderforschungsbereich 393 Parallele Numerische Simulation fur Physik und Kontinuumsmechanik

    E-Print Network [OSTI]

    Chemnitz, Technische Universität

    the problem of optimal cooling of steel profiles. This problem arises in a rolling mill where di#erent phases Parallel Order Reduction via Balanced Truncation for Optimal Cooling of Steel Profiles Preprint SFB393­discretization of a controlled heat transfer pro­ cess for optimal cooling of a steel profile. Both algorithms are based

  17. Sonderforschungsbereich 393 Parallele Numerische Simulation fur Physik und Kontinuumsmechanik

    E-Print Network [OSTI]

    Chemnitz, Technische Universität

    the problem of optimal cooling of steel profiles. This problem arises in a rolling mill where different phases Parallel Order Reduction via Balanced Truncation for Optimal Cooling of Steel Profiles Preprint SFB393-discretization of a controlled heat transfer pro- cess for optimal cooling of a steel profile. Both algorithms are based

  18. Xyce Parallel Electronic Simulator Users Guide Version 6.2.

    SciTech Connect (OSTI)

    Keiter, Eric R.; Mei, Ting; Russo, Thomas V.; Schiek, Richard; Sholander, Peter E.; Thornquist, Heidi K.; Verley, Jason; Baur, David Gregory

    2014-09-01T23:59:59.000Z

    This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been de- signed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: Capability to solve extremely large circuit problems by supporting large-scale parallel com- puting platforms (up to thousands of processors). This includes support for most popular parallel and serial computers. A differential-algebraic-equation (DAE) formulation, which better isolates the device model package from solver algorithms. This allows one to develop new types of analysis without requiring the implementation of analysis-specific device models. Device models that are specifically tailored to meet Sandia's needs, including some radiation- aware devices (for Sandia users only). Object-oriented code design and implementation using modern coding practices. Xyce is a parallel code in the most general sense of the phrase -- a message passing parallel implementation -- which allows it to run efficiently a wide range of computing platforms. These include serial, shared-memory and distributed-memory parallel platforms. Attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. Trademarks The information herein is subject to change without notice. Copyright c 2002-2014 Sandia Corporation. All rights reserved. Xyce TM Electronic Simulator and Xyce TM are trademarks of Sandia Corporation. Portions of the Xyce TM code are: Copyright c 2002, The Regents of the University of California. Produced at the Lawrence Livermore National Laboratory. Written by Alan Hindmarsh, Allan Taylor, Radu Serban. UCRL-CODE-2002-59 All rights reserved. Orcad, Orcad Capture, PSpice and Probe are registered trademarks of Cadence Design Systems, Inc. Microsoft, Windows and Windows 7 are registered trademarks of Microsoft Corporation. Medici, DaVinci and Taurus are registered trademarks of Synopsys Corporation. Amtec and TecPlot are trademarks of Amtec Engineering, Inc. Xyce 's expression library is based on that inside Spice 3F5 developed by the EECS Department at the University of California. The EKV3 MOSFET model was developed by the EKV Team of the Electronics Laboratory-TUC of the Technical University of Crete. All other trademarks are property of their respective owners. Contacts Bug Reports (Sandia only) http://joseki.sandia.gov/bugzilla http://charleston.sandia.gov/bugzilla World Wide Web http://xyce.sandia.gov http://charleston.sandia.gov/xyce (Sandia only) Email xyce%40sandia.gov (outside Sandia) xyce-sandia%40sandia.gov (Sandia only)

  19. Second generation PFB for advanced power generation

    SciTech Connect (OSTI)

    Robertson, A.; Van Hook, J.

    1995-11-01T23:59:59.000Z

    Research is being conducted under a United States Department of Energy (USDOE) contract to develop a new type of coal-fueled plant for electric power generation. This new type of plant-called an advanced or second-generation pressurized fluidized bed combustion (APFBC) plant-offers the promise of 45-percent efficiency (HHV), with emissions and a cost of electricity that are significantly lower than conventional pulverized-coal-fired plants with scrubbers. This paper summarizes the pilot plant R&D work being conducted to develop this new type of plant. Although pilot plant testing is still underway, preliminary estimates indicate the commercial plant Will perform better than originally envisioned. Efficiencies greater than 46 percent are now being predicted.

  20. Contracting for wind generation

    E-Print Network [OSTI]

    Newbery, David

    The UK Government proposes offering long-term Feed-in-Tariffs (FiTs) to low-carbon generation to reduce risk and encourage new entrants. Their preference is for a Contract-for-Difference (CfD) or a premium FiT (pFiT) for all generation regardless...

  1. Laser beam generating apparatus

    DOE Patents [OSTI]

    Warner, B.E.; Duncan, D.B.

    1994-02-15T23:59:59.000Z

    Laser beam generating apparatus including a septum segment disposed longitudinally within the tubular structure of the apparatus is described. The septum provides for radiatively dissipating heat buildup within the tubular structure and for generating relatively uniform laser beam pulses so as to minimize or eliminate radial pulse delays (the chevron effect). 7 figures.

  2. Laser beam generating apparatus

    DOE Patents [OSTI]

    Warner, B.E.; Duncan, D.B.

    1993-12-28T23:59:59.000Z

    Laser beam generating apparatus including a septum segment disposed longitudinally within the tubular structure of the apparatus. The septum provides for radiatively dissipating heat buildup within the tubular structure and for generating relatively uniform laser beam pulses so as to minimize or eliminate radial pulse delays (the chevron effect). 11 figures.

  3. The fifth generation computer

    SciTech Connect (OSTI)

    Moto-Oka, T.; Kitsuregawa, M.

    1985-01-01T23:59:59.000Z

    The leader of Japan's Fifth Generation computer project, known as the 'Apollo' project, and a young computer scientist elucidate in this book the process of how the idea came about, international reactions, the basic technology, prospects for realization, and the abilities of the Fifth Generation computer. Topics considered included forecasting, research programs, planning, and technology impacts.

  4. Final Report for "Analyzing and visualizing next generation climate data"

    SciTech Connect (OSTI)

    Pletzer, Alexander

    2012-11-13T23:59:59.000Z

    The project "Analyzing and visualizing next generation climate data" adds block-structured (mosaic) grid support, parallel processing, and 2D/3D curvilinear interpolation to the open-source UV-CDAT climate data analysis tool. Block structured grid support complies to the Gridspec extension submitted to the Climate and Forecast metadata conventions. It contains two parts: aggregation of data spread over multiple mosaic tiles (M-SPEC) and aggregation of temporal data stored in different files (F-SPEC). Together, M-SPEC and F-SPEC allow users to interact with data stored in multiple files as if the data were in a single file. For computational expensive tasks, a flexible, multi-dimensional, multi-type distributed array class allows users to process data in parallel using remote memory access. Both nodal and cell based interpolation is supported; users can choose between different interpolation libraries including ESMF and LibCF depending on the their particular needs.

  5. SAMPLING-BASED ROADMAP OF TREES FOR PARALLEL MOTION PLANNING 1 Sampling-Based Roadmap of Trees for Parallel

    E-Print Network [OSTI]

    Chen, Brian Y.

    SAMPLING-BASED ROADMAP OF TREES FOR PARALLEL MOTION PLANNING 1 Sampling-Based Roadmap of Trees for multiple query motion planning (Probabilistic Roadmap Method - PRM) with sampling-based tree methods algorithms, roadmap, tree, PRM, EST, RRT, SRT. I. INTRODUCTION HIGH-DIMENSIONAL problems such as those

  6. Use of Slip Ring Induction Generator for Wind Power Generation

    E-Print Network [OSTI]

    K Y Patil; D S Chavan

    Wind energy is now firmly established as a mature technology for electricity generation. There are different types of generators that can be used for wind energy generation, among which Slip ring Induction generator proves to be more advantageous. To analyse application of Slip ring Induction generator for wind power generation, an experimental model is developed and results are studied. As power generation from natural sources is the need today and variable speed wind energy is ample in amount in India, it is necessary to study more beneficial options for wind energy generating techniques. From this need a model is developed by using Slip ring Induction generator which is a type of Asynchronous generator.

  7. Compact neutron generator

    DOE Patents [OSTI]

    Leung, Ka-Ngo; Lou, Tak Pui

    2005-03-22T23:59:59.000Z

    A compact neutron generator has at its outer circumference a toroidal shaped plasma chamber in which a tritium (or other) plasma is generated. A RF antenna is wrapped around the plasma chamber. A plurality of tritium ion beamlets are extracted through spaced extraction apertures of a plasma electrode on the inner surface of the toroidal plasma chamber and directed inwardly toward the center of neutron generator. The beamlets pass through spaced acceleration and focusing electrodes to a neutron generating target at the center of neutron generator. The target is typically made of titanium tubing. Water is flowed through the tubing for cooling. The beam can be pulsed rapidly to achieve ultrashort neutron bursts. The target may be moved rapidly up and down so that the average power deposited on the surface of the target may be kept at a reasonable level. The neutron generator can produce fast neutrons from a T-T reaction which can be used for luggage and cargo interrogation applications. A luggage or cargo inspection system has a pulsed T-T neutron generator or source at the center, surrounded by associated gamma detectors and other components for identifying explosives or other contraband.

  8. Synthetic guide star generation

    DOE Patents [OSTI]

    Payne, Stephen A.; Page, Ralph H.; Ebbers, Christopher A.; Beach, Raymond J.

    2004-03-09T23:59:59.000Z

    A system for assisting in observing a celestial object and providing synthetic guide star generation. A lasing system provides radiation at a frequency at or near 938 nm and radiation at a frequency at or near 1583 nm. The lasing system includes a fiber laser operating between 880 nm and 960 nm and a fiber laser operating between 1524 nm and 1650 nm. A frequency-conversion system mixes the radiation and generates light at a frequency at or near 589 nm. A system directs the light at a frequency at or near 589 nm toward the celestial object and provides synthetic guide star generation.

  9. Synthetic guide star generation

    DOE Patents [OSTI]

    Payne, Stephen A. (Castro Valley, CA) [Castro Valley, CA; Page, Ralph H. (Castro Valley, CA) [Castro Valley, CA; Ebbers, Christopher A. (Livermore, CA) [Livermore, CA; Beach, Raymond J. (Livermore, CA) [Livermore, CA

    2008-06-10T23:59:59.000Z

    A system for assisting in observing a celestial object and providing synthetic guide star generation. A lasing system provides radiation at a frequency at or near 938 nm and radiation at a frequency at or near 1583 nm. The lasing system includes a fiber laser operating between 880 nm and 960 nm and a fiber laser operating between 1524 nm and 1650 nm. A frequency-conversion system mixes the radiation and generates light at a frequency at or near 589 nm. A system directs the light at a frequency at or near 589 nm toward the celestial object and provides synthetic guide star generation.

  10. Graph Generator Survey

    SciTech Connect (OSTI)

    Lothian, Josh [ORNL; Powers, Sarah S [ORNL; Sullivan, Blair D [ORNL; Baker, Matthew B [ORNL; Schrock, Jonathan [ORNL; Poole, Stephen W [ORNL

    2013-12-01T23:59:59.000Z

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of dierent application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  11. Parallelization and checkpointing of GPU applications through program transformation

    SciTech Connect (OSTI)

    Solano-Quinde, Lizandro Dami#19; an [Ames Laboratory

    2012-11-15T23:59:59.000Z

    GPUs have emerged as a powerful tool for accelerating general-purpose applications. The availability of programming languages that makes writing general-purpose applications for running on GPUs tractable have consolidated GPUs as an alternative for accelerating general purpose applications. Among the areas that have beneffited from GPU acceleration are: signal and image processing, computational fluid dynamics, quantum chemistry, and, in general, the High Performance Computing (HPC) Industry. In order to continue to exploit higher levels of parallelism with GPUs, multi-GPU systems are gaining popularity. In this context, single-GPU applications are parallelized for running in multi-GPU systems. Furthermore, multi-GPU systems help to solve the GPU memory limitation for applications with large application memory footprint. Parallelizing single-GPU applications has been approached by libraries that distribute the workload at runtime, however, they impose execution overhead and are not portable. On the other hand, on traditional CPU systems, parallelization has been approached through application transformation at pre-compile time, which enhances the application to distribute the workload at application level and does not have the issues of library-based approaches. Hence, a parallelization scheme for GPU systems based on application transformation is needed. Like any computing engine of today, reliability is also a concern in GPUs. GPUs are vulnerable to transient and permanent failures. Current checkpoint/restart techniques are not suitable for systems with GPUs. Checkpointing for GPU systems present new and interesting challenges, primarily due to the natural differences imposed by the hardware design, the memory subsystem architecture, the massive number of threads, and the limited amount of synchronization among threads. Therefore, a checkpoint/restart technique suitable for GPU systems is needed. The goal of this work is to exploit higher levels of parallelism and to develop support for application-level fault tolerance in applications using multiple GPUs. Our techniques reduce the burden of enhancing single-GPU applications to support these features. To achieve our goal, this work designs and implements a framework for enhancing a single-GPU OpenCL application through application transformation.

  12. Reduce, reuse, recycle, for robust cluster state generation

    E-Print Network [OSTI]

    Clare Horsman; Katherine L. Brown; William J. Munro; Vivien M. Kendon

    2011-05-03T23:59:59.000Z

    Efficient generation of cluster states is crucial for engineering large-scale measurement-based quantum computers. Hybrid matter-optical systems offer a robust, scalable path to this goal. Such systems have an ancilla which acts as a bus connecting the qubits. We show that by generating smaller cluster "Lego bricks", reusing one ancilla per brick, the cluster can be produced with maximal efficiency, requiring fewer than half the operations compared with no bus reuse. By reducing the time required to prepare sections of the cluster, bus reuse more than doubles the size of the computational workspace that can be used before decoherence effects dominate. A row of buses in parallel provides fully scalable cluster state generation requiring only 20 CPhase gates per bus use.

  13. Electric power monthly: April 1996, with data for January 1996

    SciTech Connect (OSTI)

    NONE

    1996-04-01T23:59:59.000Z

    The Electric Power Monthly (EPM) presents monthly electricity statistics for a wide audience including Congress, Federal and State agencies, the electric utility industry, and the general public. The purpose of this publication is to provide energy decision makers with accurate and timely information that may be used in forming various perspectives on electric issues that lie ahead. The Coal and Electric Data and Renewables Division; Office of Coal, Nuclear, Electric and Alternate Fuels, Energy Information Administration (EIA), Department of Energy prepares the EPM. This publication provides monthly statistics at the State, Census division, and US levels for net generation, fossil fuel consumption and stocks, quantity and quality of fossil fuels, cost of fossil fuels, electricity sales, revenue, and average revenue per kilowatt hour of electricity sold. Data on net generation, fuel consumption, fuel stocks, quantity and cost of fossil fuels are also displayed for the North American Electric Reliability Council (NERC) regions. 64 tabs.

  14. Solar central receiver systems comparative economics

    SciTech Connect (OSTI)

    Eicker, P J

    1980-04-01T23:59:59.000Z

    Several major conceptual design studies of solar central receiver systems and components have been completed in the last year. The results of these studies are used to compare the projected cost of electric power generation using central receiver systems with that of more conventional power generation. The cost estimate for a molten salt central receiver system is given. Levelized busbar energy cost is shown as a function of annual capacity factor indicating the fraction of the cost due to each of the subsystems. The estimated levelized busbar energy cost for a central receiver (70 to 90 mills per kilowatt hour) is compared with the levelized busbar energy cost for a new coal fired Rankine cycle plant. Sensitivities to the initial cost of coal and the delta fuel escalation are shown. (WHK)

  15. 1979 year-end electric power survey. [Monograph

    SciTech Connect (OSTI)

    Not Available

    1980-01-01T23:59:59.000Z

    The status of electric power supply, generating facility expansion, and electric power equipment manufacture is presented for 1979 on the basis of an industry survey covering investor-owned systems, public systems, and rural electric cooperatives as well as industrial installations which are interconnected with and supply power to utility systems. A 3.2 increase in generating capacity brought the total to 576.2 million kilowatts, 86 percent of which is thermal and the remainder hydro. Survey data for Hawaii is shown separately. December and summer peak capabilities, peak loads, and capability margins are presented for each of the nine regions. Their relationships to each other, to annual load factor, and to annual kilowatt hour requirements are also shown. Details of the orders placed with manufacturers for heavy power equipment are presented for the years 1975 to 1979. The manufacturing schedules of conventional and nuclear equipment are presented for the years 1979 to 1985. 28 tables. (DCK)

  16. Numerical field simulation for parallel transmission in MRI at 7 tesla

    E-Print Network [OSTI]

    Bernier, Jessica A. (Jessica Ashley)

    2011-01-01T23:59:59.000Z

    Parallel transmission (pTx) is a promising improvement to coil design that has been demonstrated to mitigate B1* inhomogeneity, manifest as center brightening, for high-field magnetic resonance imaging (MRI). Parallel ...

  17. Parallel Wavelet Transforms on Multiprocessors Topic 12: Architectures and Algorithms for Vision and other Senses

    E-Print Network [OSTI]

    Kutil, Rade

    Parallel Wavelet Transforms on Multiprocessors Topic 12: Architectures and Algorithms for Vision several issues relevant for parallel wavelet transforms and their possible implications on the choice compare pyramidal wavelet transform, wavelet packet decomposition, and the 'a trous algorithm. 1

  18. Serial and parallel Si, Ge, and SiGe direct-write with scanning...

    Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

    Serial and parallel Si, Ge, and SiGe direct-write with scanning probes and conducting stamps. Serial and parallel Si, Ge, and SiGe direct-write with scanning probes and conducting...

  19. An evaluation of a parallel-resonant current-source converter for an electrothermal thruster

    E-Print Network [OSTI]

    Tchamdjou, Aristide-Marie

    1996-01-01T23:59:59.000Z

    The Parallel-Resonant Current-Source Converter promises highly efficient DCDC power conversion. It uses zero-voltage switching to reduce the losses and improve the converter efficiency. The Parallel-Resonant Current-Source Converter has been...

  20. June 11, 2010 12:24 WSPC/INSTRUCTION FILE PPL Parallel Processing Letters

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    June 11, 2010 12:24 WSPC/INSTRUCTION FILE PPL Parallel Processing Letters c World Scientific Processing Letters 20, 4 (2010) 307-324" #12;June 11, 2010 12:24 WSPC/INSTRUCTION FILE PPL 2 Parallel