Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computer programming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

A Compact Code for Simulations of Quantum Error Correction in Classical Computers

This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Principled Kernel Testbed for Hardware/Software Co-Design Research

Recently, advances in processor architecture have become the driving force for new programming models in the computing industry, as ever newer multicore processor designs with increasing number of cores are introduced on schedules regimented by marketing demands. As a result, collaborative parallel (rather than simply concurrent) implementations of important applications, programming languages, models, and even algorithms have been forced to adapt to these architectures to exploit the available raw performance. We believe that this optimization regime is flawed. In this paper, we present an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. This testbed will enable comparative research in areas such as parallel programming models, languages, auto-tuning, and hardware/software codesign. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Advanced Simulation and Computing FY20 Implementation Plan (Rev. 0)

The Stockpile Stewardship Program (SSP) is an integrated technical program for maintaining the safety, surety, and reliability of the U.S. nuclear stockpile. The SSP incorporates nuclear test data, computational modeling and simulation, and experimental facilities to advance understanding of nuclear weapons. The suite of data analyzed comes from activities including stockpile surveillance, experimental research, and development and engineering programs. This integrated national program requires the continued use of experimental facilities and the computational capabilities to support the SSP missions. These component parts, in addition to an appropriately scaled production capability, enable the National Nuclear Security Administration (NNSA) to support stockpile requirements. The ultimate goal of the Stewardship Program, and thus the Advanced Simulation and Computing (ASC) Program, is to ensure that the U.S. maintains a safe, secure, and effective strategic deterrent.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Job Management with mpi_jm

About this book: This book constitutes the refereed post-conference proceedings of 13 workshops held at the 33rd International ISC High Performance 2018 Conference, in Frankfurt, Germany, in June 2018: HPC I/O in the Data Center, HPC-IODC 2018; Workshop on Performance and Scalability of Storage Systems, WOPSSS 2018; 13th Workshop on Virtualization in High­-Performance Cloud Computing, VHPC 2018; Third International Workshop on In Situ Visualization, WOIV 2018; 4th International Workshop on Communication Architectures for HPC, Big Data, Deep Learning and Clouds at Extreme Scale, ExaComm 2018; International Workshop on OpenPOWER for HPC, IWOPH 2018; IXPUG Workshop: Many-Core Computing on Intel Processors; Workshop on Sustainable Ultrascale Computing Systems; Approximate and Transprecision Computing on Emerging Technologies, ATCET 2018; First Workshop on the Convergence of Large-Scale Simulation and Artificial Intelligence; Third Workshop for Open Source Supercomputing, OpenSuCo 2018; First Workshop on Interactive High-Performance Computing; Workshop on Performance Portable Programming Models for Accelerators, P^3MA 2018. The 53 full papers included in this volume were carefully reviewed and selected from 80 submissions. They cover all aspects of research, development, and application of large-scale, high performance experimental and commercial systems. Topics include HPC computer architecture and hardware; programming models, system software, and applications; solutions for heterogeneity, reliability, power efficiency of systems; virtualization and containerized environments; big data and cloud computing; and artificial intelligence.

Berkowitz, Evan↗

IRIS-DMEM: Efficient Memory Management for Heterogeneous Computing

This paper proposes an efficient data memory management approach for the Intelligent RuntIme System (IRIS) heterogeneous computing framework along with new data transfer policies. IRIS provides a task-based programming model for extreme heterogeneous computing (e.g., CPU, GPU, DSP, FPGA) with support for today's most important programming languages (e.g., OpenMP, OpenCL, CUDA, HIP, OpenACC). However, the IRIS framework either forces the programmer to introduce data transfer commands for each task or relies on suboptimal memory management for automatic and transparent data transfers. The work described here extends IRIS with novel heterogeneous memory handling and introduces novel data transfer policies by employing the Distributed data MEMory handler (DMEM) for efficient and optimal movement of data among the various computing resources. The proposed approach achieves performance gains of up to 7× for tiled LU factorization and tiled DGEMM (i.e., matrix multiplication) benchmarks. Moreover, this approach also reduces data transfers by up to 71% when compared to previous IRIS heterogeneous memory management handlers. This work compares the performance results of the IRIS framework's novel DMEM with the StarPU runtime and MAGMA math library for GPUs. Experiments show a performance gain of up to 1.95× over StarPU and 2.1× over MAGMA.

