Powered by Deep Web Technologies
Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

NREL: News - NREL Finds Up to 6-cent per Kilowatt-Hour Extra...  

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

714 NREL Finds Up to 6-cent per Kilowatt-Hour Extra Value with Concentrated Solar Power The greater the penetration of renewables in California, the greater the value of CSP with...

2

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

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the1 -the Mid-Infrared0 ResourceAwardsSafeguards andSan$0.06 per kilowatt-hour for solar

3

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

E-Print Network [OSTI]

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

McAuley, Derek

4

Energy Replacement Generation Tax Exemption  

Broader source: Energy.gov [DOE]

Iowa imposes a replacement generation tax of 0.06 cents ($0.0006) per kilowatt-hour (kWh) on various forms of electricity generated within the state. This tax is imposed in lieu of a property tax...

5

Computer Assisted Parallel Program Generation  

E-Print Network [OSTI]

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 ...

Kawata, Shigeo

2015-01-01T23:59:59.000Z

6

Generating Revenue for Generating Green Electricity: Evidence from Laboratory Experiments on  

E-Print Network [OSTI]

Programs The first generation of green electricity programs were established over the last fifteen years generation. As of 2009, 860 such programs were operating in the United States (Bird and Sumner, 2010 per kilowatt-hour and decides the fraction of monthly electricity consumption to which the premium

Edwards, Paul N.

7

Parallel Animated Image File Generation Nishad Patel  

E-Print Network [OSTI]

, 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

Kaminsky, Alan

8

Full expandable model of parallel self-excited induction generators  

E-Print Network [OSTI]

for wind and small hydro power plants [1, 2]. They have advantages over conventional synchronous generators of wind power into power networks, an accurate dynamic model of the overall wind farm system is required to analyse the interaction between the wind farm and the power system. A system of parallel-operated SEIGs

Simões, Marcelo Godoy

9

Automatic generation of executable communication specifications from parallel applications  

SciTech Connect (OSTI)

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.

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

2011-01-19T23:59:59.000Z

10

On parallel electric field generation in transversely inhomogeneous plasmas  

E-Print Network [OSTI]

The generation of parallel electric fields by the propagation of ion cyclotron waves in the plasma with a transverse density inhomogeneity was studied. It was proven that the minimal model required to reproduce the previous kinetic simulation results of E_{||} generation [Tsiklauri et al 2005, Genot et al 2004] is the two-fluid, cold plasma approximation in the linear regime. By considering the numerical solutions it was also shown that the cause of E_{||} generation is the electron and ion flow separation induced by the transverse density inhomogeneity. We also investigate how E_{||} generation is affected by the mass ratio and found that amplitude attained by E_{||} decreases linearly as inverse of the mass ratio m_i/m_e. For realistic mass ratio of m_i/m_e=1836, such empirical scaling law, within a time corresponding to 3 periods of the driving ion cyclotron wave, is producing E_{||}=14 Vm^{-1} for solar coronal parameters. Increase in mass ratio does not have any effect on final parallel (magnetic field aligned) speed attained by electrons. However, parallel ion velocity decreases linearly with inverse of the mass ratio m_i/m_e. These results can be interpreted as following: (i) ion dynamics plays no role in the E_{||} generation; (ii) E_{||} \\propto 1/m_i scaling is caused by the fact that omega_d = 0.3 omega_{ci} \\propto 1/m_i is decreasing with the increase of ion mass, and hence the electron fluid can effectively "short-circuit" (recombine with) the slowly oscillating ions, hence producing smaller E_{||}.

David Tsiklauri

2007-11-28T23:59:59.000Z

11

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

E-Print Network [OSTI]

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

Mellor-Crummey, John

12

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the1 - September 2006 TheSteven Ashby Dr.presentations Papers &ParadeParallel

13

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

DOE Patents [OSTI]

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.

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

2003-05-06T23:59:59.000Z

14

Scalable parallel physical random number generator based on a superluminescent LED  

E-Print Network [OSTI]

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.

Xiaowen Li; Adam B Cohen; Thomas E Murphy; Rajarshi Roy

2011-03-15T23:59:59.000Z

15

Scalable parallel physical random number generator based on a superluminescent LED  

E-Print Network [OSTI]

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.

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

2011-01-01T23:59:59.000Z

16

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

SciTech Connect (OSTI)

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.

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

1997-05-01T23:59:59.000Z

17

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

SciTech Connect (OSTI)

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.

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

1998-03-01T23:59:59.000Z

18

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

E-Print Network [OSTI]

.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

Oregon, University of

19

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)

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.

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

20

Parallel Matlab MIT Lincoln Laboratory  

E-Print Network [OSTI]

Slide-1 Parallel Matlab MIT Lincoln Laboratory Parallel Matlab: The Next Generation Dr. Jeremy Lincoln LaboratorySlide-2 Parallel Matlab · Motivation · Challenges Outline · Introduction · Approach · Performance Results · Future Work and Summary #12;MIT Lincoln LaboratorySlide-3 Parallel Matlab Motivation: Do

Kepner, Jeremy

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Parallel MATLAB: Parallel For Loops  

E-Print Network [OSTI]

Parallel MATLAB: Parallel For Loops John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 69 #12;MATLAB Parallel Example ODE SWEEP Example FMINCON Example Conclusion 2 / 69 #12;INTRO: Parallel MATLAB Parallel MATLAB

Crawford, T. Daniel

22

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

E-Print Network [OSTI]

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

Zhang, Yong-Tao

23

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)

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.

Chasek, N.E.

1997-12-31T23:59:59.000Z

24

Fifth International Conference on Document Analysis and Recognition (ICDAR99), Bangalore, India, 1999, pp. 173-176 A Two-step Algorithm and its Parallelization for the Generation of Minimum  

E-Print Network [OSTI]

, 1999, pp. 173-176 A Two-step Algorithm and its Parallelization for the Generation of Minimum Containing. This reduces resource requirements and speeds up the subsequent rectangle detection step. The rectangle that completely encloses a geometric pattern. In this paper, we present a two-step MCR detection algorithm and its

Sural, Shamik

25

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...

26

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...

27

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...

28

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

SciTech Connect (OSTI)

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.

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

2012-04-01T23:59:59.000Z

29

Parallel MATLAB at VT: Parallel For Loops  

E-Print Network [OSTI]

Parallel MATLAB at VT: Parallel For Loops John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 72 #12;MATLAB Parallel Example ODE SWEEP Example FMINCON Example Conclusion 2 / 72 #12;INTRO: Parallel MATLAB Parallel MATLAB

Crawford, T. Daniel

30

Parallel MATLAB at VT: Parallel For Loops  

E-Print Network [OSTI]

Parallel MATLAB at VT: Parallel For Loops John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 71 #12;MATLAB Parallel Example ODE SWEEP Example FMINCON Example Conclusion 2 / 71 #12;INTRO: Parallel MATLAB Parallel MATLAB

Crawford, T. Daniel

31

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

SciTech Connect (OSTI)

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.

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

2012-04-01T23:59:59.000Z

32

Parallel MATLAB at VT: Parallel For Loops  

E-Print Network [OSTI]

Parallel MATLAB at VT: Parallel For Loops John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 56 #12;Matlab Parallel ODE SWEEP Example MD Example Conclusion 2 / 56 #12;INTRO: Parallel Matlab In a previous lecture we

Crawford, T. Daniel

33

Is Monte Carlo embarrassingly parallel?  

SciTech Connect (OSTI)

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)

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

34

Parallel flow diffusion battery  

DOE Patents [OSTI]

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.

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

1984-01-01T23:59:59.000Z

35

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsrucLas ConchasPassive Solar HomePromisingStoriesSANDIA REPORTSORN Template and1 THIS PAGE2SPRNG

36

Data-Parallel Language for Correct and Efficient Sparse Matrix Codes  

E-Print Network [OSTI]

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

Arnold, Gilad

2011-01-01T23:59:59.000Z

37

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

E-Print Network [OSTI]

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.

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

2009-01-01T23:59:59.000Z

38

Parallel digital forensics infrastructure.  

SciTech Connect (OSTI)

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.

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

2009-10-01T23:59:59.000Z

39

Parallel integrated thermal management  

DOE Patents [OSTI]

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.

Bennion, Kevin; Thornton, Matthew

2014-08-19T23:59:59.000Z

40

Parallel computing works  

SciTech Connect (OSTI)

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.

Not Available

1991-10-23T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

Purdue Agricultural Economics Report Page 1 In This Issue  

E-Print Network [OSTI]

. Around 40% of all new-generation power added to the electric grid in the U.S. in recent years has been converts the blades' speeds of about 18 to 20 rotations per minute to electricity-generating speeds of 1.4 million and 3 million kilowatt- hours (kWh) annually to provide electricity for 240 to 300 households

42

Towards Pervasive Parallelism Kunle Olukotun  

E-Print Network [OSTI]

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

John, Lizy Kurian

43

Parallel programming with PCN  

SciTech Connect (OSTI)

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).

Foster, I.; Tuecke, S.

1991-12-01T23:59:59.000Z

44

Automatic Parallelization of Hand Written Automotive Engine Control  

E-Print Network [OSTI]

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

Kasahara, Hironori

45

CEC-500-2010-FS-004 Development and Demonstration of  

E-Print Network [OSTI]

and electricity generation goals, the use of renewable energy technologies, including solar, must be expanded is to achieve a levelized cost of electricity of about 15 cents per kilowatt-hour for concentrating PV systems or absorbing reactive power to or from the grid. · Increasing plug-and-play capabilities of PV systems

46

H A&S 222a: Introduction to Energy and Environment (Life Under the Pale Sun) out: Tues 4 April 2006  

E-Print Network [OSTI]

turbines connected to electrical generators, making that much average electric power). An average family) in this comparison? ·Electrical energy is sold by the kilowatt hour (KWH). What is the cost of one KWH in Seattle (for example being the electrical energy required to burn a 100-watt light bulb for 10 hours). Convert

47

Making it Happen The Action Plan The Council believes it is critical that the region act now to help secure an adequate, efficient,  

E-Print Network [OSTI]

are minimal. This means that unlike a conventional generating unit, there are no operating costs to be avoided REDUCE SYSTEM COST AND RISK Conservation Conservation is the highest priority resource under passage at an average levelized cost of approximately 2.5 cents per kilowatt-hour. Despite

48

Energy Security in Nova Scotia Larry Hughes  

E-Print Network [OSTI]

of energy) PV ­ Photovoltaic (usually solar panels that generate electricity from the sun) RES ­ Renewable ) joules (a unit of energy) HST ­ Harmonized Sales Tax (Nova Scotia's sales tax: 8% provincial plus 6% federal) ha ­ hectare IEA ­ International Energy Agency kWh ­ Kilowatt-hour (a unit of energy) LDV ­ Light

Hughes, Larry

49

www.inl.gov A Future of Nuclear Energy  

E-Print Network [OSTI]

www.inl.gov A Future of Nuclear Energy: The Nuclear Renaissance, the Role of INL, and Potential in Nuclear Energy · Electrical Generation Supply/Demand · Global Warming, Greenhouse Gas Emissions/kilowatt-hour) Facts regarding nuclear energy in the US #12;· Standardized designs based on modularization producing

50

RNG: A Practitioner's Overview Random Number Generation  

E-Print Network [OSTI]

RNG: A Practitioner's Overview Random Number Generation A Practitioner's Overview Prof. Michael and Monte Carlo Methods Pseudorandom number generation Types of pseudorandom numbers Properties of these pseudorandom numbers Parallelization of pseudorandom number generators New directions for SPRNG Quasirandom

Mascagni, Michael

51

Scheduling of real-time communication network for parallel processing  

E-Print Network [OSTI]

very attractive for the next generation real-time systems. How to support realtime communication on the massively parallel computers becomes an important issue. This project focuses on wormhole networks of Paragon, and study different transmission...

Li, Hung

2012-06-07T23:59:59.000Z

52

Global Optimization and Parallelization of Integrity Constraint Checks  

E-Print Network [OSTI]

. The primary objective of global opti­ mization is to produce a global execution plan for a group ngine ( ) ice i c e parallel generation of evaluation plans Figure 1: Basic concept of integrity

Neumaier, Arnold

53

Improving Between-Shot Fusion Data Analysis with Parallel Structures  

SciTech Connect (OSTI)

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.

CHET NIETER

2005-07-27T23:59:59.000Z

54

Parallel optical sampler  

DOE Patents [OSTI]

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.

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

2014-05-20T23:59:59.000Z

55

An Experimental Study of Some Control Parameters in Parallel Genetic Programming  

E-Print Network [OSTI]

, 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

McKay, Robert Ian

56

Parallel Seismic Ray Tracing  

E-Print Network [OSTI]

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...

Jain, Tarun K

2013-12-09T23:59:59.000Z

57

Parallel programming with PCN  

SciTech Connect (OSTI)

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.

Foster, I.; Tuecke, S.

1993-01-01T23:59:59.000Z

58

Parallel clustering with CFinder  

E-Print Network [OSTI]

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.

Pollner, Peter; Vicsek, Tamas; 10.1142/S0129626412400014

2012-01-01T23:59:59.000Z

59

Parallel Transports in Webs  

E-Print Network [OSTI]

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.

Christian Fleischhack

2003-07-17T23:59:59.000Z

60

On parallel machine scheduling 1  

E-Print Network [OSTI]

On parallel machine scheduling 1 machines with setup times. The setup has to be performed by a single server. The objective is to minimize even for the case of two identical parallel machines. This paper presents a pseudopolynomial

Magdeburg, Universität

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Xyce parallel electronic simulator.  

SciTech Connect (OSTI)

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.

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

62

Parallel algorithms for inductance extraction  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . 30 3. Pin Connect . . . . . . . . . . . . . . . . . . . . . . . . . 31 C. The Inductance Extraction Algorithm . . . . . . . . . . . . . . 33 ix CHAPTER Page V COMPARISON WITH EXISTING WORK . . . . . . . . . . . . . 35 A. Ground Plane... . . . . . . . . . . . . . . . . . . . . . . . 52 1. Shared Memory Parallelization . . . . . . . . . . . . . . . 53 2. Mixed Mode Parallelization . . . . . . . . . . . . . . . . . 55 3. Distributed Memory Parallelization . . . . . . . . . . . . . 56 VII CONCLUSIONS...

Mahawar, Hemant

2007-09-17T23:59:59.000Z

63

Performance studies of the parallel VIM code  

SciTech Connect (OSTI)