Miniskar, Narasinga Rao↗

Final Report for Award #DE-SC3956 Separating Algorithm and Implementation via programming Model Injection (SAIMI)

Programming parallel machines is fraught with difficulties: the obfuscation of algorithms due to implementation details such as communication and synchronization, the need for transparency between language constructs and performance, the difficulty of performing program analysis to enable automatic parallelization techniques, and the existence of important "dusty deck" codes. The SAIMI project developed abstractions that enable the orthogonal specification of algorithms and implementation details within the context of existing DOE applications. The main idea is to enable the injection of small programming models such as expressions involving transcendental functions, polyhedral iteration spaces with sparse constraints, and task graphs into full programs through the use of pragmas. These smaller, more restricted programming models enable orthogonal specification of many implementation details such as how to map the computation on to parallel processors, how to schedule the computation, and how to allocation storage for the computation. At the same time, these small programming models enable the expression of the most computationally intense and communication heavy portions in many scientific simulations. The ability to orthogonally manipulate the implementation for such computations will significantly ease performance programming efforts and expose transformation possibilities and parameter to automated approaches such as autotuning. At Colorado State University, the SAIMI project was supported through DOE grant DE-SC3956 from April 2010 through August 2015. The SAIMI project has contributed a number of important results to programming abstractions that enable the orthogonal specification of implementation details in scientific codes. This final report summarizes the research that was funded by the SAIMI project.

97 MATHEMATICS AND COMPUTING↗

Exploration of Artificial Frustrated Magnets

This program encompasses experimental and theoretical studies of arrays of nanometer-scale magnets known as “artificial frustrated magnets”. These magnets are small and closely spaced, so that their behavior as a collective group is complex and reveals insights into how such collections of interacting objects behave as a group. In particular, the placement of the magnets is such that the interactions between them are “frustrated”, in that they compete with each other. These systems are analogs to a class of magnetic materials in which the lattice geometry frustrates interactions between individual atomic moments, and in which a wide range of novel physical phenomena have been recently observed. The advantage to studying the arrays is that they are both designable and resolvable: i.e., the experiments can control all aspects of the array geometry, and can also observe how individual elements of the arrays behave. This research program demonstrated a number of phenomena including the role of multiple collective interactions, the feasibility of using systems with their magnetism aligned perpendicular to the plane of the array, the importance of disorder in the arrays, and the possibility of using high temperatures to adjust the magnet orientations. All of these phenomena, and others explored in this program, add to the body of knowledge around collective magnetic behavior and magnetism in general. Aside from building scientific knowledge in an important technological area, with relevance to computing and memory, the program also gave critical support to the education of students working on the experiments.

97 MATHEMATICS AND COMPUTING↗

Evaluating Nonuniform Reduction in HIP and SYCL on GPUs

Motivated by maturing programming models and portability for heterogeneous computing, we describe the challenges posed by hardware architectures and programming models when migrating an optimized implementation of nonuniform reduction from CUDA to HIP and SYCL. We explain the migration experience, evaluate the performance of the reduction on GPU -based computing platforms, and provide feedback on improving portability for the development of the SYCL programming model.

Jin, Zheming↗

MCNP6 Monte Carlo Code Optimization [Slides]