In this paper, the authors evaluate the performance of the parallel version of the VIM Monte Carlo code on the IBM SPx at the High Performance Computing Research Facility at ANL. Three test problems with contrasting computational characteristics were used to assess effects in performance. A statistical method for estimating the inefficiencies due to load imbalance and communication is also introduced. VIM is a large scale continuous energy Monte Carlo radiation transport program and was parallelized using history partitioning, the master/worker approach, and p4 message passing library. Dynamic load balancing is accomplished when the master processor assigns chunks of histories to workers that have completed a previously assigned task, accommodating variations in the lengths of histories, processor speeds, and worker loads. At the end of each batch (generation), the fission sites and tallies are sent from each worker to the master process, contributing to the parallel inefficiency. All communications are between master and workers, and are serial. The SPx is a scalable 128-node parallel supercomputer with high-performance Omega switches of 63 {micro}sec latency and 35 MBytes/sec bandwidth. For uniform and reproducible performance, they used only the 120 identical regular processors (IBM RS/6000) and excluded the remaining eight planet nodes, which may be loaded by other`s jobs.

Shi, B.; Blomquist, R.N. [Argonne National Lab., IL (United States). Reactor Analysis Div.

1996-05-01T23:59:59.000Z

64

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

E-Print Network [OSTI]

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.

Noritaka Shimizu

2013-10-21T23:59:59.000Z

65

Parallel Monte Carlo reactor neutronics  

SciTech Connect (OSTI)

The issues affecting implementation of parallel algorithms for large-scale engineering Monte Carlo neutron transport simulations are discussed. For nuclear reactor calculations, these include load balancing, recoding effort, reproducibility, domain decomposition techniques, I/O minimization, and strategies for different parallel architectures. Two codes were parallelized and tested for performance. The architectures employed include SIMD, MIMD-distributed memory, and workstation network with uneven interactive load. Speedups linear with the number of nodes were achieved.

Blomquist, R.N.; Brown, F.B.

1994-03-01T23:59:59.000Z

66

Fuel cell generator  

DOE Patents [OSTI]

High temperature solid oxide electrolyte fuel cell generators which allow controlled leakage among plural chambers in a sealed housing. Depleted oxidant and fuel are directly reacted in one chamber to combust remaining fuel and preheat incoming reactants. The cells are preferably electrically arranged in a series-parallel configuration.

Isenberg, Arnold O. (Forest Hills, PA)

1983-01-01T23:59:59.000Z

67

Global synchronization of parallel processors using clock pulse width modulation  

DOE Patents [OSTI]

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.

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

68

Small file aggregation in a parallel computing system  

DOE Patents [OSTI]

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.

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

2014-09-02T23:59:59.000Z

69

Parallel contingency statistics with Titan.  

SciTech Connect (OSTI)

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.

Thompson, David C.; Pebay, Philippe Pierre

2009-09-01T23:59:59.000Z

70

An efficient parallel algorithm for matrix-vector multiplication  

SciTech Connect (OSTI)

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.

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

1993-03-01T23:59:59.000Z

71

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

72

Parallel Worldline Numerics: Implementation and Error Analysis  

E-Print Network [OSTI]

We give an overview of the worldline numerics technique, and discuss the parallel CUDA implementation of a worldline numerics algorithm. In the worldline numerics technique, we wish to generate an ensemble of representative closed-loop particle trajectories, and use these to compute an approximate average value for Wilson loops. We show how this can be done with a specific emphasis on cylindrically symmetric magnetic fields. The fine-grained, massive parallelism provided by the GPU architecture results in considerable speedup in computing Wilson loop averages. Furthermore, we give a brief overview of uncertainty analysis in the worldline numerics method. There are uncertainties from discretizing each loop, and from using a statistical ensemble of representative loops. The former can be minimized so that the latter dominates. However, determining the statistical uncertainties is complicated by two subtleties. Firstly, the distributions generated by the worldline ensembles are highly non-Gaussian, and so the standard error in the mean is not a good measure of the statistical uncertainty. Secondly, because the same ensemble of worldlines is used to compute the Wilson loops at different values of $T$ and $x_\\mathrm{ cm}$, the uncertainties associated with each computed value of the integrand are strongly correlated. We recommend a form of jackknife analysis which deals with both of these problems.

Dan Mazur; Jeremy S. Heyl

2014-07-28T23:59:59.000Z

73

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...

74

Fast parallel algorithms for short-range molecular dynamics  

SciTech Connect (OSTI)

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.

Plimpton, S.

1993-05-01T23:59:59.000Z

75

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

DOE Patents [OSTI]

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.

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

2014-02-11T23:59:59.000Z

76

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

DOE Patents [OSTI]

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.

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

2014-08-12T23:59:59.000Z

77

PSMGA Parallel Structured Model Generator for Mathematical ...  

E-Print Network [OSTI]

Capacity constraints (at lines 14 and 25) to model the edge capacity for routing ... The benchmark is typically the performance of a market index or a com-.

2014-10-09T23:59:59.000Z

78

Asynchronous parallel generating set search for linearly-constrained ...  

E-Print Network [OSTI]

Reference herein to any specific commercial product, process, or service by trade ...... 75/150/ 1/. 0 7.5e-01 -3e-08 56328/3584 32.3 91/1/ 15 283. 1. FCCU.

Joshua D. Griffin, Tamara G. Kolda, and Robert Michael Lewis

2006-08-08T23:59:59.000Z

79

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

E-Print Network [OSTI]

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 ...

Gnerre, Sante

80

Standard Templates Adaptive Parallel Library  

E-Print Network [OSTI]

]. 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...

Arzu, Francisco Jose

2000-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Tutorial: Parallel Simulation on Supercomputers  

SciTech Connect (OSTI)

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.

Perumalla, Kalyan S [ORNL

2012-01-01T23:59:59.000Z

82

Implicit Parallelism Alden H. Wright  

E-Print Network [OSTI]

Implicit Parallelism Alden H. Wright , Michael D. Vose ¡ , and Jonathan E. Rowe ¢ £ Dept. of Computer Science, University of Montana, Missoula, Montana 59812, USA wright@cs.umt.edu¤ Computer Science family of schemata. [Vose and Wright, 2001] showed that each schema corresponds to a vector in pop

Rowe, Jon

83

Diophantine Generation,  

E-Print Network [OSTI]

Diophantine Generation, Horizontal and Vertical Problems, and the Weak Vertical Method Alexandra Shlapentokh Diophantine Sets, Definitions and Generation Diophantine Sets Diophantine Generation Properties of Diophantine Generation Diophantine Family of Z Diophantine Family of a Polynomial Ring Going Down Horizontal

Shlapentokh, Alexandra

84

Solid oxide fuel cell generator  

DOE Patents [OSTI]

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.

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

1993-11-02T23:59:59.000Z

85

Solid state pulsed power generator  

DOE Patents [OSTI]

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.

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

2014-02-11T23:59:59.000Z

86

Hyper-Systolic Parallel Computing  

E-Print Network [OSTI]

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.

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

1995-07-25T23:59:59.000Z

87

A Parallel Graph Partitioner for STAPL  

E-Print Network [OSTI]

difficult task for programmers. They need to deal with low-level parallel mechanisms such as data distribution, inter-processor communication, and task placement. The goal of the Standard Template Adaptive Parallel Library (STAPL) is to provide a generic...

Castet, Nicolas

2013-04-26T23:59:59.000Z

88

A Parallel Geometric Multifrontal Solver Using Hierarchically ...  

E-Print Network [OSTI]

In particular, we demonstrate how to manage two layers of tree parallelism that integrates ... allelism within the outer multifrontal tree parallelism, and how the rank properties behave and benefit the ...... Ph.D. Dissertation. Institut National...

2014-07-17T23:59:59.000Z

89

On-the-fly pipeline parallelism  

E-Print Network [OSTI]

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 ...

Lee, I-Ting Angelina

90

Feedback-optimized parallel tempering Monte Carlo  

E-Print Network [OSTI]

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

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

2006-01-01T23:59:59.000Z

91

Hybrid Parallel Part I. Preliminaries  

E-Print Network [OSTI]

;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

Kaminsky, Alan

92

Parallel Repetition of Entangled Games  

E-Print Network [OSTI]

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.

Julia Kempe; Thomas Vidick

2011-05-11T23:59:59.000Z

93

Optimization Online - A PARALLEL interior point decomposition ...  

E-Print Network [OSTI]

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

Kartik Krishnan Sivaramakrishnan

2006-12-04T23:59:59.000Z

94

Nonlinear parameter estimation in parallel computing environments  

E-Print Network [OSTI]

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...

Li, Jie

1996-01-01T23:59:59.000Z

95

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

DOE Patents [OSTI]

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.

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

1996-01-30T23:59:59.000Z

96

Light beam frequency comb generator  

DOE Patents [OSTI]

A light beam frequency comb generator uses an acousto-optic modulator to generate a plurality of light beams with frequencies which are uniformly separated and possess common noise and drift characteristics. A well collimated monochromatic input light beam is passed through this modulator to produce a set of both frequency shifted and unshifted optical beams. An optical system directs one or more frequency shifted beams along a path which is parallel to the path of the input light beam such that the frequency shifted beams are made incident on the modulator proximate to but separated from the point of incidence of the input light beam. After the beam is thus returned to and passed through the modulator repeatedly, a plurality of mutually parallel beams are generated which are frequency-shifted different numbers of times and possess common noise and drift characteristics.

Priatko, Gordon J. (Cupertino, CA); Kaskey, Jeffrey A. (Livermore, CA)

1992-01-01T23:59:59.000Z

97

Xyce parallel electronic simulator design.  

SciTech Connect (OSTI)

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.

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

2010-09-01T23:59:59.000Z

98

1. Generation 1 1. Generation  

E-Print Network [OSTI]

1. Generation 1 _________________________________________________________________________ 1. Generation Sound and vibrations or, in more general terms, oscillations of matter (solids or fluids) are generated in many different dynamic processes. The basic mechanisms which underlie these oscillations

Berlin,Technische Universität

99

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,...

100

Buffered coscheduling for parallel programming and enhanced fault tolerance  

DOE Patents [OSTI]

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

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

2006-01-31T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

Final Report: Center for Programming Models for Scalable Parallel Computing  

SciTech Connect (OSTI)

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.

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

2011-09-13T23:59:59.000Z

102

Information hiding in parallel programs  

SciTech Connect (OSTI)

A fundamental principle in program design is to isolate difficult or changeable design decisions. Application of this principle to parallel programs requires identification of decisions that are difficult or subject to change, and the development of techniques for hiding these decisions. We experiment with three complex applications, and identify mapping, communication, and scheduling as areas in which decisions are particularly problematic. We develop computational abstractions that hide such decisions, and show that these abstractions can be used to develop elegant solutions to programming problems. In particular, they allow us to encode common structures, such as transforms, reductions, and meshes, as software cells and templates that can reused in different applications. An important characteristic of these structures is that they do not incorporate mapping, communication, or scheduling decisions: these aspects of the design are specified separately, when composing existing structures to form applications. This separation of concerns allows the same cells and templates to be reused in different contexts.

Foster, I.

1992-01-30T23:59:59.000Z

103

Unsteady Turbomachinery Computations Using Massively Parallel Platforms  

E-Print Network [OSTI]

Unsteady Turbomachinery Computations Using Massively Parallel Platforms Edwin van der Weide with the inherently unsteady nature of turbomachinery flows, due to the motion of the rotors, this means

Alonso, Juan J.

104

Cost hierarchies for abstract parallel machines  

E-Print Network [OSTI]

O'Donnell,J.T. Rauber,T. Ruenger,G. 13th International Workshop on Languages and Compilers for Parallel Computing (LCPC 2000) LNCS, Springer

O'Donnell, J.T.

105

A Parallel Inertial Proximal Optimization Method  

E-Print Network [OSTI]

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...

2011-07-01T23:59:59.000Z

106

Parallel auto-correlative statistics with VTK.  

SciTech Connect (OSTI)

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.

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

2013-08-01T23:59:59.000Z

107

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...

108

Parallel Processing Letters World Scientific Publishing Company  

E-Print Network [OSTI]

Parallel Processing Letters © World Scientific Publishing Company THE OPERATIONS DASHBOARD essential operational services, it is imperative that grid administrators can troubleshoot the problems

Miller, Russ

109

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

SciTech Connect (OSTI)

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.

NONE

1995-06-01T23:59:59.000Z

110

Parallel MATLAB: Single Program Multiple Data  

E-Print Network [OSTI]

Parallel MATLAB: Single Program Multiple Data John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 67 #12;MATLAB Parallel MATLAB sets up one special agent called the client. MATLAB sets up the requested number of workers, each

Crawford, T. Daniel

111

Parallel MATLAB: Single Program Multiple Data  

E-Print Network [OSTI]

Parallel MATLAB: Single Program Multiple Data John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 67 #12;Matlab Parallel ( 'myscript', 'Profile', ... 'ithaca_R2012a', 'matlabpool', 7 ) 5 / 67 #12;SPMD: The SPMD Environment Matlab

Crawford, T. Daniel

112

Parallel MATLAB: Single Program Multiple Data  

E-Print Network [OSTI]

Parallel MATLAB: Single Program Multiple Data John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 66 #12;MATLAB Parallel MATLAB sets up one special worker called the client. MATLAB sets up the requested number of workers, each

Crawford, T. Daniel

113

Batch Scheduling with Deadlines on Parallel Machines  

E-Print Network [OSTI]

Batch Scheduling with Deadlines on Parallel Machines Peter Brucker Mikhail Y. Kovalyov, Yakov M of scheduling G groups of jobs on m parallel machines is considered. Each group consists of several identical) and to schedule the batches on the machines. It is possible for different batches of the same group

Magdeburg, Universität

114

Abstract AndParallel Machines Nachum Dershowitz  

E-Print Network [OSTI]

Abstract And­Parallel Machines Nachum Dershowitz University of Illinois Urbana, IL 61801 U are introduced. The first of them, the And­ Parallel Turing Machine, can be viewed as a generalization of the deterministic Turing machine in which the infinite tape is replaced by an infinite tree­like tape on which

Dershowitz, Nachum

115

A Framework for Heterogeneous Desktop Parallel Computing  

E-Print Network [OSTI]

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

Emmerich, Michael

116

Cluster Parallel Loops Part I. Preliminaries  

E-Print Network [OSTI]

;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

Kaminsky, Alan

117

Randomized Parallel Algorithms in Optimization Stephen Wright  

E-Print Network [OSTI]

Randomized Parallel Algorithms in Optimization Stephen Wright University of Wisconsin-Madison July 2013 Wright (UW-Madison) Random Parallel Optimization July 2013 1 / 52 #12;Collaborators @ UW-Madison Victor Bittorf Ji Liu Ben Recht ( Berkeley) Chris R´e ( Stanford) Krishna Sridhar Wright (UW

118

Massively Parallel Data Mining Using Reconfigurable Hardware  

E-Print Network [OSTI]

]. 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

Chamberlain, Roger

119

Broadcasting a message in a parallel computer  

DOE Patents [OSTI]

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.

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

2011-08-02T23:59:59.000Z

120

Evaluating parallel relational databases for medical data analysis.  

SciTech Connect (OSTI)

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.

Rintoul, Mark Daniel; Wilson, Andrew T.

2012-03-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

Natural Language Generation for the Semantic Web: Unsupervised template extraction  

E-Print Network [OSTI]

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...

Duma, Daniel

2012-11-28T23:59:59.000Z

122

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

SciTech Connect (OSTI)

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.

Polychronopoulos, Constantine D.

1986-08-01T23:59:59.000Z

123

Improved control strategy for parallel logic programming  

SciTech Connect (OSTI)

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.

Chung, I.J.

1989-01-01T23:59:59.000Z

124

Xyce parallel electronic simulator : users' guide.  

SciTech Connect (OSTI)

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.

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

125

Distributed parallel messaging for multiprocessor systems  

DOE Patents [OSTI]

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.

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

2013-06-04T23:59:59.000Z

126

Distributed Generation  

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

come a long way in addressing interconnection standards for distributed generation, utilities have largely overlooked the untapped potential of these resources. Under certain...

127

Parallel phase-sensitive three-dimensional imaging camera  

DOE Patents [OSTI]

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.

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

128

HYBUD: An Energy-Efficient Architecture for Hybrid Parallel Disk Systems  

E-Print Network [OSTI]

consumption in parallel disk systems has strong impacts on the cost of backup power-generation and cooling consumption and cooling. Although flash memory is very energy- efficient compared to disk drives, flash memory but not limited to, video surveillance [1], remote-sensing database systems [2], and digital libraries [5

Qin, Xiao

129

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

E-Print Network [OSTI]

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

Buntinas, Darius

130

A New Family of HighPerformance Parallel Decimal Multipliers Alvaro Vazquez, Elisardo Antelo  

E-Print Network [OSTI]

­save multioperand ad- dition that uses a novel BCD­4221 recoding for decimal digits. It significantly improves present three schemes for fast and ef- ficient generation of partial products in parallel. The re- coding of the BCD­8421 multiplier operand into minimally redundant signed­digit radix­10, radix­4 and radix­5 rep

California at Davis, University of

131

Modeling, Analysis, and Design of Stationary Reference Frame Droop Controlled Parallel Three-  

E-Print Network [OSTI]

the performance and robustness of the parallel VSI system control architecture. Keywords: Distributed Generation. In addition, power electronics-based MGs are useful when integrating renewable energy resources, distributed in island mode, restoring the frequency and amplitude in spite of deviations created by the total amount

Teodorescu, Remus

132

Efficient Parallel Data Mining with the Apriori Algorithm on FPGAs1  

E-Print Network [OSTI]

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

Hwang, Kai

133

CS 525: Parallel Computing Spring 2001  

E-Print Network [OSTI]

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

Grama, Ananth

134

Parallel VLSI Circuit Analysis and Optimization  

E-Print Network [OSTI]

CAD application addressed in this dissertation is the Simulation Program with Integrated Circuit Emphasis (SPICE) like circuit simulation. SPICE simulation is often regarded as the bottleneck of the design flow. Recently, parallel circuit simulation...

Ye, Xiaoji

2012-02-14T23:59:59.000Z

135

Provably Efficient Adaptive Scheduling for Parallel Jobs  

E-Print Network [OSTI]

Scheduling competing jobs on multiprocessors has always been an important issue for parallel and distributed systems. The challenge is to ensure global, system-wide efficiency while offering a level of fairness to user ...

He, Yuxiong

136

Parallel Algorithms for Big Data Optimization  

E-Print Network [OSTI]

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

2014-02-21T23:59:59.000Z

137

Parallel magnetic resonance imaging: characterization and comparison  

E-Print Network [OSTI]

[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...

Rane, Swati Dnyandeo

2005-11-01T23:59:59.000Z

138

Parallel programming with PCN. Revision 1  

SciTech Connect (OSTI)

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).

Foster, I.; Tuecke, S.

1991-12-01T23:59:59.000Z

139

Constraint Satisfaction Via Partially Parallel Propagation Steps  

E-Print Network [OSTI]

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

Walter Hower Institut; Walter Hower

1992-01-01T23:59:59.000Z

140

Performance evaluation of scalable parallel computing networks  

E-Print Network [OSTI]

PERFORMANCE EVALUATION OF SCALABLE PARALLEL COMPUTING NETWORKS A Thesis by ROBERT TODD WILKINSON Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE May 1996 Major Subject: Computer Science PERFORMANCE EVALUATION OF SCALABLE PARALLEL COiVIPUTING NETWORKS A Thesis by ROBERT TODD WILKINSON Submitted to Texas ARM University in partial fulfillment of the requirements for the degree...

Wilkinson, Robert Todd

1996-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

LDV Measurement of Confined Parallel Jet Mixing  

SciTech Connect (OSTI)

Laser Doppler Velocimetry (LDV) measurements were taken in a confinement, bounded by two parallel walls, into which issues a row of parallel jets. Two-component measurements were taken of two mean velocity components and three Reynolds stress components. As observed in isolated three dimensional wall bounded jets, the transverse diffusion of the jets is quite large. The data indicate that this rapid mixing process is due to strong secondary flows, transport of large inlet intensities and Reynolds stress anisotropy effects.

R.F. Kunz; S.W. D'Amico; P.F. Vassallo; M.A. Zaccaria

2001-01-31T23:59:59.000Z

142

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...

143

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...

144

Fuel dissipater for pressurized fuel cell generators  

DOE Patents [OSTI]

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.

Basel, Richard A.; King, John E.

2003-11-04T23:59:59.000Z

145

Super Marx Generator for Thermonuclear Ignition  

E-Print Network [OSTI]

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,...

Winterberg, Friedwardt

2008-01-01T23:59:59.000Z

146

A methodology for deriving parallel programs with a family of Abstract Parallel Machines  

E-Print Network [OSTI]

O'Donnell,J.T. Runger,G. Lecture Notes in Computer Science. Volume 1300. Euro-Par'97: Parallel Processing (Passau, Germany) pp 662-669 Springer

O'Donnell, J.T.

147

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

E-Print Network [OSTI]

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.

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

2014-10-14T23:59:59.000Z

148

Thermoelectric Generators 1. Thermoelectric generator  

E-Print Network [OSTI]

. Cold Hot I - -- - - - - -- Figure 1 Electron concentration in a thermoelectric material. #12;2 A large1 Thermoelectric Generators HoSung Lee 1. Thermoelectric generator 1.1 Basic Equations In 1821 on the direction of current and material [3]. This is called the Thomson effect (or Thomson heat). These three

Lee, Ho Sung

149

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

SciTech Connect (OSTI)

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.

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

2008-10-09T23:59:59.000Z

150

Trinomialtree based parallel option price Alexandros V. Gerbessiotis  

E-Print Network [OSTI]

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

Gerbessiotis, Alexandros V.

151

Salvador de Bahia, 2008 1 Parallel Computing: General  

E-Print Network [OSTI]

Salvador de Bahia, 2008 1 Parallel Computing: General Perspective and Applications Domingo Giménez://dis.um.es/~domingo #12;Salvador de Bahia, 2008 2 Content General aspects of parallel computing Necessity of parallel Case study II: Meteorology #12;Salvador de Bahia, 2008 3 Parallel Computing Several processors working

Giménez, Domingo

152

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

E-Print Network [OSTI]

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

Seinstra, Frank J.

153

1996 InternationalConference on Parallel Processing PARALLEL IMPLEMENTATION OF CONE BEAM TOMOGRAPHY  

E-Print Network [OSTI]

projections us- ing computed tomography (CT) is the noninvasive measure of structure from external as follows: A. Weight projection data B. Convolve weighted projection data Pe*(u,v) = P&L, U) * h(u) C1996 InternationalConference on Parallel Processing PARALLEL IMPLEMENTATION OF CONE BEAM TOMOGRAPHY

Chaudhary, Vipin

154

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

DOE Patents [OSTI]

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.

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

2013-11-12T23:59:59.000Z

155

Java Parallel Secure Stream for Grid Computing  

SciTech Connect (OSTI)

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.

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

2001-09-01T23:59:59.000Z

156

Microwave generator  

DOE Patents [OSTI]

A microwave generator is provided for generating microwaves substantially from virtual cathode oscillation. Electrons are emitted from a cathode and accelerated to an anode which is spaced apart from the cathode. The anode has an annular slit there through effective to form the virtual cathode. The anode is at least one range thickness relative to electrons reflecting from the virtual cathode. A magnet is provided to produce an optimum magnetic field having the field strength effective to form an annular beam from the emitted electrons in substantial alignment with the annular anode slit. The magnetic field, however, does permit the reflected electrons to axially diverge from the annular beam. The reflected electrons are absorbed by the anode in returning to the real cathode, such that substantially no reflexing electrons occur. The resulting microwaves are produced with a single dominant mode and are substantially monochromatic relative to conventional virtual cathode microwave generators. 6 figs.

Kwan, T.J.T.; Snell, C.M.

1987-03-31T23:59:59.000Z

157

Xyce parallel electronic simulator release notes.  

SciTech Connect (OSTI)

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.

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

158

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

E-Print Network [OSTI]

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

Edelman, Alan

159

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

SciTech Connect (OSTI)

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.

Nix, R.G.

1996-06-01T23:59:59.000Z

160

GPU-ABiSort: Optimal parallel sorting on stream architectures  

E-Print Network [OSTI]

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.

Alexander Gre; Gabriel Zachmann

2006-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

Users manual for the Chameleon parallel programming tools  

SciTech Connect (OSTI)

Message passing is a common method for writing programs for distributed-memory parallel computers. Unfortunately, the lack of a standard for message passing has hampered the construction of portable and efficient parallel programs. In an attempt to remedy this problem, a number of groups have developed their own message-passing systems, each with its own strengths and weaknesses. Chameleon is a second-generation system of this type. Rather than replacing these existing systems, Chameleon is meant to supplement them by providing a uniform way to access many of these systems. Chameleon`s goals are to (a) be very lightweight (low over-head), (b) be highly portable, and (c) help standardize program startup and the use of emerging message-passing operations such as collective operations on subsets of processors. Chameleon also provides a way to port programs written using PICL or Intel NX message passing to other systems, including collections of workstations. Chameleon is tracking the Message-Passing Interface (MPI) draft standard and will provide both an MPI implementation and an MPI transport layer. Chameleon provides support for heterogeneous computing by using p4 and PVM. Chameleon`s support for homogeneous computing includes the portable libraries p4, PICL, and PVM and vendor-specific implementation for Intel NX, IBM EUI (SP-1), and Thinking Machines CMMD (CM-5). Support for Ncube and PVM 3.x is also under development.

Gropp, W. [Argonne National Lab., IL (United States); Smith, B. [Univ. of California, Los Angeles, CA (United States). Dept. of Mathematics

1993-06-01T23:59:59.000Z

162

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

DOE Patents [OSTI]

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.

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

2014-10-21T23:59:59.000Z

163

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

SciTech Connect (OSTI)

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.

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

164

Parallel processor-based raster graphics system architecture  

DOE Patents [OSTI]

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.

Littlefield, Richard J. (Seattle, WA)

1990-01-01T23:59:59.000Z

165

A parallel scaled conjugate-gradient  

E-Print Network [OSTI]

. 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

Aykanat, Cevdet

166

Parallel MATLAB: Single Program Multiple Data  

E-Print Network [OSTI]

Parallel MATLAB: Single Program Multiple Data John Burkardt (FSU) Gene Cliff (AOE/ICAM - ecliff: Advanced Research Computing ICAM: Interdisciplinary Center for Applied Mathematics 1 / 69 #12;Matlab ( 'myscript', 'Profile', ... 'ithaca_R2012a', 'matlabpool', 7 ) 5 / 69 #12;SPMD: The SPMD Environment Matlab

Crawford, T. Daniel

167

Performance studies of the parallel VIM code  

SciTech Connect (OSTI)

In this paper, we evaluate the performance of the parallel version of the VIM Monte Carlo code on the IBM SPx at the High Performance Computing Research Facility at Argonne National Laboratory. Three test problems with contrasting computational characteristics were used to assess effects in performance. A statistical method for estimating the inefficiencies due to load imbalance and communication is also introduced.

Shi, B.; Blomquist, R.N. [Argonne National Laboratory, IL (United States)

1996-12-31T23:59:59.000Z

168

(Parallel Linear Algebra Package) Jess Cmara Moreno  

E-Print Network [OSTI]

á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

Giménez, Domingo

169

Message passing with parallel queue traversal  

DOE Patents [OSTI]

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.

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

2012-05-01T23:59:59.000Z

170

Parallelized Interpolation: A Quantitative Assessment Scott Blaha  

E-Print Network [OSTI]

Parallelized Interpolation: A Quantitative Assessment Scott Blaha Swarthmore College Mustafa Paksoy- cent I/O-efficient point cloud to DEM algorithm (0), from 52% to 86% of running time was spent inter-off in interpolation is quality (e.g. representativeness) of the resulting DEM ver- sus the computational complexity

Danner, Andrew

171

Parallel programming with PCN. Revision 2  

SciTech Connect (OSTI)

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.

Foster, I.; Tuecke, S.

1993-01-01T23:59:59.000Z

172

Instrumentation for parallel magnetic resonance imaging  

E-Print Network [OSTI]

of the art of parallel MR imaging. First, a low-cost desktop MR scanner was developed (2.54 cm fields-of view) at low magnetic field strengths (25 T). The performance of the prototype was verified through bench...

Brown, David Gerald

2007-04-25T23:59:59.000Z

173

Decomposing Linear Programs for Parallel Solution?  

E-Print Network [OSTI]

Decomposing Linear Programs for Parallel Solution? Ali P nar, Umit V. Catalyurek, Cevdet Aykanat in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited industrial applications and the advent of powerful computers have in- creased the users' ability to formulate

?atalyürek, ?mit V.

174

Decomposing Linear Programs for Parallel Solution ?  

E-Print Network [OSTI]

Decomposing Linear Programs for Parallel Solution ? Ali Pinar, ¨ Umit V. C¸ ataly¨urek, Cevdet in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited with successful industrial applications and the advent of powerful computers have in­ creased the users' ability

?atalyürek, ?mit V.

175

Original article Parallel selection of ethanol  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

176

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

DOE Patents [OSTI]

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.

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

2014-02-11T23:59:59.000Z

177

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

DOE Patents [OSTI]

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.

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

2013-10-29T23:59:59.000Z

178

Sequential and parallel algorithms for minimum cost parallel decomposition of finite state machines  

E-Print Network [OSTI]

form a lattice, where each node in the lattice has a cost associated with it. An algorithm to build the lattice is presented. Also to find the best pos- sible parallel decomposition, an optimal cost algorithm is proposed. Sequential snd parallel.... The OSI Reference Model C. Bottlenecks in Communication Protocols D. High Speed Protocols E. High-Speed Implementations F. Structure of the Thesis THEORETICAL BACKGROUND A. Set Theory . B. Partially Ordered Sets and Lattices C. Sequential Machines...

Shelke, Rajendra Ram

1992-01-01T23:59:59.000Z

179

Generation Technologies  

E-Print Network [OSTI]

Many local governments are using green power in their facilities and providing assistance to local businesses and residents to do the same. Green power is a subset of renewable energy that is produced with no GHG emissions, typically from solar, wind, geothermal, biogas, biomass, or low-impact small hydroelectric sources, includes three types of products: utility products (i.e., green power purchased from the utility through the electricity grid), renewable energy certificates (RECs), and on-site generation. Opportunities to purchase these products are increasing significantly, with annual green power market growth rates

Green Power

2005-01-01T23:59:59.000Z

180

Engineering innovation to reduce wind power COE  

SciTech Connect (OSTI)

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.

Ammerman, Curtt Nelson [Los Alamos National Laboratory

2011-01-10T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

Electric power monthly, February 1999 with data for November 1998  

SciTech Connect (OSTI)

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.

NONE

1999-02-01T23:59:59.000Z

182

Instruction sets for Parallel Random Access Machines  

SciTech Connect (OSTI)

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.

Trahan, J.L.

1988-01-01T23:59:59.000Z

183

Locating hardware faults in a parallel computer  

DOE Patents [OSTI]

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.

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

2010-04-13T23:59:59.000Z

184

Nonlinear parallel momentum transport in strong turbulence  

E-Print Network [OSTI]

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.

Wang, Lu; Diamond, P H

2015-01-01T23:59:59.000Z

185

Parallel machine architecture for production rule systems  

DOE Patents [OSTI]

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.

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

1989-01-01T23:59:59.000Z

186

Parallel Web Scripting with Reactive Constraints Thibaud Hottelier  

E-Print Network [OSTI]

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

Bodik, Rastisla

187

Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization  

E-Print Network [OSTI]

processing unit (GPGPU) technology provides massive parallel computing power. This research turns the complex computation task of circuit optimization into many subtasks processed by parallel threads. The proposed task partitioning and scheduling methods take...

Liu, Yifang

2010-07-14T23:59:59.000Z

188

Parallel and Distributed Multi-Algorithm Circuit Simulation  

E-Print Network [OSTI]

With the proliferation of parallel computing, parallel computer-aided design (CAD) has received significant research interests. Transient transistor-level circuit simulation plays an important role in digital/analog circuit design and verification...

Dai, Ruicheng

2012-10-19T23:59:59.000Z

189

Parallel Solutions of Partial Differential Equations with Adaptive Multigrid Methods  

E-Print Network [OSTI]

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

Wieners, Christian

190

A Taxonomy of Parallel Prefix Networks David Harris  

E-Print Network [OSTI]

A Taxonomy of Parallel Prefix Networks David Harris Harvey Mudd College / Sun Microsystems Laboratories 301 E. Twelfth St. Claremont, CA 91711 David_Harris@hmc.edu Abstract - Parallel prefix networks

Harris, David Money

191

Data Parallel SwitchLevel Simulation \\Lambda Randal E. Bryant  

E-Print Network [OSTI]

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

Bryant, Randal E.

192

VALIDATION OF MASSIVELY PARALLEL SIMULATIONS OF DYNAMIC FRACTURE AND  

E-Print Network [OSTI]

VALIDATION OF MASSIVELY PARALLEL SIMULATIONS OF DYNAMIC FRACTURE AND FRAGMENTATION OF BRITTLE element simulations of dynamic fracture and fragmentation of brittle solids are presented. Fracture the results of massively parallel numerical simulations of dynamic fracture and fragmentation in brittle

Barr, Al

193

Shape-based Cost Analysis of Skeletal Parallel Programs  

E-Print Network [OSTI]

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 ...

Hayashi, Yasushi

194

Parallel algorithms and architectures for low power video decoding  

E-Print Network [OSTI]

Parallelism coupled with voltage scaling is an effective approach to achieve high processing performance with low power consumption. This thesis presents parallel architectures and algorithms designed to deliver the power ...

Sze, Vivienne

2010-01-01T23:59:59.000Z

195

Virtual detector of synchrotron radiation (VDSR) - A C++ parallel code for particle tracking and radiation calculation  

SciTech Connect (OSTI)

The Virtual Detector for Synchrotron Radiation (VDSR) is a parallel C++ code developed to calculate the incoherent radiation from a single charged particle or a beam moving in given external electro-magnetic fields. In this proceedings the code structure and features are introduced. An example of radiation generation from the betatron motion of a beam in the focusing fields of the wake in a laser-plasma accelerator is presented.

Rykovanov, S. G.; Chen, M.; Geddes, C. G. R.; Schroeder, C. B.; Esarey, E.; Leemans, W. P. [Lawrence Berkeley National Laboratory, 1 Cyclotron Rd, Berkeley CA 94720 (United States)

2012-12-21T23:59:59.000Z

196

MASSIVE HYBRID PARALLELISM FOR FULLY IMPLICIT MULTIPHYSICS  

SciTech Connect (OSTI)

As hardware advances continue to modify the supercomputing landscape, traditional scientific software development practices will become more outdated, ineffective, and inefficient. The process of rewriting/retooling existing software for new architectures is a Sisyphean task, and results in substantial hours of development time, effort, and money. Software libraries which provide an abstraction of the resources provided by such architectures are therefore essential if the computational engineering and science communities are to continue to flourish in this modern computing environment. The Multiphysics Object Oriented Simulation Environment (MOOSE) framework enables complex multiphysics analysis tools to be built rapidly by scientists, engineers, and domain specialists, while also allowing them to both take advantage of current HPC architectures, and efficiently prepare for future supercomputer designs. MOOSE employs a hybrid shared-memory and distributed-memory parallel model and provides a complete and consistent interface for creating multiphysics analysis tools. In this paper, a brief discussion of the mathematical algorithms underlying the framework and the internal object-oriented hybrid parallel design are given. Representative massively parallel results from several applications areas are presented, and a brief discussion of future areas of research for the framework are provided.

Cody J. Permann; David Andrs; John W. Peterson; Derek R. Gaston

2013-05-01T23:59:59.000Z

197

ParCAT: Parallel Climate Analysis Toolkit  

SciTech Connect (OSTI)

Climate science is employing increasingly complex models and simulations to analyze the past and predict the future of Earth s climate. This growth in complexity is creating a widening gap between the data being produced and the ability to analyze the datasets. Parallel computing tools are necessary to analyze, compare, and interpret the simulation data. The Parallel Climate Analysis Toolkit (ParCAT) provides basic tools to efficiently use parallel computing techniques to make analysis of these datasets manageable. The toolkit provides the ability to compute spatio-temporal means, differences between runs or differences between averages of runs, and histograms of the values in a data set. ParCAT is implemented as a command-line utility written in C. This allows for easy integration in other tools and allows for use in scripts. This also makes it possible to run ParCAT on many platforms from laptops to supercomputers. ParCAT outputs NetCDF files so it is compatible with existing utilities such as Panoply and UV-CDAT. This paper describes ParCAT and presents results from some example runs on the Titan system at ORNL.

Smith, Brian E [ORNL; Steed, Chad A [ORNL; Shipman, Galen M [ORNL; Ricciuto, Daniel M [ORNL; Thornton, Peter E [ORNL; Wehner, Michael [Lawrence Berkeley National Laboratory (LBNL); Williams, Dean N. [Lawrence Livermore National Laboratory (LLNL)

2013-01-01T23:59:59.000Z

198

Massive hybrid parallelism for fully implicit multiphysics  

SciTech Connect (OSTI)

As hardware advances continue to modify the supercomputing landscape, traditional scientific software development practices will become more outdated, ineffective, and inefficient. The process of rewriting/retooling existing software for new architectures is a Sisyphean task, and results in substantial hours of development time, effort, and money. Software libraries which provide an abstraction of the resources provided by such architectures are therefore essential if the computational engineering and science communities are to continue to flourish in this modern computing environment. The Multiphysics Object Oriented Simulation Environment (MOOSE) framework enables complex multiphysics analysis tools to be built rapidly by scientists, engineers, and domain specialists, while also allowing them to both take advantage of current HPC architectures, and efficiently prepare for future supercomputer designs. MOOSE employs a hybrid shared-memory and distributed-memory parallel model and provides a complete and consistent interface for creating multiphysics analysis tools. In this paper, a brief discussion of the mathematical algorithms underlying the framework and the internal object-oriented hybrid parallel design are given. Representative massively parallel results from several applications areas are presented, and a brief discussion of future areas of research for the framework are provided. (authors)

Gaston, D. R.; Permann, C. J.; Andrs, D.; Peterson, J. W. [Idaho National Laboratory, 2525 N. Fremont Ave., Idaho Falls, ID 83415 (United States)

2013-07-01T23:59:59.000Z

199

Xyce parallel electronic simulator : reference guide.  

SciTech Connect (OSTI)

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.

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

200

On Optimal Slicing of Parallel Programs Markus Muller-Olm  

E-Print Network [OSTI]

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

Müller-Olm, Markus

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

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

E-Print Network [OSTI]

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

2008-05-24T23:59:59.000Z

202

Architecture independent parallel binomial tree option price valuations  

E-Print Network [OSTI]

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

Gerbessiotis, Alexandros V.

203

Comparing the Parix and PVM parallel programming environments  

E-Print Network [OSTI]

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

Amsterdam, Universiteit van

204

A Generalisation of Indexing for Parallel Document Search  

E-Print Network [OSTI]

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

Graham, Nick

205

A Generalisation of Indexing for Parallel Document Search  

E-Print Network [OSTI]

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

Graham, Nick

206

Making Nested Parallel Transactions Practical using Lightweight Hardware Support  

E-Print Network [OSTI]

Making Nested Parallel Transactions Practical using Lightweight Hardware Support Woongki Baek possible performance, TM must support the nested parallelism available in real-world applications and sup- ported by popular programming models. A few recent papers have proposed support for nested parallelism

Kozyrakis, Christos

207

Equivalency-processing parallel photonic integrated circuit EP3  

E-Print Network [OSTI]

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

Louri, Ahmed

208

Mono inverter Multi parallel PMSM -Structure and Control strategy  

E-Print Network [OSTI]

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

Boyer, Edmond

209

PARALLEL COMPUTING 2013 (ParCo2013) 10 13 September 2013  

E-Print Network [OSTI]

Energy Efficiency. The parallel computing aspects should be emphasized. Section 2: Software parallel code #12;2 Testing and debugging techniques and tools Best practices of parallel computing

Cengarle, María Victoria

210

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS, VOL. 41, NO. 4, JULY/AUGUST 2005 1099 Dynamic Simulation and Analysis of Parallel  

E-Print Network [OSTI]

. , Load resistance and load inductance. Wind turbine power. Air density. Wind speed. Propeller radius) operating in parallel and supplying a common load is proposed. Wind turbines with SEIGs are increasingly to a two-wind turbine case, which can be extended to simulate a complete wind generating system. Index

Simões, Marcelo Godoy

211

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

E-Print Network [OSTI]

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 problems is known...

Jeraputra, Chuttchaval

2006-04-12T23:59:59.000Z

212

Issues in Parallel Branch and Price  

E-Print Network [OSTI]

Branch and price is the technique of combining column generation methods with branch ... price has been shown to be very e ective at solving large, specially...

213

Adiabatic theorems for generators of contracting evolutions  

E-Print Network [OSTI]

We develop an adiabatic theory for generators of contracting evolution on Banach spaces. This provides a uniform framework for a host of adiabatic theorems ranging from unitary quantum evolutions through quantum evolutions of open systems generated by Lindbladians all the way to classically driven stochastic systems. In all these cases the adiabatic evolution approximates, to lowest order, the natural notion of parallel transport in the manifold of instantaneous stationary states. The dynamics in the manifold of instantaneous stationary states and transversal to it have distinct characteristics: The former is irreversible and the latter is transient in a sense that we explain. Both the gapped and gapless cases are considered. Some applications are discussed.

J. E. Avron; M. Fraas; G. M. Graf; P. Grech

2012-06-04T23:59:59.000Z

214

Thermoelectric generator  

SciTech Connect (OSTI)

A thermoelectric generator unit is described comprising: a hot side heat exchanger including a plate having extruded retention posts projecting from one surface of the plate, and fins adapted for contact with a heating source. The fins are positioned between two of the retention posts. Retention rods are inserted between the retention posts and the base of the fins to retain the fin in thermal contact with the plate surface upon insertion of the retention rod between the engaging surface of the post and the corresponding fin. Thermoelectric semi-conductor modules are in thermal contact with the opposite side of the hot side heat exchanger plate from the contact with the fins. The modules are arranged in a grid pattern so that heat flow is directed into each of the modules from the hot side heat exchanger. The modules are connected electrically so as to combine their electrical output; and a cold side heat exchanger is in thermal contact with the modules acting as a heat sink on the opposite side of the module from the hot side heat exchanger plate so as to produce a thermal gradient across the modules.

Shakun, W.; Bearden, J.H.; Henderson, D.R.

1988-03-29T23:59:59.000Z

215

Parallelizing AT with MatlabMPI  

SciTech Connect (OSTI)

The Accelerator Toolbox (AT) is a high-level collection of tools and scripts specifically oriented toward solving problems dealing with computational accelerator physics. It is integrated into the MATLAB environment, which provides an accessible, intuitive interface for accelerator physicists, allowing researchers to focus the majority of their efforts on simulations and calculations, rather than programming and debugging difficulties. Efforts toward parallelization of AT have been put in place to upgrade its performance to modern standards of computing. We utilized the packages MatlabMPI and pMatlab, which were developed by MIT Lincoln Laboratory, to set up a message-passing environment that could be called within MATLAB, which set up the necessary pre-requisites for multithread processing capabilities. On local quad-core CPUs, we were able to demonstrate processor efficiencies of roughly 95% and speed increases of nearly 380%. By exploiting the efficacy of modern-day parallel computing, we were able to demonstrate incredibly efficient speed increments per processor in AT's beam-tracking functions. Extrapolating from prediction, we can expect to reduce week-long computation runtimes to less than 15 minutes. This is a huge performance improvement and has enormous implications for the future computing power of the accelerator physics group at SSRL. However, one of the downfalls of parringpass is its current lack of transparency; the pMatlab and MatlabMPI packages must first be well-understood by the user before the system can be configured to run the scripts. In addition, the instantiation of argument parameters requires internal modification of the source code. Thus, parringpass, cannot be directly run from the MATLAB command line, which detracts from its flexibility and user-friendliness. Future work in AT's parallelization will focus on development of external functions and scripts that can be called from within MATLAB and configured on multiple nodes, while expending minimal communication overhead with the integrated MATLAB library.

Li, Evan Y.; /Brown U. /SLAC

2011-06-22T23:59:59.000Z

216

Carbothermic reduction with parallel heat sources  

DOE Patents [OSTI]

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.

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

1984-12-04T23:59:59.000Z

217

Parallel heater system for subsurface formations  

DOE Patents [OSTI]

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.

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

2011-10-25T23:59:59.000Z

218

Partitioning sparse rectangular matrices for parallel processing  

SciTech Connect (OSTI)

The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.

Kolda, T.G.

1998-05-01T23:59:59.000Z

219

Parallel State Estimation Assessment with Practical Data  

SciTech Connect (OSTI)

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.

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

2014-10-31T23:59:59.000Z

220

Optimize Parallel Pumping Systems | Department of Energy  

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

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: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home Page on Delicious Rank EERE:Year in3.pdfEnergyDepartment ofOil's Impact on Our National- 2013EnergyOptimize Parallel

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

PISTON (Portable Data Parallel Visualization and Analysis)  

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmosphericNuclear Security Administration the1 - September 2006 The 2002OpticsPeriodical:RockyPISTON (Portable Data Parallel

222

Parallel Volume-Rendering Algorithm Performance on Mesh-Connected Multicomputers  

E-Print Network [OSTI]

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

Shahabi, Cyrus

223

Switch for serial or parallel communication networks  

DOE Patents [OSTI]

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.

Crosette, D.B.

1994-07-19T23:59:59.000Z

224

E-Print Network 3.0 - asynchronous parallel iterative Sample...  

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

computations for image analysis... .Y., Parallel asynchronous watershed algorithm-architecture. IEEE Transactions on Parallel and Distributed... ., An asynchronous cellular...

225

Introduction Minimal generation  

E-Print Network [OSTI]

Introduction Minimal generation Random generation Minimal and probabilistic generation of finite generation of finite groups #12;Introduction Minimal generation Random generation Some motivation Let x1 random elements of G = x1, . . . , xk . (G is the group generated by x1, . . . , xk : all possible

St Andrews, University of

226

Coiled transmission line pulse generators  

DOE Patents [OSTI]

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.

McDonald, Kenneth Fox (Columbia, MO)

2010-11-09T23:59:59.000Z

227

Sub-Second Parallel State Estimation  

SciTech Connect (OSTI)

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.

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

2014-10-31T23:59:59.000Z

228

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

SciTech Connect (OSTI)

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.

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

229

Analysis and selection of optimal function implementations in massively parallel computer  

DOE Patents [OSTI]

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.

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

2011-05-31T23:59:59.000Z

230

Application of a parallel DSMC method to hypersonic rarefied flows  

SciTech Connect (OSTI)

This paper describes a method for doing direct simulation Monte Carlo (DSMC) calculations using parallel processing and presents some results of applying the method to several hypersonic, rarefied flow problems. The performance and efficiency of the parallel method are discussed. The applications described are the flow in a channel and the flow about a flat plate at incidence. The results show significant advantages of parallel processing over conventional scalar processing and demonstrate the scalability of the method to large problems. 8 refs.

Wilmoth, R.G. (NASA, Langley Research Center, Hampton, VA (USA))

1991-01-01T23:59:59.000Z

231

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

SciTech Connect (OSTI)

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.

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

232

COMPUTER GENERATION OF TYPE CURVES SUBMITIED TO THE DEPARTMENTOF PETROLEUMENGINEERING  

E-Print Network [OSTI]

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

Stanford University

233

Link failure detection in a parallel computer  

DOE Patents [OSTI]

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.

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

234

Broadcasting a message in a parallel computer  

DOE Patents [OSTI]

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.

Archer, Charles J; Faraj, Daniel A

2014-11-18T23:59:59.000Z

235

Parallel detecting, spectroscopic ellipsometers/polarimeters  

DOE Patents [OSTI]

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.

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

2002-01-01T23:59:59.000Z

236

Clock Agreement Among Parallel Supercomputer Nodes  

SciTech Connect (OSTI)

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.

Jones, Terry R.; Koenig, Gregory A.

2014-04-30T23:59:59.000Z

237

Clock Agreement Among Parallel Supercomputer Nodes  

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

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.

Jones, Terry R.; Koenig, Gregory A.

238

The WFPC2 Archival Parallels Project  

E-Print Network [OSTI]

We describe the methods and procedures developed to obtain a near-automatic combination of WFPC2 images obtained as part of the WFPC2 Archival Pure Parallels program. Several techniques have been developed or refined to ensure proper alignment, registration, and combination of overlapping images that can be obtained at different times and with different orientations. We quantify the success rate and the accuracy of the registration of images of different types, and we develop techniques suitable to equalize the sky background without unduly affecting extended emission. About 600 combined images of the 1,500 eventually planned have already been publicly released through the STScI Archive. The images released to date are especially suited to study star formation in the Magellanic Clouds, the stellar population in the halo of nearby galaxies, and the properties of star-forming galaxies at $ z \\sim 3 $.

Yogesh Wadadekar; Stefano Casertano; Richard Hook; Bl ent K?z?ltan; Anton Koekemoer; Harry Ferguson; Doichin Denchev

2005-11-08T23:59:59.000Z

239

Optimized data communications in a parallel computer  

DOE Patents [OSTI]

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.

Faraj, Daniel A.

2014-08-19T23:59:59.000Z

240

Broadcasting a message in a parallel computer  

DOE Patents [OSTI]

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.

Archer, Charles J; Faraj, Ahmad A

2013-04-16T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Optimized data communications in a parallel computer  

DOE Patents [OSTI]

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.

Faraj, Daniel A

2014-10-21T23:59:59.000Z

242

Internode data communications in a parallel computer  

DOE Patents [OSTI]

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.

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

2013-09-03T23:59:59.000Z

243

Intranode data communications in a parallel computer  

DOE Patents [OSTI]

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.

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

2014-01-07T23:59:59.000Z

244

Intranode data communications in a parallel computer  

DOE Patents [OSTI]

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.

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

2013-07-23T23:59:59.000Z

245

Internode data communications in a parallel computer  

DOE Patents [OSTI]

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.

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

2014-02-11T23:59:59.000Z

246

Parallel multiscale simulations of a brain aneurysm  

SciTech Connect (OSTI)

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.

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

247

An Exact Extended Formulation for the Unrelated Parallel Machine ...  

E-Print Network [OSTI]

Aug 28, 2014 ... Abstract: The plethora of research on NP-hard parallel machine scheduling problems is focused on heuristics due to the theoretically and...

Kerem Bulbul

2014-08-28T23:59:59.000Z

248

Parallel machine match-up scheduling with manufacturing cost considerations  

E-Print Network [OSTI]

approach for the single machine scheduling problem. Journaldecisions on parallel CNC machines: -constraint approach.mechanism for the CNC machine scheduling problems with

Aktrk, M. Selim; Atamtrk, Alper; Grel, Sinan

2010-01-01T23:59:59.000Z

249

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

E-Print Network [OSTI]

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

G raldine Heilporn

2009-01-05T23:59:59.000Z

250

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...

251

Hybrid MPI/OpenMP parallel support vector machine training  

E-Print Network [OSTI]

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

Kristian Woodsend

2009-01-12T23:59:59.000Z

252

A Parallel Line Search Subspace Correction Method for Composite ...  

E-Print Network [OSTI]

Oct 7, 2014 ... Abstract: In this paper, we investigate a parallel subspace correction framework for composite convex optimization. The variables are first...

Qian Dong

2014-10-07T23:59:59.000Z

253

Massively Parallel Indirect Dielectrophoresis Controlled Placement of Carbon Nanotubes.  

E-Print Network [OSTI]

??Placement of single walled carbon nanotubes is demonstrated through massively parallel indirect dielectrophoresis (MPID). MPID is shown to be able to control the placement of (more)

Conley, Hiram Jacob

2009-01-01T23:59:59.000Z

254

Massively parallel DNA sequencing: the new frontier in biogeography  

E-Print Network [OSTI]

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

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

2013-01-01T23:59:59.000Z

255

Parallel Large-Neighborhood Search Techniques for LNG Inventory ...  

E-Print Network [OSTI]

Apr 17, 2014 ... Parallel Large-Neighborhood Search Techniques for LNG Inventory Routing. Badrinarayanan Velamur Asokan(badri.velamur.asokan ***at***...

Badrinarayanan Velamur Asokan

2014-04-17T23:59:59.000Z

256

Hybrid Parallelism for Volume Rendering at Large Scale at NERSC  

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

Volume Rendering at Large Scale Hybrid Parallelism for Volume Rendering at Large Scale volrend-swes.png We studied the performance and scalability characteristics of hybrid''...

257

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...

258

Exponential neighborhood search for a parallel machine scheduling ...  

E-Print Network [OSTI]

Sun and Wang [26] consider the identical parallel machine problem with a large ...... be found in the OR-Library which is a collection of instances for operations...

2006-08-09T23:59:59.000Z

259

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

DOE Patents [OSTI]

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.

Faraj, Daniel A

2013-07-16T23:59:59.000Z

260

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

DOE Patents [OSTI]

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.

Davis, Kristan D; Faraj, Daniel A

2013-07-09T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

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

DOE Patents [OSTI]

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.

Blocksome, Michael A; Mamidala, Amith R

2014-02-11T23:59:59.000Z

262

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

DOE Patents [OSTI]

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.

Davis, Kristan D.; Faraj, Daniel A.

2014-07-22T23:59:59.000Z

263

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

DOE Patents [OSTI]

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.

Blocksome, Michael A.; Mamidala, Amith R.

2013-09-03T23:59:59.000Z

264

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

DOE Patents [OSTI]

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.

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

2014-09-16T23:59:59.000Z

265

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

DOE Patents [OSTI]

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.

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

2014-09-02T23:59:59.000Z

266

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

DOE Patents [OSTI]

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.

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

2014-11-18T23:59:59.000Z

267

Understanding and Managing Generation Y  

E-Print Network [OSTI]

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...

Wallace, Kevin

2007-12-14T23:59:59.000Z

268

Programming for Locality and Parallelism with Hierarchically Tiled ArraysJuly 13, 2003 1 Programming for Locality and Parallelism with  

E-Print Network [OSTI]

- guages, Co-Array Fortran [NuRe98] and Unified Parallel C (UPC) [CDCY99]. Our pro- posal follows these two

Padua, David

269

Current parallel I/O limitations to scalable data analysis.  

SciTech Connect (OSTI)

This report describes the limitations to parallel scalability which we have encountered when applying our otherwise optimally scalable parallel statistical analysis tool kit to large data sets distributed across the parallel file system of the current premier DOE computational facility. This report describes our study to evaluate the effect of parallel I/O on the overall scalability of a parallel data analysis pipeline using our scalable parallel statistics tool kit [PTBM11]. In this goal, we tested it using the Jaguar-pf DOE/ORNL peta-scale platform on a large combustion simulation data under a variety of process counts and domain decompositions scenarios. In this report we have recalled the foundations of the parallel statistical analysis tool kit which we have designed and implemented, with the specific double intent of reproducing typical data analysis workflows, and achieving optimal design for scalable parallel implementations. We have briefly reviewed those earlier results and publications which allow us to conclude that we have achieved both goals. However, in this report we have further established that, when used in conjuction with a state-of-the-art parallel I/O system, as can be found on the premier DOE peta-scale platform, the scaling properties of the overall analysis pipeline comprising parallel data access routines degrade rapidly. This finding is problematic and must be addressed if peta-scale data analysis is to be made scalable, or even possible. In order to attempt to address these parallel I/O limitations, we will investigate the use the Adaptable IO System (ADIOS) [LZL+10] to improve I/O performance, while maintaining flexibility for a variety of IO options, such MPI IO, POSIX IO. This system is developed at ORNL and other collaborating institutions, and is being tested extensively on Jaguar-pf. Simulation code being developed on these systems will also use ADIOS to output the data thereby making it easier for other systems, such as ours, to process that data.

Mascarenhas, Ajith Arthur; Pebay, Philippe Pierre

2011-07-01T23:59:59.000Z

270

Parallel In Situ Indexing for Data-intensive Computing  

SciTech Connect (OSTI)

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.

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

2011-09-09T23:59:59.000Z

271

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

E-Print Network [OSTI]

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

Sun, Xian-He

272

Parallel, staged opening switch power conditioning techniques for flux compression generator applications  

SciTech Connect (OSTI)

The Air Force Weapons Laboratory, working jointly with Los Alamos National Laboratory, has conducted a series of experiments directed at exploring composite, or staged, switching techniques for use in opening switches in applications which require the conduction of very high currents (or current densities) with very low losses for relatively long times (several tens of microseconds), and the interruption of these currents in much shorter times (ultimately a few hundred nanoseconds). This paper reports the results of those experiments.

Reinovsky, R.E.; Levi, P.S.; Bueck, J.C.; Goforth, J.H.

1985-01-01T23:59:59.000Z

273

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

E-Print Network [OSTI]

combustion engine in the HEV, and uses the electrical drive to compensate for the power gap between the load demand and the engine capacity. Unfortunately, the low power density and the high cost of the combined electric motor drive and battery packs dictate...

Lai, Lin

2013-01-28T23:59:59.000Z

274

Eighth SIAM conference on parallel processing for scientific computing: Final program and abstracts  

SciTech Connect (OSTI)

This SIAM conference is the premier forum for developments in parallel numerical algorithms, a field that has seen very lively and fruitful developments over the past decade, and whose health is still robust. Themes for this conference were: combinatorial optimization; data-parallel languages; large-scale parallel applications; message-passing; molecular modeling; parallel I/O; parallel libraries; parallel software tools; parallel compilers; particle simulations; problem-solving environments; and sparse matrix computations.

NONE

1997-12-31T23:59:59.000Z

275

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

DOE Patents [OSTI]

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.

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

2014-11-18T23:59:59.000Z

276

Particle Transport in Parallel-Plate Reactors  

SciTech Connect (OSTI)

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.

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

1999-08-01T23:59:59.000Z

277

Comparison Between Synchronous and Asynchronous Implementation of Parallel Genetic Programming  

E-Print Network [OSTI]

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

Fernandez, Thomas

278

Parallel MATLAB: Doing it Right Ron Choy , Alan Edelman  

E-Print Network [OSTI]

1 Parallel MATLAB: Doing it Right Ron Choy , Alan Edelman Computer Science AI Laboratory-MIT Alliance November 15, 2003 DRAFT #12;2 Abstract MATLAB [20] is one of the most widely used mathematical Moler of Mathworks argued that there was no market at the time for a parallel MATLAB [26]. But times

Edelman, Alan

279

Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers  

E-Print Network [OSTI]

Parallel Adaptive Mesh Refinement and Redistribution on Distributed Memory Computers C. ¨ Ozturan Polytechnic Institute Troy, NY 12181 Abstract A procedure to support parallel refinement and redistribution the required adjacency information. Mesh refinement is done by employing links back to the geometric

Bystroff, Chris

280

Spatial Computing as Intensional Data Parallelism Antoine Spicher, Olivier Michel  

E-Print Network [OSTI]

Spatial Computing as Intensional Data Parallelism Antoine Spicher, Olivier Michel LACL Universit to illustrate this statement. Keywords-spatial computing, collection, data-fields, data flow, declarative definition, intensionnal programming, stream, data parallelism I. SPATIAL COMPUTING It is customary to make

Paris-Sud XI, Université de

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

On the Interplay of Parallelization, Program Performance, and Energy Consumption  

E-Print Network [OSTI]

to either minimize the total energy consumption or minimize the energy-delay product. The impact of staticOn the Interplay of Parallelization, Program Performance, and Energy Consumption Sangyeun Cho through parallel execution of applications, suppressing the power and energy consumption remains an even

Marchal, Loris

282

APPLAUSE: Applications Using the ElipSys Parallel CLP System  

E-Print Network [OSTI]

of Parallel Programming Us- ing Logic) Project is building major applications using the ElipSys par- allel, possibly massive, search spaces can be explored in parallel. 5 Environmental Monitoring and Control: Sys concerned with the monitoring and control of pollution in the Venice Lagoon as a demonstrator for the Venice

Panagiotis, Stamatopoulos

283

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

E-Print Network [OSTI]

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

Wolfe, Patrick J.

284

Application of Parallel Imaging to Murine Magnetic Resonance Imaging  

E-Print Network [OSTI]

. 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...

Chang, Chieh-Wei 1980-

2012-09-21T23:59:59.000Z

285

Exploiting parallelism within multidimensional multirate digital signal processing systems  

E-Print Network [OSTI]

. . . . . . . . . . . 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...

Peng, Dongming

2004-09-30T23:59:59.000Z

286

A Methodology for the Derivation of Parallel Programs  

E-Print Network [OSTI]

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

Goodman, Joy

287

Parallel Imaging and Acceleration in the Johnson Noise Dominated Regime  

E-Print Network [OSTI]

Parallel Imaging and Acceleration in the Johnson Noise Dominated Regime Cristen D. LaPierre1 receive coil in the parallel array. At low field, uncorrelated Johnson noise dominates, providing in the Johnson noise dominated regime. With the eight channel array, SENSE acceleration can be implemented

Rosen, Matthew S

288

Parallel Picoliter RT-PCR Assays Using Microfluidics  

E-Print Network [OSTI]

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

Quake, Stephen R.

289

Analyzing Parallelism and Domain Similarities in the MAREC Patent Corpus  

E-Print Network [OSTI]

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

Riezler, Stefan

290

Parallel Formulations of Tree-Projection-Based Sequence Mining Algorithm  

E-Print Network [OSTI]

, 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

Karypis, George

291

NDetermin: Inferring Nondeterministic Sequential Specifications for Parallelism Correctness  

E-Print Network [OSTI]

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

Necula, George

292

Parallel Finite Element Simulation of Tracer Injection in Oil Reservoirs  

E-Print Network [OSTI]

Parallel Finite Element Simulation of Tracer Injection in Oil Reservoirs Alvaro L.G.A. Coutinho In this work, parallel finite element techniques for the simulation of tracer injection in oil reservoirs. Supercomputers have made it possible to consider global reservoir effects which can not be represented using

Coutinho, Alvaro L. G. A.

293

Parallel Processing Letters fc World Scientific Publishing Company  

E-Print Network [OSTI]

that occurred on a production site of EGEE and the troubleshooting process for each case. Finally, we proposeParallel Processing Letters fc World Scientific Publishing Company FAILURE MANAGEMENT IN GRIDS infrastructure [1] in the context #12;Parallel Processing Letters of a drug-design effort [12], indicate

Pallis, George

294

Parallel architecture for real-time simulation. Master's thesis  

SciTech Connect (OSTI)

This thesis is concerned with the development of a very fast and highly efficient parallel computer architecture for real-time simulation of continuous systems. Currently, several parallel processing systems exist that may be capable of executing a complex simulation in real-time. These systems are examined and the pros and cons of each system discussed. The thesis then introduced a custom-designed parallel architecture based upon The University of Alabama's OPERA architecture. Each component of this system is discussed and rationale presented for its selection. The problem selected, real-time simulation of the Space Shuttle Main Engine for the test and evaluation of the proposed architecture, is explored, identifying the areas where parallelism can be exploited and parallel processing applied. Results from the test and evaluation phase are presented and compared with the results of the same problem that has been processed on a uniprocessor system.

Cockrell, C.D.

1989-01-01T23:59:59.000Z

295

Transparent runtime parallelization of the R scripting language  

SciTech Connect (OSTI)

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.

Yoginath, Srikanth B [ORNL

2011-01-01T23:59:59.000Z

296

Does Anti-Parallel Spin Always Contain more Information ?  

E-Print Network [OSTI]

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)).

Sibasish Ghosh; Anirban Roy; Ujjwal Sen

2000-05-09T23:59:59.000Z

297

Broadcasting collective operation contributions throughout a parallel computer  

DOE Patents [OSTI]

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.

Faraj, Ahmad (Rochester, MN)

2012-02-21T23:59:59.000Z

298

Parallel Astronomical Data Processing with Python: Recipes for multicore machines  

E-Print Network [OSTI]

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...

Singh, Navtej; Butler, Ray

2013-01-01T23:59:59.000Z

299

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...

300

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

E-Print Network [OSTI]

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

Bezryadina, Anna Sergeyevna

2012-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

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

E-Print Network [OSTI]

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

Logue, J.M.

2012-01-01T23:59:59.000Z

302

CX-011741: Categorical Exclusion Determination | Department of...  

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

research and development activities for the demonstration of a 1 kilowatt-hour nanotechnology-based high-energy-density liquid energy storage media and corresponding flow...

303

ARPA-E 2011 Keynote: Dr. Arun Majumdar | Department of Energy  

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

- gigawatt (power ?) - (inaudible) - storage. The way we do that today is by pumped hydro, using the dam in reverse. And that's about a hundred dollars a kilowatt hour,...

304

Symmetry related dynamics in parallel shear flows  

E-Print Network [OSTI]

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.

Tobias Kreilos; Stefan Zammert; Bruno Eckhardt

2014-04-23T23:59:59.000Z

305

Generation gaps in engineering?  

E-Print Network [OSTI]

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. ...

Kim, David J. (David Jinwoo)

2008-01-01T23:59:59.000Z

306

CONSULTANT REPORT DISTRIBUTED GENERATION  

E-Print Network [OSTI]

CONSULTANT REPORT DISTRIBUTED GENERATION INTEGRATION COST STUDY Analytical Framework energy development, or distributed generation, in California. In May 2012, Southern California Edison Southern California Edison's approach to evaluating distributed generation impacts, and to conduct

307

Hydrogen and electricity: Parallels, interactions,and convergence  

E-Print Network [OSTI]

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

Yang, Christopher

2008-01-01T23:59:59.000Z

308

Automatic Thread Distribution For Nested Parallelism In OpenMP OpenMP is becoming the standard programming model for sharedmemory parallel architectures. One of its most inter-  

E-Print Network [OSTI]

Automatic Thread Distribution For Nested Parallelism In OpenMP Abstract OpenMP is becoming in the language is the support for nested parallelism. Previous research and parallelization experiences have shown the benefits of using nested parallelism as an alternative to combining several programming models

Corbalan, Julita

309

AutoAuto--tuned nested parallelism: a way totuned nested parallelism: a way to reduce the execution time of scientificreduce the execution time of scientific  

E-Print Network [OSTI]

AutoAuto--tuned nested parallelism: a way totuned nested parallelism: a way to reduce the execution problems AutoAuto--tuned nested parallelism: a way to reduce the execution time of scientific software in NUMA systemstuned nested parallelism: a way to reduce the execution time of scientific software in NUMA

Giménez, Domingo

310

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...

311

Next Generation Reactors  

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

Nuclear Advances We are coordinating the Generation IV Nuclear Systems Initiative - an international effort to develop the next generation of nuclear power reactors. Skip...

312

Concentrated Solar Power Generation.  

E-Print Network [OSTI]

??Solar power generation is the most promising technology to transfer energy consumption reliance from fossil fuel to renewable sources. Concentrated solar power generation is a (more)

Jin, Zhilei

2013-01-01T23:59:59.000Z

313

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

SciTech Connect (OSTI)

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.

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

314

Tile-based Level of Detail for the Parallel Age  

SciTech Connect (OSTI)

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.

Niski, K; Cohen, J D

2007-08-15T23:59:59.000Z

315

TECA: A Parallel Toolkit for Extreme Climate Analysis  

SciTech Connect (OSTI)

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.

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

2012-03-12T23:59:59.000Z

316

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

DOE Patents [OSTI]

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.

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

2014-11-11T23:59:59.000Z

317

Thread Scheduling Mechanisms for Multiple-Context Parallel Processors  

E-Print Network [OSTI]

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 ...

Fiske, James A. Stuart

1995-06-01T23:59:59.000Z

318

Distinguishable patterns of competition, collusion, and parallel action  

E-Print Network [OSTI]

Alternative market structures are distinguishable by the degree of parallel action exhibited by producers. We show that the correlation between output levels varies systematically with the degree of interdependence among ...

Smith, James L.

2003-01-01T23:59:59.000Z

319

Design and evaluation of the Hamal parallel computer  

E-Print Network [OSTI]

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 ...

Grossman, J. P., 1973-

2003-01-01T23:59:59.000Z

320

Circuit and bond polytopes on series-parallel graphs$  

E-Print Network [OSTI]

Jul 10, 2014 ... M0 = IS, for some star decomposition S of G, and Mi?Ni is a cut of G, for i = 1,..., k. 2. Circuit polytope on series-parallel graphs. Given a graph G...

2014-07-10T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Design and Evaluation of the Hamal Parallel Computer  

E-Print Network [OSTI]

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 ...

Grossman, J.P.

2002-12-05T23:59:59.000Z

322

Control system design for a parallel hybrid electric vehicle  

E-Print Network [OSTI]

This thesis addresses the design of control systems for a parallel hybrid electric drive train which is an alternative to conventional passenger vehicles. The principle components of the drive train are a small internal combustion engine...

Buntin, David Leighton

1994-01-01T23:59:59.000Z

323

Optimized control studies of a parallel hybrid electric vehicle  

E-Print Network [OSTI]

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...

Bougler, Benedicte Bernadette

1995-01-01T23:59:59.000Z

324

RF Pulse Design for Parallel Excitation in Magnetic Resonance Imaging  

E-Print Network [OSTI]

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...

Liu, Yinan

2012-07-16T23:59:59.000Z

325

Implementation and testing of a parallel layer peeling algorithm  

E-Print Network [OSTI]

implementation was considered because of the anticipated speedup in the solution of the problem under consideration. The algorithm was implemented on an NCUBE 2 machine, with a total of sixty-four processors. Two variations of the parallel algorithm were...

Gandapur, Tasneem Kausar

2012-06-07T23:59:59.000Z

326

Design and implementation of parallel simulation ranking and selection procedures.  

E-Print Network [OSTI]

??Conventional simulation ranking-and-selection(R&S) procedures are designed and implemented for serial computing environment. However, today's growth of computing power relies more on parallelism rather than faster (more)

Wu, Yang

2013-01-01T23:59:59.000Z

327

Natural convection flows in parallel connected vertical channels with boiling  

E-Print Network [OSTI]

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 ...

Eselgroth, Peter Ward

1967-01-01T23:59:59.000Z

328

A parallel hypothesis method of autonomous underwater vehicle navigation  

E-Print Network [OSTI]

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 ...

LaPointe, Cara Elizabeth Grupe

2009-01-01T23:59:59.000Z

329

Scheduling on the MasPar SIMD parallel computer  

E-Print Network [OSTI]

This thesis studies the feasibility of a task scheduler for a parallel operating system. After analyzing several task scheduling algorithms, the highest level first algorithm was chosen. This algorithm has been empirically found to build schedules...

Perkins, Keith Douglas

1995-01-01T23:59:59.000Z

330

Some applications of pipelining techniques in parallel scientific computing  

E-Print Network [OSTI]

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...

Deng, Yuanhua

1996-01-01T23:59:59.000Z

331

Large-Scale Molecular Dynamics Simulations for Highly Parallel Infrastructures  

E-Print Network [OSTI]

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...

Pazrikov, Jana

2014-01-01T23:59:59.000Z

332

Parallel-Flow-Shear Driven Low-Frequency Plasma Instability  

SciTech Connect (OSTI)

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.

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

333

Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks  

E-Print Network [OSTI]

Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks Enyue Lu for the RNB networks of complexities ranging from OðN lg N? to OðN1:5 lg N? crosspoints and parallel algorithms that run in Oðminfd? lg N; ffiffiffiffiffi N p g? time for the SNB networks of OðN1:5 lg N?

Lu, Enyue "Annie"

334

final report for Center for Programming Models for Scalable Parallel Computing  

SciTech Connect (OSTI)

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

Johnson, Ralph E

2013-04-10T23:59:59.000Z

335

Embracing diversity : improving performance for parallel storage systems built with heterogeneous disks  

E-Print Network [OSTI]

Figure I.2: Parallel Storage System Architecture FigureHeterogeneous Parallel Storage Systems . . . . . B. Modeldisks on a multimedia storage system with random data

Bruno, Gregory DuVall

2008-01-01T23:59:59.000Z

336

E-Print Network 3.0 - accelerated scalable parallel Sample Search...  

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

and excellent suitability for parallel... to control the commodity graphics accelerators and to perform oper- ations associated with a parallel... A Scalable and...

337

ENERGY GENERATION RESEARCH PIER Energy Generation Research  

E-Print Network [OSTI]

ENERGY GENERATION RESEARCH PIER Energy Generation Research www.energy.ca.gov/research/ renewable/ November 2010 Sonoma County RESCO A Local Level Approach to Renewable Energy Portfolios. The Issue To address energy usage that contributes to climate change, California has enacted legislation to guide

338

Gamma ray generator  

DOE Patents [OSTI]

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.

Firestone, Richard B; Reijonen, Jani

2014-05-27T23:59:59.000Z

339

Generation to Generation: The Heart of Family Medicine  

E-Print Network [OSTI]

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

Winter, Robin O

2012-01-01T23:59:59.000Z

340

Instruction sets for Parallel Random Access Machines. Doctoral thesis  

SciTech Connect (OSTI)

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.

Trahan, J.L.

1988-08-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Allinea DDT as a Parallel Debugging Alternative to Totalview  

SciTech Connect (OSTI)

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.

Antypas, K.B.

2007-03-05T23:59:59.000Z

342

Parallel object-oriented data mining system  

DOE Patents [OSTI]

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.

Kamath, Chandrika; Cantu-Paz, Erick

2004-01-06T23:59:59.000Z

343

GIS Applications in MeteorologyGIS Applications in Meteorology Adventures in a Parallel UniverseAdventures in a Parallel Universe  

E-Print Network [OSTI]

Expanding HorizonsExpanding Horizons Ted Haberman ­ What is GIS? Shipley - Parallel (GIS) Universe Olga from GIS COTS software. TheGIS COTS software. The purpose of the forum is to explore the ways in which

344

Cylindrical neutron generator  

DOE Patents [OSTI]

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.

Leung, Ka-Ngo

2005-06-14T23:59:59.000Z

345

Cylindrical neutron generator  

DOE Patents [OSTI]

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.

Leung, Ka-Ngo (Hercules, CA)

2008-04-22T23:59:59.000Z

346

Cylindrical neutron generator  

DOE Patents [OSTI]

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.

Leung, Ka-Ngo (Hercules, CA)

2009-12-29T23:59:59.000Z

347

New wave generation  

E-Print Network [OSTI]

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 ...

Mercier, Matthieu J.

348

Parallel Breadth-First Search on Distributed Memory Systems  

SciTech Connect (OSTI)

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.

Computational Research Division; Buluc, Aydin; Madduri, Kamesh

2011-04-15T23:59:59.000Z

349

Distance-Two Interpolation for Parallel Algebraic Multigrid  

SciTech Connect (OSTI)

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.

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

2007-05-08T23:59:59.000Z

350

Parallel heat transport in integrable and chaotic magnetic fields  

SciTech Connect (OSTI)

The study of transport in magnetized plasmas is a problem of fundamental interest in controlled fusion, space plasmas, and astrophysics research. Three issues make this problem particularly challenging: (i) The extreme anisotropy between the parallel (i.e., along the magnetic field), {chi}{sub ||} , and the perpendicular, {chi}{sub Up-Tack }, conductivities ({chi}{sub ||} /{chi}{sub Up-Tack} may exceed 10{sup 10} in fusion plasmas); (ii) Nonlocal parallel transport in the limit of small collisionality; and (iii) Magnetic field lines chaos which in general complicates (and may preclude) the construction of magnetic field line coordinates. Motivated by these issues, we present a Lagrangian Green's function method to solve the local and non-local parallel transport equation applicable to integrable and chaotic magnetic fields in arbitrary geometry. The method avoids by construction the numerical pollution issues of grid-based algorithms. The potential of the approach is demonstrated with nontrivial applications to integrable (magnetic island), weakly chaotic (Devil's staircase), and fully chaotic magnetic field configurations. For the latter, numerical solutions of the parallel heat transport equation show that the effective radial transport, with local and non-local parallel closures, is non-diffusive, thus casting doubts on the applicability of quasilinear diffusion descriptions. General conditions for the existence of non-diffusive, multivalued flux-gradient relations in the temperature evolution are derived.

Castillo-Negrete, D. del; Chacon, L. [Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831-8071 (United States)

2012-05-15T23:59:59.000Z

351

Parallel MATLAB at VT Gene Cliff (AOE/ICAM -ecliff@vt.edu )  

E-Print Network [OSTI]

Parallel MATLAB at VT Gene Cliff (AOE/ICAM - ecliff@vt.edu ) Justin Krometis (ARC/ICAM - jkrometis Mathematics 1 / 35 #12;MATLAB Parallel Computing Introduction Programming Models Execution Example: Quadrature Conclusion 2 / 35 #12;INTRO: Parallel MATLAB Parallel MATLAB is an extension of MATLAB that takes advantage

Crawford, T. Daniel

352

Fasteners -- Preloading test for the detection of hydrogen embrittlement -- Parallel bearing surface method  

E-Print Network [OSTI]

Fasteners -- Preloading test for the detection of hydrogen embrittlement -- Parallel bearing surface method

International Organization for Standardization. Geneva

1999-01-01T23:59:59.000Z

353

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

354

Hydrogen and electricity: Parallels, interactions,and convergence  

E-Print Network [OSTI]

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

Yang, Christopher

2008-01-01T23:59:59.000Z

355

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

E-Print Network [OSTI]

electrical system components are a generator, battery, lamps, indicators and ignition. 40 single cables Firstly electric point-to-point connections are replaced by electronic control units and the CAN-field bus. The first electronic motor management system manufactured by BOSCH sets a new benchmark. 1990 Electronic

Zachmann, Gabriel

356

Synchronous parallel kinetic Monte Carlo Diffusion in Heterogeneous Systems  

SciTech Connect (OSTI)

A new hybrid Molecular Dynamics-kinetic Monte Carlo algorithm has been developed in order to study the basic mechanisms taking place in diffusion in concentrated alloys under the action of chemical and stress fields. Parallel implementation of the k-MC part based on a recently developed synchronous algorithm [1. Compo Phys. 227 (2008) 3804-3823] resorting on the introduction of a set of null events aiming at synchronizing the time for the different subdomains, added to the parallel efficiency of MD, provides the computer power required to evaluate jump rates 'on the flight', incorporating in this way the actual driving force emerging from chemical potential gradients, and the actual environment-dependent jump rates. The time gain has been analyzed and the parallel performance reported. The algorithm is tested on simple diffusion problems to verify its accuracy.

Martinez Saez, Enrique [Los Alamos National Laboratory; Hetherly, Jeffery [Los Alamos National Laboratory; Caro, Jose A [Los Alamos National Laboratory

2010-12-06T23:59:59.000Z

357

Radiation transport on unstructured mesh with parallel computers  

SciTech Connect (OSTI)

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.

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

2000-07-01T23:59:59.000Z

358

Experiences with global optimization techniques in massively parallel processing environments  

SciTech Connect (OSTI)

The modeling of many physically relevant processes involves the location of global extrema, which are often surrounded by numerous local extrema. The effort involved in locating these extrema grows rapidly with increasing dimensionality of the problems being investigated. A method of analysis for algorithms from the perspective of a parallel processing environment is developed and applied to the family of Monte Carlo global optimization schemes. A new highly parallel Monte Carlo algorithm is presented. Chaotic iteration schemes resulting in nondeterministic algorithms are discussed, and an analysis of the optimal conditions for their application to this class of problems is presented. 11 refs., 4 figs.

Hall, J.H.; Hiromoto, R.

1988-01-01T23:59:59.000Z

359

Performance analysis of parallel supernodal sparse LU factorization  

SciTech Connect (OSTI)

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.

Grigori, Laura; Li, Xiaoye S.

2004-02-05T23:59:59.000Z

360

Local and nonlocal parallel heat transport in general magnetic fields  

SciTech Connect (OSTI)

A novel approach for the study of parallel transport in magnetized plasmas is presented. The method avoids numerical pollution issues of grid-based formulations and applies to integrable and chaotic magnetic fields with local or nonlocal parallel closures. In weakly chaotic fields, the method gives the fractal structure of the devil's staircase radial temperature profile. In fully chaotic fields, the temperature exhibits self-similar spatiotemporal evolution with a stretched-exponential scaling function for local closures and an algebraically decaying one for nonlocal closures. It is shown that, for both closures, the effective radial heat transport is incompatible with the quasilinear diffusion model.

Del-Castillo-Negrete, Diego B [ORNL; Chacon, Luis [ORNL

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Local and Nonlocal Parallel Heat Transport in General Magnetic Fields  

SciTech Connect (OSTI)

A novel approach for the study of parallel transport in magnetized plasmas is presented. The method avoids numerical pollution issues of grid-based formulations and applies to integrable and chaotic magnetic fields with local or nonlocal parallel closures. In weakly chaotic fields, the method gives the fractal structure of the devil's staircase radial temperature profile. In fully chaotic fields, the temperature exhibits self-similar spatiotemporal evolution with a stretched-exponential scaling function for local closures and an algebraically decaying one for nonlocal closures. It is shown that, for both closures, the effective radial heat transport is incompatible with the quasilinear diffusion model.

Castillo-Negrete, D. del; Chacon, L. [Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831-8071 (United States)

2011-05-13T23:59:59.000Z

362

Methods for operating parallel computing systems employing sequenced communications  

DOE Patents [OSTI]

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.

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

1999-08-10T23:59:59.000Z

363

Intelligent energy management agent for a parallel hybrid vehicle  

E-Print Network [OSTI]

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...

Won, Jong-Seob

2004-09-30T23:59:59.000Z

364

Electric power monthly, December 1996 with data for September 1996  

SciTech Connect (OSTI)

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.

NONE

1996-12-01T23:59:59.000Z

365

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

SciTech Connect (OSTI)

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.

NONE

1996-09-01T23:59:59.000Z

366

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

SciTech Connect (OSTI)

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.

NONE

1999-07-01T23:59:59.000Z

367

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

368

A massively parallel method of characteristic neutral particle transport code for GPUs  

SciTech Connect (OSTI)

Over the past 20 years, parallel computing has enabled computers to grow ever larger and more powerful while scientific applications have advanced in sophistication and resolution. This trend is being challenged, however, as the power consumption for conventional parallel computing architectures has risen to unsustainable levels and memory limitations have come to dominate compute performance. Heterogeneous computing platforms, such as Graphics Processing Units (GPUs), are an increasingly popular paradigm for solving these issues. This paper explores the applicability of GPUs for deterministic neutron transport. A 2D method of characteristics (MOC) code - OpenMOC - has been developed with solvers for both shared memory multi-core platforms as well as GPUs. The multi-threading and memory locality methodologies for the GPU solver are presented. Performance results for the 2D C5G7 benchmark demonstrate 25-35 x speedup for MOC on the GPU. The lessons learned from this case study will provide the basis for further exploration of MOC on GPUs as well as design decisions for hardware vendors exploring technologies for the next generation of machines for scientific computing. (authors)

Boyd, W. R.; Smith, K.; Forget, B. [Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 77 Massachusetts Avenue, Cambridge, MA 02139 (United States)

2013-07-01T23:59:59.000Z

369

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

E-Print Network [OSTI]

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

Hewlett, William

2013-01-01T23:59:59.000Z

370

Combined fuel and air staged power generation system  

SciTech Connect (OSTI)

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.

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

2014-05-27T23:59:59.000Z

371

Building a Parallel Cloud Storage System using OpenStacks Swift Object Store and Transformative Parallel I/O  

SciTech Connect (OSTI)

Our project consists of bleeding-edge research into replacing the traditional storage archives with a parallel, cloud-based storage solution. It used OpenStack's Swift Object Store cloud software. It's Benchmarked Swift for write speed and scalability. Our project is unique because Swift is typically used for reads and we are mostly concerned with write speeds. Cloud Storage is a viable archive solution because: (1) Container management for larger parallel archives might ease the migration workload; (2) Many tools that are written for cloud storage could be utilized for local archive; and (3) Current large cloud storage practices in industry could be utilized to manage a scalable archive solution.

Burns, Andrew J. [Los Alamos National Laboratory; Lora, Kaleb D. [Los Alamos National Laboratory; Martinez, Esteban [Los Alamos National Laboratory; Shorter, Martel L. [Los Alamos National Laboratory

2012-07-30T23:59:59.000Z

372

Steam generator support system  

DOE Patents [OSTI]

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.

Moldenhauer, J.E.

1987-08-25T23:59:59.000Z

373

Steam generator support system  

DOE Patents [OSTI]

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.

Moldenhauer, James E. (Simi Valley, CA)

1987-01-01T23:59:59.000Z

374

Method of grid generation  

DOE Patents [OSTI]

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.

Barnette, Daniel W. (Veguita, NM)

2002-01-01T23:59:59.000Z

375

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

SciTech Connect (OSTI)

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.

Mittal, Sparsh [ORNL

2014-01-01T23:59:59.000Z

376

High-Resolution, Parallel Visualization of Turbomachinery Flowelds  

E-Print Network [OSTI]

High-Resolution, Parallel Visualization of Turbomachinery Flowelds Michael G. List , Mark G Turbomachinery post- and co-processing and visualization tools are under development. The result has been in the analysis of turbomachinery. It has always been the way of the CFD analyst to expand and resolve simulations

Cincinnati, University of

377

MATLAB*G: A Grid-Based Parallel MATLAB  

E-Print Network [OSTI]

This paper describes the design and implementation of MATLAB*G, a parallel MATLAB on the ALiCE Grid. ALiCE (Adaptive and scaLable internet-based Computing Engine), developed at NUS, is a lightweight grid-computing middleware. ...

Chen, Ying

378

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs  

E-Print Network [OSTI]

shown that the algorithm scales according to the definition of scalability given following. LoadScalable Load Distribution and Load Balancing for Dynamic Parallel Programs E. Berger and J. C of an integrated load distribution-load balancing algorithm which was targeted to be both efficient and scalable

Berger, Emery

379

Schubert and Macdonald Polynomials, a parallel Alain Lascoux  

E-Print Network [OSTI]

1 #12;Schubert and Macdonald Polynomials, a parallel Alain Lascoux 'oooooo 'oooooo 'oooooo 'oooooo Schubert and (non-symmetric) Macdonald polynomials are two lin- ear bases of the ring of polynomials which, x = {x1, . . . , xn}. Schubert polynomials {Yv : v Nn } and Macdonald polynomials {Mv : v Nn

Lascoux, Alain

380

Schubert and Macdonald Polynomials, a parallel Alain Lascoux  

E-Print Network [OSTI]

Schubert and Macdonald Polynomials, a parallel Alain Lascoux 'oooooo 'oooooo 'oooooo 'oooooo Schubert and (non-symmetric) Macdonald polynomials are two lin- ear bases of the ring of polynomials which, x = {x1, . . . , xn}. Schubert polynomials {Yv : v Nn } and Macdonald polynomials {Mv : v Nn

Lascoux, Alain

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Parallel algorithms for approximation of distance maps on parametric surfaces  

E-Print Network [OSTI]

results demonstrate up to four orders of magnitude improvement in execution time compared to the state(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n charts, parallel algorithms, GPU, SIMD 1. INTRODUCTION Approximation of geodesic distances on curved

Kimmel, Ron

382

Enabling Task Level Parallelism in HandelC  

E-Print Network [OSTI]

HandelC is a programming language used to target hardware and is similar in syntax to ANSI-C. HandelC offers constructs that allow programmers to express instruction level parallelism. Also, HandelC offers primitives that allow task level...

AbuYasin, Thamer S.

2007-12-14T23:59:59.000Z

383

Time parallelization of plasma simulations using the parareal algorithm  

SciTech Connect (OSTI)

Simulation of fusion plasmas involve a broad range of timescales. In magnetically confined plasmas, such as in ITER, the timescale associated with the microturbulence responsible for transport and confinement timescales vary by an order of 10^6 10^9. Simulating this entire range of timescales is currently impossible, even on the most powerful supercomputers available. Space parallelization has so far been the most common approach to solve partial differential equations. Space parallelization alone has led to computational saturation for fluid codes, which means that the walltime for computaion does not linearly decrease with the increasing number of processors used. The application of the parareal algorithm to simulations of fusion plasmas ushers in a new avenue of parallelization, namely temporal parallelization. The algorithm has been successfully applied to plasma turbulence simulations, prior to which it has been applied to other relatively simpler problems. This work explores the extension of the applicability of the parareal algorithm to ITER relevant problems, starting with a diffusion-convection model.

Samaddar, D. [ITER Organization, Saint Paul Lez Durance, France; Houlberg, Wayne A [ORNL; Berry, Lee A [ORNL; Elwasif, Wael R [ORNL; Huysmans, G [ITER Organization, Saint Paul Lez Durance, France; Batchelor, Donald B [ORNL

2011-01-01T23:59:59.000Z

384

PARALLEL COMPUTATION OF THE BOLTZMANN TRANSPORT EQUATION FOR MICROSCALE HEAT  

E-Print Network [OSTI]

silicon ðSi? and silicon dioxide ðSiO2?. The equation of phonon radiative transport ðERPT?, in itsPARALLEL COMPUTATION OF THE BOLTZMANN TRANSPORT EQUATION FOR MICROSCALE HEAT TRANSFER fundamental Boltzmann transport equations have been reported [3, 7, 8]. This has consequently instigated a re

Miller, Richard S.

385

Models and Algorithms for Optical and Optoelectronic Parallel Computers  

E-Print Network [OSTI]

Models and Algorithms for Optical and Optoelectronic Parallel Computers Sartaj Sahni Dept/Fremantle, Australia #12;realization leads to the concept of optoelectronic computers­computers which have a mix the prespective of efficient algorithm design. The OTIS family of optoelectronic computers is a step

Sahni, Sartaj K.

386

Evaluating Memory Energy Efficiency in Parallel I/O Workloads  

E-Print Network [OSTI]

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

Zhu, Yifeng

387

How to write fast and clear parallel programs using algebra  

SciTech Connect (OSTI)

An algebraic method for the design of efficient and easy to port codes for parallel machines is described. The method was applied to speed up and to clarify certain communication functions, n-body codes, a biomolecular analysis, and a chess problem.

Stiller, L. [Los Alamos National Lab., NM (United States)]|[Johns Hopkins Univ., Baltimore, MD (United States)

1992-10-01T23:59:59.000Z

388

How to write fast and clear parallel programs using algebra  

SciTech Connect (OSTI)

An algebraic method for the design of efficient and easy to port codes for parallel machines is described. The method was applied to speed up and to clarify certain communication functions, n-body codes, a biomolecular analysis, and a chess problem.

Stiller, L. (Los Alamos National Lab., NM (United States) Johns Hopkins Univ., Baltimore, MD (United States))

1992-01-01T23:59:59.000Z

389

Detection of multiple sinusoids using a parallel ale  

SciTech Connect (OSTI)

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.

David, R.A.

1984-01-01T23:59:59.000Z

390

A Hierarchical Checkpointing Protocol for Parallel Applications in Cluster Federations  

E-Print Network [OSTI]

A Hierarchical Checkpointing Protocol for Parallel Applications in Cluster Federations S federation. As a cluster federation comprises of a large number of nodes, there is a high probability fits to the characteristics of a cluster federation (large number of nodes, high latency and low

Paris-Sud XI, Université de

391

GPU-ABiSort: Optimal Parallel Sorting on Stream Architectures  

E-Print Network [OSTI]

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

Zachmann, Gabriel

392

A General Formulation for the Stiffness Matrix of Parallel Mechanisms  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

393

A HIGHLY PARALLEL TURBO PRODUCT CODE DECODER WITHOUT INTERLEAVING RESOURCE  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

394

Simultaneous Scheduling and Control of Multiproduct Continuous Parallel Lines  

E-Print Network [OSTI]

continuous reactors is cast as a Mixed-Integer Dynamic Optimization (MIDO) problem. The reactor dynamic;Abstract In this work we propose a simultaneous scheduling and control optimization formulation to ad- dress both optimal steady-state production and dynamic product transitions in multiproduct parallel

Grossmann, Ignacio E.

395

Hardware packet pacing using a DMA in a parallel computer  

DOE Patents [OSTI]

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.

Chen, Dong; Heidelberger, Phillip; Vranas, Pavlos

2013-08-13T23:59:59.000Z

396

A MICROFLUIDIC BIOCHIP DEDICATED TO HIGHLY PARALLELIZED ELECTROFUSION  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

397

Parallel Seismic Ray Tracing in a Global Earth Model  

E-Print Network [OSTI]

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

Genaud, Stéphane

398

Parallel Belief Revision: Revising by Sets of Formulas  

E-Print Network [OSTI]

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

Delgrande, James P.

399

Parallel Belief Revision James Delgrande and Yi Jin  

E-Print Network [OSTI]

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

Delgrande, James P.

400

Parallel algorithm and hybrid regularization for dynamic PET reconstruction  

E-Print Network [OSTI]

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

Boyer, Edmond

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

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

402

Parallel Processing Letters fc World Scientific Publishing Company  

E-Print Network [OSTI]

Parallel Processing Letters fc World Scientific Publishing Company SCHEDULING ISSUES Department, University of Idaho Moscow, Idaho 83844-1010, USA and AZAD AZADMANESH Computer Science Department, University of Nebraska at Omaha Omaha, Nebraska 68182-0500, USA and MILES McQUEEN Idaho National Engineering

Krings, Axel W.

403

Efficiency Assessment of Parallel Workloads on Virtualized Resources Javier Delgado,  

E-Print Network [OSTI]

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

Sadjadi, S. Masoud

404

AUTOMATIC PARALLELIZATION OF OBJECT ORIENTED MODELS ACROSS METHOD AND  

E-Print Network [OSTI]

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

Zhao, Yuxiao

405

Application of Parallel Processing to Intelligent Control of Mobile Robots  

E-Print Network [OSTI]

to meetfuture needs. Key words: Mobile Robots, Parallel Processing, Intelligent Control, Architecture. 1 to navigate its environment, build or update maps, plan and execute actions, and adapt its behaviour to envir requires multi-processorarchitectures to bear the burden of processing loads. Such computer architectures

Hu, Huosheng

406

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

E-Print Network [OSTI]

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

Trauner, Dirk

407

Verification of Parallel Garbage Collection by Abstract Model Checking  

E-Print Network [OSTI]

have a finite state space provided that the abstraction mapping is powerful. M¨uller and Nipkow's work working on abstract model checking. In Section 4, the abstractions we defined on garbage #12; collectionVerification of Parallel Garbage Collection by Abstract Model Checking (Extended Abstract) Masami

Hagiya, Masami

408

Parallel and Adaptive Simulation of Fuel Cells Robert Klfkorn1  

E-Print Network [OSTI]

Parallel and Adaptive Simulation of Fuel Cells in 3d Robert Klöfkorn1 , Dietmar Kröner1 , Mario) fuel cells. Hereby, we focus on the simulation done in 3d us- ing modern techniques like higher order and the transport of species in the cathodic gas diffusion layer of the fuel cell. Therefore, from the detailed

Münster, Westfälische Wilhelms-Universität

409

Nested Loop Algorithm for Parallel Model Based Iterative Reconstruction  

E-Print Network [OSTI]

Nested Loop Algorithm for Parallel Model Based Iterative Reconstruction Zhou Yu, Lin Fu, Debashish. In this paper, we propose a fast converging simultaneous-update algorithm using a nested loop structure tomography, iterative reconstruction, nested loop, preconditioner. I. INTRODUCTION Recent applications

410

A Generic Grid Interface for Parallel and Adaptive Scientific Computing.  

E-Print Network [OSTI]

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

Kornhuber, Ralf

411

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

412

Parallelization of the Value-Iteration algorithm for  

E-Print Network [OSTI]

and stochastic environment. To determine the solution of a POMDP, algorithms with a running time in the PSPACE using the massive parallel processing power of modern Graphic Processing Units (GPU). Our experiments synchronization features are needed to exploit the full potential. #12;ii #12;Summary (Danish) Delvist

413

Energy-Efficient Sensing and Communication of Parallel Gaussian Sources  

E-Print Network [OSTI]

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

Erkip, Elza

414

Modelling unbounded parallel sessions of security protocols in CSP  

E-Print Network [OSTI]

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

Roscoe, Bill

415

TDDC78TDDC78 Programming of Parallel Computers  

E-Print Network [OSTI]

- 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

Kessler, Christoph

416

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

417

Energy Efficient Implementation of Parallel CMOS Multipliers with Improved Compressors  

E-Print Network [OSTI]

Energy Efficient Implementation of Parallel CMOS Multipliers with Improved Compressors Dursun Baran constraints. It is shown that Non-Booth mul- tipliers start to become more energy efficient for strict delay targets. In addition, novel 3:2 and 4:2 compressors are pre- sented to save energy at the same target

California at Davis, University of

418

Sonderforschungsbereich 393 Parallele Numerische Simulation fur Physik und Kontinuumsmechanik  

E-Print Network [OSTI]

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

Chemnitz, Technische Universität

419

Sonderforschungsbereich 393 Parallele Numerische Simulation fur Physik und Kontinuumsmechanik  

E-Print Network [OSTI]

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

Chemnitz, Technische Universität

420

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

SciTech Connect (OSTI)

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.

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

2012-04-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

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.

422

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

423

Xyce Parallel Electronic Simulator Users Guide Version 6.2.  

SciTech Connect (OSTI)

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)

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

424

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

SciTech Connect (OSTI)

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.

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

2009-06-09T23:59:59.000Z

425

Next-generation transcriptome assembly  

E-Print Network [OSTI]

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

Martin, Jeffrey A.

2012-01-01T23:59:59.000Z

426

Second generation PFB for advanced power generation  

SciTech Connect (OSTI)

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.

Robertson, A.; Van Hook, J.

1995-11-01T23:59:59.000Z

427

A NEW GENERATION CHEMICAL FLOODING SIMULATOR  

SciTech Connect (OSTI)

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.

Gary A. Pope; Kamy Sepehrnoori; Mojdeh Delshad

2005-01-01T23:59:59.000Z

428

SAMPLING-BASED ROADMAP OF TREES FOR PARALLEL MOTION PLANNING 1 Sampling-Based Roadmap of Trees for Parallel  

E-Print Network [OSTI]

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

Chen, Brian Y.

429

Laser beam generating apparatus  

DOE Patents [OSTI]

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.

Warner, B.E.; Duncan, D.B.

1993-12-28T23:59:59.000Z

430

Laser beam generating apparatus  

DOE Patents [OSTI]

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.

Warner, B.E.; Duncan, D.B.

1994-02-15T23:59:59.000Z

431

features Utility Generator  

E-Print Network [OSTI]

#12;#12;#12;#12;features function utility Training Pool Utility Generator Per-frame function content utility classes utility classes utility Tree Decision Generator Module Utility Clustering Adaptive Content Classification Loop features content VO selection & Utility Selector content features Real

Chang, Shih-Fu

432

Event generator overview  

SciTech Connect (OSTI)

Due to their ability to provide detailed and quantitative predictions, the event generators have become an important part of studying relativistic heavy ion physics and of designing future experiments. In this talk, the author will briefly summarize recent progress in developing event generators for the relativistic heavy ion collisions.

Pang, Y.

1997-12-01T23:59:59.000Z

433

Improved solid aerosol generator  

DOE Patents [OSTI]

An improved solid aerosol generator used to produce a gas borne stream of dry, solid particles of predetermined size and concentration. The improved solid aerosol generator nebulizes a feed solution of known concentration with a flow of preheated gas and dries the resultant wet heated aerosol in a grounded, conical heating chamber, achieving high recovery and flow rates. 2 figs.

Prescott, D.S.; Schober, R.K.; Beller, J.

1988-07-19T23:59:59.000Z

434

Internal split field generator  

DOE Patents [OSTI]

A generator includes a coil of conductive material. A stationary magnetic field source applies a stationary magnetic field to the coil. An internal magnetic field source is disposed within a cavity of the coil to apply a moving magnetic field to the coil. The stationary magnetic field interacts with the moving magnetic field to generate an electrical energy in the coil.

Thundat; Thomas George (Knoxville, TN); Van Neste, Charles W. (Kingston, TN); Vass, Arpad Alexander (Oak Ridge, TN)

2012-01-03T23:59:59.000Z

435

Shaft generator transmissions  

SciTech Connect (OSTI)

Economical on-board power can be generated from two-stroke, low-speed engines by installing a multistage hollow-shaft gearbox on the propeller intermediate shaft to drive the generator. Gearbox manufacturer Asug, based in Dessau, Germany, has designed units specifically for this purpose. The Asug shaft generator drive concept for generator drives at the front end of the engine is designed to reduce installation costs and uses an integrated engine-gearbox foundation. The complete propulsion system, consisting of the diesel engine, gear with coupling and generator, can be completely or partially preassembled outside the ship`s engine room to reduce onboard assembly time. A separate foundation for this arrangement is not necessary. The company offers a full range of gearboxes to generate power from 500 kW up to 5000 kW. Gearboxes driven from the forward engine end often incorporate an additional gear stage to gain energy from an exhaust turbine. This arrangement feeds part of the exhaust energy back into the system to increase efficiency. Latest installations of Asug shaft generator gears are in container ships and cargo/container ships built in Turkey and China.

NONE

1995-11-01T23:59:59.000Z

436

Wind power generating system  

SciTech Connect (OSTI)

Normally feathered propeller blades of a wind power generating system unfeather in response to the actuation of a power cylinder that responds to actuating signals. Once operational, the propellers generate power over a large range of wind velocities. A maximum power generation design point signals a feather response of the propellers so that once the design point is reached no increase in power results, but the system still generates power. At wind speeds below this maximum point, propeller speed and power output optimize to preset values. The propellers drive a positive displacement pump that in turn drives a positive displacement motor of the swash plate type. The displacement of the motor varies depending on the load on the system, with increasing displacement resulting in increasing propeller speeds, and the converse. In the event of dangerous but not clandestine problems developing in the system, a control circuit dumps hydraulic pressure from the unfeathering cylinder resulting in a predetermined, lower operating pressure produced by the pump. In the event that a problem of potentially cladestine consequence arises, the propeller unfeathering cylinder immediately unloads. Upon startup, a bypass around the motor is blocked, applying a pressure across the motor. The motor drives the generator until the generator reaches a predetermined speed whereupon the generator is placed in circuit with a utility grid and permitted to motor up to synchronous speed.

Schachle, Ch.; Schachle, E. C.; Schachle, J. R.; Schachle, P. J.