The MCNP6.1 Monte Carlo code, released in 2013, offers many features not available in previous versions, but runs 20-30% slower for most problems and 2-5x slower for some problems. The MCNP 2020 initiative was established in mid-2013 to address code performance and other issues, with 3 basic components: (1) Improve MCNP performance, with the specific goal of achieving a 2x performance gain within 2 years; (2) Upgrade the core MCNP software and algorithms in an evolutionary fashion, with the goal of achieving more agile and sustainable code; (3) Prepare for future exascale systems that will include massive parallelism and limited memory per core, with the goal of providing flexible and adaptable coding for possible exascale systems. This talk reviews the initial performance improvements to MCNP6.1 that have been incorporated into the 2014 update, MCNP6.1.1. The performance improvements to date have included both classic code optimizations and algorithm improvements. Testing on a variety of problems has demonstrated that the performance improvements were effective, yielding speedups by factors of 1.2x - 4x compared to MCNP6.1, depending on the type of problem. For criticality problems, MCNP6.1.1 runs 1.5x - 1.7x faster than MCNP6.1. Much more work is planned for improving MCNP6 performance, structure, and algorithms.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Study of Geodesic Distance Kernel on an Integrated GPU

Graphics processing units (GPUs) are commonly used for graphics and general-purpose (GPGPU) computation. Currently, NVIDIA’s GPUs, through its CUDA framework for GPGPU programming, are ubiquitous for highperformance computing. Another class of GPUs, with a central processing unit (CPU) and a GPU integrated on the same chip, is commonly used in laptops, desktop computers, and low-power servers. While they are not designed to outperform discrete GPUs due to the power, area, and thermal constrains [1], there is a need to better understand the performance of a processor with an integrated GPU for floating-point intensive applications. The study helps us better understand the characteristics of hardware and software development tools, and the benefit of offloading such applications to an integrated GPU.

97 MATHEMATICS AND COMPUTING↗

ASCR@40: Four Decades of Department of Energy Leadership in Advanced Scientific Computing Research

Throughout its long history, the Office of Advanced Scientific Computing Research (ASCR) has built the critical technologies to ensure U.S. leadership in energy science and national security. It has made its parent agency, the Department of Energy (DOE) and its Office of Science, the world’s recognized leader in computational science. ASCR’s stated mission is “to discover, develop, and deploy computational and networking capabilities to analyze, model, simulate, and predict complex phenomena important to the DOE.” To accomplish this goal, ASCR oversees a large complex of computing and networking facilities and is responsible for procuring, deploying and operating high-performance computing (HPC), networking and storage resources; conducting basic research in mathematics and computer science; developing and sustaining a large body of software; and collaborating with other Office of Science programs, academia and industry. ASCR’s computational science leadership has a long history, predating even DOE’s inception. Applied mathematics and advanced computing were both elements of the Manhattan Project’s Theoretical Division. In the 1950s, DOE’s predecessor, the Atomic Energy Commission, created a mathematics program to develop and apply digital computing by supporting researchers at universities and AEC laboratories. Several organizational and name changes later, this program would grow and become ASCR.

97 MATHEMATICS AND COMPUTING↗

Final Report for Foundational Tools for Petascale Computing

This project concentrated on various aspects of creating tool infrastructure to make it easier to program large-scale parallel computers. This project was collaborative with the University of Wisconsin and closely related to the project DE-SC0002606 (“Tools for the Development of High Performance Energy Applications and Systems”) . The research conducted during this project is summarized in this report. The complete details of the work are available in the ten publications listed at the end of the report. Many of the concepts created during this project have been incorporated into tools and made available as freely downloadable software (at www.dyninst.org). It also supported the Ph.D. studies of three students and one research staff member.

97 MATHEMATICS AND COMPUTING↗

Hybrid parallel programming with MPI and Unified Parallel C.

The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited by the amount of local memory within a compute node. Partitioned Global Address Space (PGAS) models such as Unified Parallel C (UPC) are growing in popularity because of their ability to provide a shared global address space that spans the memories of multiple compute nodes. However, taking advantage of UPC can require a large recoding effort for existing parallel applications. In this paper, we explore a new hybrid parallel programming model that combines MPI and UPC. This model allows MPI programmers incremental access to a greater amount of memory, enabling memory-constrained MPI codes to process larger data sets. In addition, the hybrid model offers UPC programmers an opportunity to create static UPC groups that are connected over MPI. As we demonstrate, the use of such groups can significantly improve the scalability of locality-constrained UPC codes. This paper presents a detailed description of the hybrid model and demonstrates its effectiveness in two applications: a random access benchmark and the Barnes-Hut cosmological simulation. Experimental results indicate that the hybrid model can greatly enhance performance; using hybrid UPC groups that span two cluster nodes, RA performance increases by a factor of 1.33 and using groups that span four cluster nodes, Barnes-Hut experiences a twofold speedup at the expense of a 2% increase in code size.

99 GENERAL AND MISCELLANEOUS↗

Post-closure program streamlining at the Nevada national security site - 15290

More than 200 sites on the Nevada National Security Site (NNSS), Nevada Test and Training Range (NTTR), and Tonopah Test Range (TTR) have been closed in place. At these sites, contamination has been left in place, and protection of human health, safety, and the environment is ensured through the establishment of use restrictions (URs). Post-closure requirements were initially established in the Closure Report (CR) for each site and include a variety of inspection, monitoring, maintenance, and reporting commitments. Post-closure requirements and site controls (fences, monuments, soil covers, and postings) may vary depending on site location, accessibility, land use scenario, and the nature of contaminants left in place. Corrective Action Sites (CASs) on the NNSS, NTTR, and TTR have been identified for closure under the Federal Facility Agreement and Consent Order (FFACO), which was signed in 1996. Over 1,900 CASs have been closed under the framework of the FFACO, and more than 200 of those have URs. Many post-closure requirements have been modified over time. In addition, because the scope of the program has spanned almost 20 years, the post-closure requirements have varied due to changing strategies and expectations. Because of the number of sites closed over the course of the program, post-closure requirements are found in hundreds of closure documents, addendums, errata sheets, Records of Technical Change, inspection reports, permit modifications, and correspondence. Furthermore, resources such as personnel and funding necessary to conduct the post-closure program have diminished, while computer capabilities and configuration control principles have improved since closure activities under the FFACO began. Because of these factors, to effectively manage the post-closure program, ensure that all commitments are being met, and improve the ease of identifying the most current post-closure requirements for each UR, the current requirements for every use-restricted site under the purview of the U.S. Department of Energy, National Nuclear Security Administration Nevada Field Office will be consolidated into a single Post-Closure Plan. The Consolidated Post-Closure Plan will also outline a strategy and present possible criteria that may be used for future evaluation of post-closure requirements. Continual assessment of the post-closure program will ensure that the post-closure requirements for URs across the NNSS, NTTR, and TTR are consistently justifiable and sufficient to protect site workers, the public, and the environment while increasing efficiency. Future changes to post-closure requirements and justification for those changes will be recorded in revisions to the Consolidated Post-Closure Plan. This process will provide a comprehensive, consistent, and streamlined method for evaluation of post-closure requirements and implementation of changes. (authors)

54 ENVIRONMENTAL SCIENCES↗

The interaction of reactants, intermediates and products with Cu ions in Cu-SSZ-13 NH3 SCR catalysts: An energetic and ab initio X-ray absorption modeling study