1985-03-12T23:59:59.000Z

437

Compact neutron generator  

DOE Patents [OSTI]

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.

Leung, Ka-Ngo; Lou, Tak Pui

2005-03-22T23:59:59.000Z

438

Use of Slip Ring Induction Generator for Wind Power Generation  

E-Print Network [OSTI]

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.

K Y Patil; D S Chavan

439

Graph Generator Survey  

SciTech Connect (OSTI)

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.

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

440

Synthetic guide star generation  

DOE Patents [OSTI]

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.

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

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Final Report for "Analyzing and visualizing next generation climate data"  

SciTech Connect (OSTI)

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.

Pletzer, Alexander

2012-11-13T23:59:59.000Z

442

Laser Safety Method For Duplex Open Loop Parallel Optical Link  

DOE Patents [OSTI]

A method and apparatus are provided to ensure that laser optical power does not exceed a "safe" level in an open loop parallel optical link in the event that a fiber optic ribbon cable is broken or otherwise severed. A duplex parallel optical link includes a transmitter and receiver pair and a fiber optic ribbon that includes a designated number of channels that cannot be split. The duplex transceiver includes a corresponding transmitter and receiver that are physically attached to each other and cannot be detached therefrom, so as to ensure safe, laser optical power in the event that the fiber optic ribbon cable is broken or severed. Safe optical power is ensured by redundant current and voltage safety checks.