Copper-exchanged SSZ-13 (Cu-SSZ-13) provides excellent catalytic activity and hydrothermal stability in the selective catalytic reduction (SCR) of NOx by using NH3 as a reductant. In this contribution, we compare the most likely positions for Cu with a single charge compensating Al atom (ZCu), including the effect of the adsorption of reactants, intermediates and products of a NH3 SCR reaction by using first-principles calculations based on density functional theory. We find that the 6-membered ring (6MR) site is the most energetically favorable while the 8-membered ring (8MR) sites are less favorable with energy differences about 0.5 eV with respect to the 6MR site. Upon molecular adsorption, the energy differences between Cu in the 8MR and 6MR sites decreases and almost disappears, which means that the thermodynamic stability of ZCu with molecularly adsorbed species is nearly identical for Cu in different sites. Considering more complicated scenarios of NO (or CO) adsorption, we find that the co-adsorption of 2 NO (or 2 CO) molecules weakens their interaction with Cu, as well as their co-adsorption with OH and H2O. The X-ray absorption near edge structure (XANES) of Cu in Cu-SSZ-13 under different conditions was also modeled from first principles. We find that the pre-edge feature in the K-edge XANES of Cu in clean Cu-SSZ-13 with Cu in a 8MR site is induced by a 1s to 4s transition while there is no pre-edge peak when Cu is in a 6MR site. Molecular adsorption onto Cu in a 6MR or a 8MR site results in the same K-edge XANES. When NO is adsorbed onto Cu in SSZ-13, we find that the origin of the small pre-edge peak in the K-edge XANES lies in a 1s to 3d electron transition. On the other hand, when CO or N2 is adsorbed onto an isolated Cu atom in SSZ-13, a transition from the 1s state to the hybridized state of 3d and 4p results in a pre-edge peak in the K-edge of the XANES spectrum. It is also found that the edge position and intensity of the maximum peak of Cu K-edge XANES depend on the Cu locations and the adsorbed molecules. By studying the Cu K-edge XANES of ZCu with adsorption of species of different oxidizing power, we conclude that a higher oxidation state of Cu will result in a higher energy edge position in the Cu K-edge XANES. These results are expected to greatly aid our understanding of Cu-SSZ-13 SCR catalysts. This work was supported by institutional funds provided to JSM from the Voiland School of Chemical Engineering and Bioengineering. Financial support was also provided by the National Science Foundation GOALI program under contract Nos. CBET-1258717, CBET-1258715 and CBET-1258690. We thank Prof. Fabio Ribeiro, Mr. Atish Parekh, Prof. W. F. Schneider, Mr. Christopher Paolucci, Mr. Trunjoyo Anggara and Prof. Jeff Miller for stimulating discussions on the modeling of the XANES spectrum and Ms. Alyssa Hensley for her comments on the manuscript. J.Sz. acknowledges the financial support of this work by the U.S. Department of Energy (DOE), Office of Energy Efficiency and Renewable Energy, Vehicle Technologies Program. A portion of the computer time for the computational work was performed using EMSL, a national scientific user facility sponsored by the Department of Energy’s Office of Biological and Environmental Research and located at PNNL. PNNL is a multi-program national laboratory operated for the US DOE by Battelle.

Zhang, Renqin↗

Metrics and Benchmarks for Quantum Processors: State of Play

A compelling narrative has taken hold as quantum computing explodes into the commercial sector: Quantum computing in 2018 is like classical computing in 1965. In 1965 Gordon Moore wrote his famous paper about integrated circuits, saying: "At present, [minimum cost] is reached when 50 components are used per circuit. But... the complexity for minimum component costs has increased at a rate of roughly a factor of two per year... by 1975, the number of components per integrated circuit for minimum cost will be 65,000." This narrative is both appealing (we want to believe that quantum computing will follow the incredibly successful path of classical computing!) and plausible (2018 saw IBM, Intel, and Google announce 50-qubit integrated chips). But it is also deeply misleading. Here is an alternative: Quantum computing in 2018 is like classical computing in 1938. In 1938, John Atanasoff and Clifford Berry built the very first electronic digital computer. It had no program, and was not Turing-complete. Vacuum tubes — the standard "bit" for 20 years — were still 5 years in the future. ENIAC and the achievement of "computational supremacy" (over hand calculation) wouldn't arrive for 8 years, despite the accelerative effect of WWII. Integrated circuits and the information age were more than 20 years away. Neither of these analogies is perfect. Quantum computing technology is more like 1938, while the level of funding and excitement suggest 1965 (or later!). But the point of the cautionary analogy to 1938 is simple: Quantum computing in 2018 is a research field. It is far too early to establish metrics or benchmarks for performance. The best role for neutral organizations like IEEE is to encourage and shape research into metrics and benchmarks, so as to be ready when they become necessary. This white paper presents the evidence and reasoning for this claim. We explain what it means to say that quantum computing is a "research field", and why metrics and benchmarks for quantum processors also constitute a research field. We discuss the potential for harmful consequences of prematurely establishing standards or frameworks. We conclude by suggesting specific actions that IEEE or similar organizations can take to accelerate the development of good metrics and benchmarks for quantum computing.

97 MATHEMATICS AND COMPUTING↗