Baumgartner, Steven John (Zumbro Falls, MN); Hedin, Daniel Scott (Rochester, MN); Paschal, Matthew James (Rochester, MN)

2003-12-02T23:59:59.000Z

443

Data-Parallel Mesh Connected Components Labeling and Analysis  

SciTech Connect (OSTI)

We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domain-decomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells.

Harrison, Cyrus; Childs, Hank; Gaither, Kelly

2011-04-10T23:59:59.000Z

444

JPARSS: A Java Parallel Network Package for Grid Computing  

SciTech Connect (OSTI)

The emergence of high speed wide area networks makes grid computinga 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 bandwidth and to reduce latency on a high speed wide area network. This paper presents a Java package called JPARSS (Java Parallel Secure Stream (Socket)) 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 grid environment without the necessity of tuning TCP window size. This package enables single sign-on, certificate delegation and secure or plain-text data transfer using several security components based on X.509 certificate and SSL. Several experiments will be presented to show that using Java parallelstreams is more effective than tuning TCP window size. In addition a simple architecture using Web services

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

2002-03-01T23:59:59.000Z

445

Methodology for Augmenting Existing Paths with Additional Parallel Transects  

SciTech Connect (OSTI)

Visual Sample Plan (VSP) is sample planning software that is used, among other purposes, to plan transect sampling paths to detect areas that were potentially used for munition training. This module was developed for application on a large site where existing roads and trails were to be used as primary sampling paths. Gap areas between these primary paths needed to found and covered with parallel transect paths. These gap areas represent areas on the site that are more than a specified distance from a primary path. These added parallel paths needed to optionally be connected together into a single paththe shortest path possible. The paths also needed to optionally be attached to existing primary paths, again with the shortest possible path. Finally, the process must be repeatable and predictable so that the same inputs (primary paths, specified distance, and path options) will result in the same set of new paths every time. This methodology was developed to meet those specifications.

Wilson, John E.

2013-09-30T23:59:59.000Z

446

Plane-parallel waves as duals of the flat background  

E-Print Network [OSTI]

We give a classification of non-Abelian T-duals of the flat metric in D=4 dimensions with respect to the four-dimensional continuous subgroups of the Poincare group. After dualizing the flat background, we identify majority of dual models as conformal sigma models in plane-parallel wave backgrounds, most of them having torsion. We give their form in Brinkmann coordinates. We find, besides the plane-parallel waves, several diagonalizable curved metrics with nontrivial scalar curvature and torsion. Using the non-Abelian T-duality, we find general solution of the classical field equations for all the sigma models in terms of d'Alembert solutions of the wave equation.

Ladislav Hlavaty; Ivo Petr

2014-12-03T23:59:59.000Z

447

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect (OSTI)

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL

2012-06-01T23:59:59.000Z

448

Performing a local reduction operation on a parallel computer  

DOE Patents [OSTI]

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

Blocksome, Michael A.; Faraj, Daniel A.

2012-12-11T23:59:59.000Z

449

Performing a local reduction operation on a parallel computer  

DOE Patents [OSTI]

A parallel computer including compute nodes, each including two reduction processing cores, a network write processing core, and a network read processing core, each processing core assigned an input buffer. Copying, in interleaved chunks by the reduction processing cores, contents of the reduction processing cores' input buffers to an interleaved buffer in shared memory; copying, by one of the reduction processing cores, contents of the network write processing core's input buffer to shared memory; copying, by another of the reduction processing cores, contents of the network read processing core's input buffer to shared memory; and locally reducing in parallel by the reduction processing cores: the contents of the reduction processing core's input buffer; every other interleaved chunk of the interleaved buffer; the copied contents of the network write processing core's input buffer; and the copied contents of the network read processing core's input buffer.

Blocksome, Michael A; Faraj, Daniel A

2013-06-04T23:59:59.000Z

450

Coupled Serial and Parallel Non-uniform SQUIDs  

SciTech Connect (OSTI)

In this work we numerical model series and parallel non-uniform superconducting quantum interference device (SQUID) array. Previous work has shown that series SQUID array constructed with a random distribution of loop sizes, (i.e. different areas for each SQUID loop) there exists a unique 'anti-peak' at the zero magnetic field for the voltage versus applied magnetic field (V-B). Similar results extend to a parallel SQUID array where the difference lies in the arrangement of the Josephson junctions. Other system parameter such as bias current, the number of loops, and mutual inductances are varied to demonstrate the change in dynamic range and linearity of the V-B response. Application of the SQUID array as a low noise amplifier (LNA) would increase link margins and affect the entire communication system. For unmanned aerial vehicles (UAVs), size, weight and power are limited, the SQUID array would allow use of practical 'electrically small' antennas that provide acceptable gain.

Longhini, Patrick; In, Visarath [Space and Naval Warfare Systems Center, 53560 Hull Street, San Diego, CA 92152-5001 (United States); Berggren, Susan; Palacios, Antonio [Nonlinear Dynamics Group Department of Mathematics and Statistics San Diego State University, San Diego, CA 92182 (United States); Leese de Escobar, Anna

2011-04-19T23:59:59.000Z

451

Ultrafast stimulated Raman parallel adiabatic passage by shaped pulses  

E-Print Network [OSTI]

We present a general and versatile technique of population transfer based on {\\it parallel adiabatic passage} by femtosecond shaped pulses. Their amplitude and phase are specifically designed to optimize the adiabatic passage corresponding to parallel eigenvalues at all times. We show that this technique allows the robust adiabatic population transfer in a Raman system with the total pulse area as low as 3 $\\pi$, corresponding to a fluence of one order of magnitude below the conventional stimulated Raman adiabatic passage process. This process of short duration, typically pico- and subpicosecond, is easily implementable with the modern pulse shaper technology and opens the possibility of ultrafast robust population transfer with interesting applications in quantum information processing.

G. Dridi; S. Guerin; V. Hakobyan; H. R. Jauslin; H. Eleuch

2009-10-06T23:59:59.000Z

452

Administering truncated receive functions in a parallel messaging interface  

DOE Patents [OSTI]

Administering truncated receive functions in a parallel messaging interface (`PMI`) of a parallel computer comprising a plurality of compute nodes coupled for data communications through the PMI and through a data communications network, including: sending, through the PMI on a source compute node, a quantity of data from the source compute node to a destination compute node; specifying, by an application on the destination compute node, a portion of the quantity of data to be received by the application on the destination compute node and a portion of the quantity of data to be discarded; receiving, by the PMI on the destination compute node, all of the quantity of data; providing, by the PMI on the destination compute node to the application on the destination compute node, only the portion of the quantity of data to be received by the application; and discarding, by the PMI on the destination compute node, the portion of the quantity of data to be discarded.

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

2014-12-09T23:59:59.000Z

453

Beam Dynamics Studies of Parallel-Bar Deflecting Cavities  

SciTech Connect (OSTI)

We have performed three-dimensional simulations of beam dynamics for parallel-bar transverse electromagnetic mode (TEM) type RF separators: normal- and super-conducting. The compact size of these cavities as compared to conventional TM$_{110}$ type structures is more attractive particularly at low frequency. Highly concentrated electromagnetic fields between the parallel bars provide strong electrical stability to the beam for any mechanical disturbance. An array of six 2-cell normal conducting cavities or a one- or two-cell superconducting structure are enough to produce the required vertical displacement at the Lambertson magnet. Both the normal and super-conducting structures show very small emittance dilution due to the vertical kick of the beam.

S. Ahmed, G. Krafft, K. Detrick, S. Silva, J. Delayen, M. Spata ,M. Tiefenback, A. Hofler ,K. Beard

2011-03-01T23:59:59.000Z

454

An evaluation of a parallel-resonant current-source converter for an electrothermal thruster  

E-Print Network [OSTI]

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...

Tchamdjou, Aristide-Marie

1996-01-01T23:59:59.000Z

455

June 11, 2010 12:24 WSPC/INSTRUCTION FILE PPL Parallel Processing Letters  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

456

cray-hdf5-parallel/1.8.13 garbling integers in intel environment  

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

cray-hdf5-parallel1.8.13 garbling integers in intel environment cray-hdf5-parallel1.8.13 garbling integers in intel environment September 11, 2014 (0 Comments) This problem was...

457

Parallel sorting and Star-P data movement and tree flattening  

E-Print Network [OSTI]

This thesis studies three problems in the field of parallel computing. The first result provides a deterministic parallel sorting algorithm that empirically shows an improvement over two sample sort algorithms. When using ...

Cheng David R. (David Rolin)

2005-01-01T23:59:59.000Z

458

Turbo Decoding for PR4: Parallel Versus Serial Concatenation Tom Souvignier  

E-Print Network [OSTI]

Turbo Decoding for PR4: Parallel Versus Serial Concatenation Tom Souvignier , Arnon Friedmann Diego Quantum Corporation Seagate Technology Abstract -- Recent work on the application of turbo results comparing the parallel and serial concatenation systems will be presented. I. INTRODUCTION Turbo

Siegel, Paul H.

459

Nepal --Nested DataParallelism in Haskell Manuel M. T. Chakravarty  

E-Print Network [OSTI]

Nepal -- Nested Data­Parallelism in Haskell Manuel M. T. Chakravarty University of New South Wales implementation. In the resulting system|which we call Nepal (NEsted PArallel Language), for short|a wide range

Chakravarty, Manuel

460

Numerical field simulation for parallel transmission in MRI at 7 tesla  

E-Print Network [OSTI]

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 ...

Bernier, Jessica A. (Jessica Ashley)

2011-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Dynamic Structured Partitioning for Parallel Scientific Applications with Pointwise Varying Workloads  

E-Print Network [OSTI]

Dynamic Structured Partitioning for Parallel Scientific Applications with Pointwise Varying", a dynamic structured partition- ing strategy that has been applied to parallel uniform and adaptive and overall application performance. Keywords: Dynamic load balancing, structured grids, pointwise processes

Daniels, Jeffrey J.

462

On Dynamic Scheduling of a Parallel Server System with Partial Pooling  

E-Print Network [OSTI]

proposed and refined by Harrison et al., we approximate the scheduling control problem for this parallel Scheduling of Parallel Servers. Keywords and phrases: Stochastic networks, dynamic control, resource pooling.3 Scheduling Control . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Sequence

463

Xyce Parallel Electronic Simulator : reference guide, version 4.1.  

SciTech Connect (OSTI)

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.

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

464

Design of series-parallel connected thermionic converter arrays  

SciTech Connect (OSTI)

Applications of thermionic converters require that a large number of converters be connected together in a series-parallel array in order to provide a useful output voltage. Such an array also serves to insure a very high overall system reliability, despite possible failures of individual converters. This paper predicts the effects of a nonuniform distribution of input power on the performance of such an array. 9 refs.

Mcvey, J.B.; Britt, E.J.; Fitzpatrick, G.O.; Dick, R.S.

1981-01-01T23:59:59.000Z

465

Parallel computation of multigroup reactivity coefficient using iterative method  

SciTech Connect (OSTI)

One of the research activities to support the commercial radioisotope production program is a safety research target irradiation FPM (Fission Product Molybdenum). FPM targets form a tube made of stainless steel in which the nuclear degrees of superimposed high-enriched uranium. FPM irradiation tube is intended to obtain fission. The fission material widely used in the form of kits in the world of nuclear medicine. Irradiation FPM tube reactor core would interfere with performance. One of the disorders comes from changes in flux or reactivity. It is necessary to study a method for calculating safety terrace ongoing configuration changes during the life of the reactor, making the code faster became an absolute necessity. Neutron safety margin for the research reactor can be reused without modification to the calculation of the reactivity of the reactor, so that is an advantage of using perturbation method. The criticality and flux in multigroup diffusion model was calculate at various irradiation positions in some uranium content. This model has a complex computation. Several parallel algorithms with iterative method have been developed for the sparse and big matrix solution. The Black-Red Gauss Seidel Iteration and the power iteration parallel method can be used to solve multigroup diffusion equation system and calculated the criticality and reactivity coeficient. This research was developed code for reactivity calculation which used one of safety analysis with parallel processing. It can be done more quickly and efficiently by utilizing the parallel processing in the multicore computer. This code was applied for the safety limits calculation of irradiated targets FPM with increment Uranium.

Susmikanti, Mike [Center for Development of Nuclear Informatics, National Nuclear Energy Agency of Indonesia PUSPIPTEK Area, Tangerang (Indonesia)] [Center for Development of Nuclear Informatics, National Nuclear Energy Agency of Indonesia PUSPIPTEK Area, Tangerang (Indonesia); Dewayatna, Winter [Center for Nuclear Fuel Technology, National Nuclear Energy Agency of Indonesia PUSPIPTEK Area, Tangerang (Indonesia)] [Center for Nuclear Fuel Technology, National Nuclear Energy Agency of Indonesia PUSPIPTEK Area, Tangerang (Indonesia)

2013-09-09T23:59:59.000Z

466

Electronically commutated serial-parallel switching for motor windings  

DOE Patents [OSTI]

A method and a circuit for controlling an ac machine comprises controlling a full bridge network of commutation switches which are connected between a multiphase voltage source and the phase windings to switch the phase windings between a parallel connection and a series connection while providing commutation discharge paths for electrical current resulting from inductance in the phase windings. This provides extra torque for starting a vehicle from lower battery current.

Hsu, John S. (Oak Ridge, TN)

2012-03-27T23:59:59.000Z

467

A subliminal manipulation of the Extended Parallel Process Model  

E-Print Network [OSTI]

the context of skin cancer. The goals of this study were to (1) assess the effects of subliminal embeds as fear appeals (2) within the framework of the Extended Parallel Process Model, the EPPM (Witte, 1992a). While this study demonstrated that subliminal... go unnoticed by individuals (Dixon, 1981). To extend the inquiry into subliminal message processing, this project places embedded pictures (a form of subliminal research) in the context of skin cancer This thesis uses the style of mm ni ' n...

Stephenson, Michael Taylor

1993-01-01T23:59:59.000Z

468

Massive Data-Parallel Swarm Simulation and Visualisation using CUDA  

E-Print Network [OSTI]

for the project was to employ CUDA for simulating natural movement and behaviour of a fish swarm. As a fish swarm by calculating the state of a fish at time ti+1 as a function of the state of the whole swarm at time ti. Since this function is equal for all fishes, the state of the whole swarm can easily be calculated in parallel

Hinze, Thomas

469

Xyce parallel electronic simulator reference guide, version 6.0.  

SciTech Connect (OSTI)

This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users' Guide [1] . 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 [1].

Keiter, Eric Richard; Mei, Ting; Russo, Thomas V.; Schiek, Richard Louis; Thornquist, Heidi K.; Verley, Jason C.; Fixel, Deborah A.; Coffey, Todd Stirling; Pawlowski, Roger Patrick; Warrender, Christina E.; Baur, David G. [Raytheon, Albuquerque, NM

2013-08-01T23:59:59.000Z

470

1979 year-end electric power survey. [Monograph  

SciTech Connect (OSTI)

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)

Not Available

1980-01-01T23:59:59.000Z

471

Electric power monthly: April 1996, with data for January 1996  

SciTech Connect (OSTI)

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.

NONE

1996-04-01T23:59:59.000Z

472

Generating electricity from viruses  

SciTech Connect (OSTI)

Berkeley Lab's Seung-Wuk Lee discusses "Generating electricity from viruses" in this Oct. 28, 2013 talk, which is part of a Science at the Theater event entitled Eight Big Ideas.

Lee, Seung-Wuk

2013-10-31T23:59:59.000Z

473

Energy and Mass Generation  

E-Print Network [OSTI]

Modifications in the energy momentum dispersion laws due to a noncommutative geometry, have been considered in recent years. We examine the oscillations of extended objects in this perspective and find that there is now a "generation" of energy.

Burra G. Sidharth

2010-03-11T23:59:59.000Z

474

Contextualizing generative design  

E-Print Network [OSTI]

Generative systems have been widely used to produce two- and three-dimensional constructs, in an attempt to escape from our preconceptions and pre-existing spatial language. The challenge is to use this mechanism in ...

Arida, Saeed, 1977-

2004-01-01T23:59:59.000Z

475

Monte Carlo event generators  

SciTech Connect (OSTI)

I review recent progress in the physics of parton shower Monte Carlos, emphasizing the ideas which allow the inclusion of higher-order matrix elements into the framework of event generators.

Frixione, Stefano [INFN, Sezione di Genova, Via Dodecaneso 33, 16146 Genova (Italy)

2005-10-06T23:59:59.000Z

476

Generating electricity from viruses  

ScienceCinema (OSTI)

Berkeley Lab's Seung-Wuk Lee discusses "Generating electricity from viruses" in this Oct. 28, 2013 talk, which is part of a Science at the Theater event entitled Eight Big Ideas.

Lee, Seung-Wuk

2014-06-23T23:59:59.000Z

477

Oscillating fluid power generator  

SciTech Connect (OSTI)

A system and method for harvesting the kinetic energy of a fluid flow for power generation with a vertically oriented, aerodynamic wing structure comprising one or more airfoil elements pivotably attached to a mast. When activated by the moving fluid stream, the wing structure oscillates back and forth, generating lift first in one direction then in the opposite direction. This oscillating movement is converted to unidirectional rotational movement in order to provide motive power to an electricity generator. Unlike other oscillating devices, this device is designed to harvest the maximum aerodynamic lift forces available for a given oscillation cycle. Because the system is not subjected to the same intense forces and stresses as turbine systems, it can be constructed less expensively, reducing the cost of electricity generation. The system can be grouped in more compact clusters, be less evident in the landscape, and present reduced risk to avian species.

Morris, David C

2014-02-25T23:59:59.000Z

478

Vector generator scan converter  

DOE Patents [OSTI]

High printing speeds for graphics data are achieved with a laser printer by transmitting compressed graphics data from a main processor over an I/O channel to a vector generator scan converter which reconstructs a full graphics image for input to the laser printer through a raster data input port. The vector generator scan converter includes a microprocessor with associated microcode memory containing a microcode instruction set, a working memory for storing compressed data, vector generator hardware for drawing a full graphic image from vector parameters calculated by the microprocessor, image buffer memory for storing the reconstructed graphics image and an output scanner for reading the graphics image data and inputting the data to the printer. The vector generator scan converter eliminates the bottleneck created by the I/O channel for transmitting graphics data from the main processor to the laser printer, and increases printer speed up to thirty fold. 7 figs.

Moore, J.M.; Leighton, J.F.

1988-02-05T23:59:59.000Z

479

Vector generator scan converter  

DOE Patents [OSTI]

High printing speeds for graphics data are achieved with a laser printer by transmitting compressed graphics data from a main processor over an I/O (input/output) channel to a vector generator scan converter which reconstructs a full graphics image for input to the laser printer through a raster data input port. The vector generator scan converter includes a microprocessor with associated microcode memory containing a microcode instruction set, a working memory for storing compressed data, vector generator hardward for drawing a full graphic image from vector parameters calculated by the microprocessor, image buffer memory for storing the reconstructed graphics image and an output scanner for reading the graphics image data and inputting the data to the printer. The vector generator scan converter eliminates the bottleneck created by the I/O channel for transmitting graphics data from the main processor to the laser printer, and increases printer speed up to thirty fold.

Moore, James M. (Livermore, CA); Leighton, James F. (Livermore, CA)

1990-01-01T23:59:59.000Z

480

Data-flow graphs as a model of parallel complexity  

SciTech Connect (OSTI)

A new model of parallel computation based on data-flow graphs is introduced, which is specifically oriented towards complexity theory. Data-flow graphs are capable of illustrating properties of synchronous, asynchronous, and nondeterministic computations. Sufficient conditions are derived for asynchronous data-flow graphs to be determinate, i.e., all possible computations are finite and yield the same result. For determinate graphs, it is shown that the synchronous computation is as fast as any asynchronous computation. An algorithm is presented that transforms a nondeterminate data-flow graphs into a synchronous determinate one. The basic data-flow graph idea is extended into a model with greater potential parallelism, called the Uniform Data Flow Graph Family (UDFGF) Model. It is proved that time and space for the UDFGF model are polynomially related to reversal and space for the Turing Machine model, in both the deterministic and nondeterministic cases. In addition to forming an abstract computational model, data-flow graphs are parallel programs for real multiprocessors. Given a data flow graph program and a multiprocessor, each node of the graph must be assigned to one of the processors. It is proved that this problem is intractable, and a practical algorithm to find approximate solutions for it is presented.

Campbell, M.L.

1987-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "kilowatt-hour parallel generation" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Identifying failure in a tree network of a parallel computer  

DOE Patents [OSTI]

Methods, parallel computers, and products are provided for identifying failure in a tree network of a parallel computer. The parallel computer includes one or more processing sets including an I/O node and a plurality of compute nodes. For each processing set embodiments include selecting a set of test compute nodes, the test compute nodes being a subset of the compute nodes of the processing set; measuring the performance of the I/O node of the processing set; measuring the performance of the selected set of test compute nodes; calculating a current test value in dependence upon the measured performance of the I/O node of the processing set, the measured performance of the set of test compute nodes, and a predetermined value for I/O node performance; and comparing the current test value with a predetermined tree performance threshold. If the current test value is below the predetermined tree performance threshold, embodiments include selecting another set of test compute nodes. If the current test value is not below the predetermined tree performance threshold, embodiments include selecting from the test compute nodes one or more potential problem nodes and testing individually potential problem nodes and links to potential problem nodes.

Archer, Charles J. (Rochester, MN); Pinnow, Kurt W. (Rochester, MN); Wallenfelt, Brian P. (Eden Prairie, MN)

2010-08-24T23:59:59.000Z

482

Improved parallel solution techniques for the integral transport matrix method  

SciTech Connect (OSTI)

Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution by up to {approx}50% when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing case are opticaUy thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block preconditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient preconditioner.

Zerr, Robert J [Los Alamos National Laboratory; Azmy, Yousry Y [NORTH CAROLINA STATE UNIV.

2010-11-23T23:59:59.000Z

483

Design and performance of a scalable, parallel statistics toolkit.  

SciTech Connect (OSTI)

Most statistical software packages implement a broad range of techniques but do so in an ad hoc fashion, leaving users who do not have a broad knowledge of statistics at a disadvantage since they may not understand all the implications of a given analysis or how to test the validity of results. These packages are also largely serial in nature, or target multicore architectures instead of distributed-memory systems, or provide only a small number of statistics in parallel. This paper surveys a collection of parallel implementations of statistics algorithm developed as part of a common framework over the last 3 years. The framework strategically groups modeling techniques with associated verification and validation techniques to make the underlying assumptions of the statistics more clear. Furthermore it employs a design pattern specifically targeted for distributed-memory parallelism, where architectural advances in large-scale high-performance computing have been focused. Moment-based statistics (which include descriptive, correlative, and multicorrelative statistics, principal component analysis (PCA), and k-means statistics) scale nearly linearly with the data set size and number of processes. Entropy-based statistics (which include order and contingency statistics) do not scale well when the data in question is continuous or quasi-diffuse but do scale well when the data is discrete and compact. We confirm and extend our earlier results by now establishing near-optimal scalability with up to 10,000 processes.

Thompson, David C.; Bennett, Janine Camille; Pebay, Philippe Pierre

2010-11-01T23:59:59.000Z

484

An informal introduction to program transformation and parallel processors  

SciTech Connect (OSTI)

In the summer of 1992, I had the opportunity to participate in a Faculty Research Program at Argonne National Laboratory. I worked under Dr. Jim Boyle on a project transforming code written in pure functional Lisp to Fortran code to run on distributed-memory parallel processors. To perform this project, I had to learn three things: the transformation system, the basics of distributed-memory parallel machines, and the Lisp programming language. Each of these topics in computer science was unfamiliar to me as a mathematician, but I found that they (especially parallel processing) are greatly impacting many fields of mathematics and science. Since most mathematicians have some exposure to computers, but.certainly are not computer scientists, I felt it was appropriate to write a paper summarizing my introduction to these areas and how they can fit together. This paper is not meant to be a full explanation of the topics, but an informal introduction for the ``mathematical layman.`` I place myself in that category as well as my previous use of computers was as a classroom demonstration tool.

Hopkins, K.W. [Southwest Baptist Univ., Bolivar, MO (United States)

1994-08-01T23:59:59.000Z

485

Automatic Thread-Level Parallelization in the Chombo AMR Library  

SciTech Connect (OSTI)

The increasing on-chip parallelism has some substantial implications for HPC applications. Currently, hybrid programming models (typically MPI+OpenMP) are employed for mapping software to the hardware in order to leverage the hardware?s architectural features. In this paper, we present an approach that automatically introduces thread level parallelism into Chombo, a parallel adaptive mesh refinement framework for finite difference type PDE solvers. In Chombo, core algorithms are specified in the ChomboFortran, a macro language extension to F77 that is part of the Chombo framework. This domain-specific language forms an already used target language for an automatic migration of the large number of existing algorithms into a hybrid MPI+OpenMP implementation. It also provides access to the auto-tuning methodology that enables tuning certain aspects of an algorithm to hardware characteristics. Performance measurements are presented for a few of the most relevant kernels with respect to a specific application benchmark using this technique as well as benchmark results for the entire application. The kernel benchmarks show that, using auto-tuning, up to a factor of 11 in performance was gained with 4 threads with respect to the serial reference implementation.

Christen, Matthias; Keen, Noel; Ligocki, Terry; Oliker, Leonid; Shalf, John; Van Straalen, Brian; Williams, Samuel

2011-05-26T23:59:59.000Z

486

Long waves in parallel flow in Hele-Shaw cells  

SciTech Connect (OSTI)

During the past several years the flow of immiscible flow in Hele-Shaw cells and porous media has been investigated extensively. Of particular interest to most studies has been frontal displacement, specifically viscous fingering instabilities and finger growth. The practical ramifications regarding oil recovery, as well as many other industrial processes in porous media, have served as the primary driving force for most of these investigations. By contrast, little attention has been paid to the motion of lateral fluid interface, which are parallel to the main flow direction. Parallel flow is an often encountered, although much overlooked regime. The evolution of fluid interfaces in parallel flow in Hele-Shaw cells is studied both theoretically and experimentally in the large capillary number limit. It is shown that such interfaces support wave motion, the amplitude of which for long waves is governed by the KdV equation. Experiments are conducted in a long Hele-Shaw cell that validate the theory in the symmetric case. 35 refs., 16 figs.

Zeybek, M.; Yortsos, Y.C.

1991-04-01T23:59:59.000Z

487

Exploiting VSIPL and OpenMP for Parallel Image Processing  

E-Print Network [OSTI]

VSIPL and OpenMP are two open standards for portable high performance computing. VSIPL delivers optimized single processor performance while OpenMP provides a low overhead mechanism for executing thread based parallelism on shared memory systems. Image processing is one of the main areas where VSIPL and OpenMP can make a large impact. Currently, a large fraction of image processing applications are written in the Interpreted Data Language (IDL) environment. The aim of this work is to demonstrate that the performance benefits of these new standards can be brought to image processing community in a high level manner that is transparent to users. To this end, this talk presents a fast, FFT based algorithm for performing image convolutions. This algorithm has been implemented within the IDL environment using VSIPL (for optimized single processor performance) with added OpenMP directives (for parallelism). This work demonstrates that good parallel speedups are attainable using standards and can be integrated seamlessly into existing user environments.

Jeremy Kepner

2001-04-08T23:59:59.000Z

488

GPU-ABiSort: Optimal Parallel Sorting on Stream Architectures Alexander Gre1  

E-Print Network [OSTI]

GPU-ABiSort: Optimal Parallel Sorting on Stream Architectures Alexander Gre?1 and Gabriel Zachmann2

Behnke, Sven

489

Steam generator tube failures  

SciTech Connect (OSTI)

A review and summary of the available information on steam generator tubing failures and the impact of these failures on plant safety is presented. The following topics are covered: pressurized water reactor (PWR), Canadian deuterium uranium (CANDU) reactor, and Russian water moderated, water cooled energy reactor (VVER) steam generator degradation, PWR steam generator tube ruptures, the thermal-hydraulic response of a PWR plant with a faulted steam generator, the risk significance of steam generator tube rupture accidents, tubing inspection requirements and fitness-for-service criteria in various countries, and defect detection reliability and sizing accuracy. A significant number of steam generator tubes are defective and are removed from service or repaired each year. This wide spread damage has been caused by many diverse degradation mechanisms, some of which are difficult to detect and predict. In addition, spontaneous tube ruptures have occurred at the rate of about one every 2 years over the last 20 years, and incipient tube ruptures (tube failures usually identified with leak detection monitors just before rupture) have been occurring at the rate of about one per year. These ruptures have caused complex plant transients which have not always been easy for the reactor operators to control. Our analysis shows that if more than 15 tubes rupture during a main steam line break, the system response could lead to core melting. Although spontaneous and induced steam generator tube ruptures are small contributors to the total core damage frequency calculated in probabilistic risk assessments, they are risk significant because the radionuclides are likely to bypass the reactor containment building. The frequency of steam generator tube ruptures can be significantly reduced through appropriate and timely inspections and repairs or removal from service.

MacDonald, P.E.; Shah, V.N.; Ward, L.W.; Ellison, P.G.

1996-04-01T23:59:59.000Z

490

Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers \\Lambda  

E-Print Network [OSTI]

Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computersscale parallel computers, iterative methods such as the Conjugate Gradient method for solving such systems of an iteration of the Preconditioned Conjugate Gradient Algorithm on parallel architectures with a variety

Kumar, Vipin

491

Parallel contact detection algorithm for transient solid dynamics simulations using PRONTO3D  

SciTech Connect (OSTI)

An efficient, scalable, parallel algorithm for treating material surface contacts in solid mechanics finite element programs has been implemented in a modular way for MIMD parallel computers. The serial contact detection algorithm that was developed previously for the transient dynamics finite element code PRONTO3D has been extended for use in parallel computation by devising a dynamic (adaptive) processor load balancing scheme.

Attaway, S.W.; Hendrickson, B.A.; Plimpton, S.J. [and others

1996-09-01T23:59:59.000Z

492

An Optimal Fuzzy Logic Power Sharing Strategy for Parallel Hybrid Electric Vehicles  

E-Print Network [OSTI]

An Optimal Fuzzy Logic Power Sharing Strategy for Parallel Hybrid Electric Vehicles F. Khoucha1 presents a fuzzy logic controller for a Parallel Hybrid Electric Vehicle (PHEV). The PHEV required driving economy, and emissions. Index Terms--Parallel Hybrid Electric Vehicle (PHEV), Internal Combustion Engine

Brest, Université de

493

Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous  

E-Print Network [OSTI]

processing systems [2], med- ical electronics [9], aircraft control [1], and scientific parallel computing [6 a system framework, security overhead, and parallel applications with deadline and security constraintsSecurity-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous

Qin, Xiao

494

Efficient SIMD technique with parallel Max-Log-MAP Algorithm for Turbo Decoders  

E-Print Network [OSTI]

Efficient SIMD technique with parallel Max-Log-MAP Algorithm for Turbo Decoders David Gnaedig Turbo on a DSP a parallel Max-Log-MAP algorithm for turbo decoders. It consists in using SIMD instructions by the use of an adapted two-dimensional turbo code and its parallel interleaver structure. After a brief

Paris-Sud XI, Université de

495

On the higher ef ciency of parallel Reed-Solomon turbo-decoding  

E-Print Network [OSTI]

On the higher ef ciency of parallel Reed-Solomon turbo-decoding Camille LEROUX, Christophe JEGO.lastname@telecom-bretagne.eu Abstract-- In this paper, we demonstrate the higher hardware ef ciency of Reed-Solomon (RS) parallel turbo decoding compared with BCH parallel turbo decoding. Based on an innovative ar- chitecture, this is the rst

Paris-Sud XI, Université de

496

An Energy-Efficient Framework for Large-Scale Parallel Storage Systems  

E-Print Network [OSTI]

An Energy-Efficient Framework for Large-Scale Parallel Storage Systems Ziliang Zong, Matt Briggs-scale and energy-efficient parallel storage systems. To validate the efficiency of the proposed framework, a buffer that this new framework can significantly improves the energy efficiency of large-scale parallel storage systems

Qin, Xiao

497

Synchronization-Free Parallel Collision Detection Pipeline Quentin Avril Valerie Gouranton Bruno Arnaldi  

E-Print Network [OSTI]

Synchronization-Free Parallel Collision Detection Pipeline Quentin Avril Val´erie Gouranton Bruno a first parallel and adaptive collision detection pipeline running on a multi-core architecture. This pipeline integrates a first global synchronization-free parallelization of its major steps and enables

Paris-Sud XI, Université de

498

Associative Memories Provide an Efficient Control Mechanism for a Parallel Production System Architecture  

E-Print Network [OSTI]

Associative Memories Provide an Efficient Control Mechanism for a Parallel Production System a parallel architecture for production systems [2, 3, 5]. This novel architecture allows parallel production. The elimination of global synchronization in production systems was made possible by the use of serializability

Amaral, José Nelson

499

A Practical Access to the Theory of Parallel Algorithms Christoph Kessler  

E-Print Network [OSTI]

: FundamentalsofParallelProcessing. Prentice Hall, 2003. Keller, Kessler, Tr¨aff: Practical PRAM ProgrammingA Practical Access to the Theory of Parallel Algorithms Christoph Kessler Department of Computer, USA, March 6, 2004 SIGCSE'04 Norfolk 6 March 2004 -- A practical access to the theory of parallel

Kessler, Christoph

500

0.1TDDC78/TANA77, C. Kessler, IDA, Linkpingsuniversitet, 2009. Programming of Parallel Computers  

E-Print Network [OSTI]

- OpenMP Distributed memory, message passing - MPI (Data-parallel - Fortran90) Design methods series and MPI (MC) OpenMP (CK) / Mid-term evaluation by muddy cards Data-parallel programming lab groups with up to 16 students each in parallel, 2 passes ("Grupp_A", "Grupp_B" in the web schedule

Kessler, Christoph