Search NASA⌕ Search

SEARCH · Search NASA

Results for “THREADED 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 307 records · Page 17

BSM Delta qualification 2, volume 1

This report, presented in three volumes, provides the results of a two-motor Delta Qualification 2 program conducted in 1993 to certify the following enhancements for incorporation into Booster Separation Motor (BSM) flight hardware: (1) vulcanized-in-place nozzle aft closure insulation; (2) new isostatic ATJ bulk graphite throat insert material; (3) adhesive EA 9394 for bonding the nozzle throat, igniter grain rod/centering insert/igniter case; (4) deletion of the igniter adapter insulator ring; (5) deletion of igniter adapter/igniter case interface RTV; and (6) deletion of Loctite from igniter retainer plate threads. The enhancements above directly resulted from (1) the BSM Total Quality Management (TQM) Team initiatives to enhance the BSM producibility, and (2) the necessity to qualify new throat insert and adhesive systems to replace existing materials that will not be available. Testing was completed at both the component and motor levels. Component testing was accomplished to screen candidate materials (e.g., throat materials, adhesive systems) and to optimize processes (e.g., aft closure insulator vulcanization approach) prior to their incorporation into the test motors. Motor testing - consisting of two motors, randomly selected by USBI's onsite quality personnel from production lot AAY, which were modified to accept the enhancements - were completed to provide the final qualification of the enhancements for incorporation into flight hardware. It is concluded that all of the enhancements herein tested are qualified to be incorporated into flight hardware for the BSM.

Source record↗

Multithreaded Model for Dynamic Load Balancing Parallel Adaptive PDE Computations

We present a multithreaded model for the dynamic load-balancing of numerical, adaptive computations required for the solution of Partial Differential Equations (PDE's) on multiprocessors. Multithreading is used as a means of exploring concurrency in the processor level in order to tolerate synchronization costs inherent to traditional (non-threaded) parallel adaptive PDE solvers. Our preliminary analysis for parallel, adaptive PDE solvers indicates that multithreading can be used an a mechanism to mask overheads required for the dynamic balancing of processor workloads with computations required for the actual numerical solution of the PDE's. Also, multithreading can simplify the implementation of dynamic load-balancing algorithms, a task that is very difficult for traditional data parallel adaptive PDE computations. Unfortunately, multithreading does not always simplify program complexity, often makes code re-usability not an easy task, and increases software complexity.

Chrisochoides, Nikos↗

Data-dependence Profiling to Enable Safe Thread Level Speculation

Data-dependence profling is a technique that enables a com- piler to judiciously decide when the execution of a loop | which the compiler could not prove to be dependence free | should be speculated through the use of Thread Level Spec- ulation (TLS). The data collected by a data-dependence pro- fler can be used to predict if may dependencies reported by a compiler static analysis are likely to materialize at runtime. A cost analysis can then be used to decide that some loops with a lower probability of dependence should be specula- tively parallelized. This paper addresses the question as to whether a loops' dependence behaviour changes when the in- put to the program changes | a study of 57 different bench- marks indicates that it usually does not change. Then the paper describes SpecEval, an automatic speculative paral- lelization framework that uses single-input data-dependence profles to find speculation candidates in the SPEC2006 and PolyBench/C benchmarks. This paper also presents a per- formance evaluation of TLS implementation in IBM's Blue- Gene/Q supercomputer and shows that the performance of TLS is affected by several factors, including the number of speculated loops, the execution-time coverage of speculated loops, the miss-speculation overhead, the L1 cache miss rate and the effect on dynamic instruction path length.

Bhattacharyya, Arnamoy↗

A morphology independent methodology for quantifying planview river change and characteristics from remotely sensed imagery

Remotely sensed imagery of rivers has long served as a means for characterizing channel properties and detection of planview change. In the last decade the dramatic increase in the availability of satellite imagery and processing tools has created the potential to greatly expand the spatial and temporal scale of our understanding of river morphology and dynamics. To date, the majority of GIS and automated analyses of planview changes in rivers from remotely sensed data has been developed for single-threaded meandering river systems. These methods have limited applicability to many of the earth's rivers with complex multi-channel planforms. Here we present the methodologies of a set of analysis algorithms collectively called Spatially Continuous Riverbank Erosion and Accretion Measurements (SCREAM). SCREAM analyzes planview river metrics regardless of river morphology. These algorithms quantify both the erosion and accretion rates of riverbanks from binary masks of channels generated from imagery acquired at two time periods. Additionally, the program quantifies the area of change between river channels and the surrounding floodplain and area of islands lost or formed between these two time periods. To examine variations in erosion rates in relation to local channel attributes and make rate comparisons between river systems of varying sizes, the program determines channel widths and bank curvature at every bank pixel. SCREAM was developed and tested on rivers with diverse and complex planform morphologies in imagery acquired from a range of observational platforms with varying spatial resolutions. Here, validation and verification of SCREAM-generated metrics against manual measurements show no significant measurement errors in determination of channel width, erosion, and bank aspects. SCREAM has the potential to provide data for both the quantitative examination of the controls on erosion rates and for the comparison of these rates across river systems ranging broadly in size and planform morphology.

47 OTHER INSTRUMENTATION↗

Effective Vectorization with OpenMP 4.5

This paper describes how the Single Instruction Multiple Data (SIMD) model and its extensions in OpenMP work, and how these are implemented in different compilers. Modern processors are highly parallel computational machines which often include multiple processors capable of executing several instructions in parallel. Understanding SIMD and executing instructions in parallel allows the processor to achieve higher performance without increasing the power required to run it. SIMD instructions can significantly reduce the runtime of code by executing a single operation on large groups of data. The SIMD model is so integral to the processor s potential performance that, if SIMD is not utilized, less than half of the processor is ever actually used. Unfortunately, using SIMD instructions is a challenge in higher level languages because most programming languages do not have a way to describe them. Most compilers are capable of vectorizing code by using the SIMD instructions, but there are many code features important for SIMD vectorization that the compiler cannot determine at compile time. OpenMP attempts to solve this by extending the C++/C and Fortran programming languages with compiler directives that express SIMD parallelism. OpenMP is used to pass hints to the compiler about the code to be executed in SIMD. This is a key resource for making optimized code, but it does not change whether or not the code can use SIMD operations. However, in many cases critical functions are limited by a poor understanding of how SIMD instructions are actually implemented, as SIMD can be implemented through vector instructions or simultaneous multi-threading (SMT). We have found that it is often the case that code cannot be vectorized, or is vectorized poorly, because the programmer does not have sufficient knowledge of how SIMD instructions work.

97 MATHEMATICS AND COMPUTING↗

The scheme machine: A case study in progress in design derivation at system levels

The Scheme Machine is one of several design projects of the Digital Design Derivation group at Indiana University. It differs from the other projects in its focus on issues of system design and its connection to surrounding research in programming language semantics, compiler construction, and programming methodology underway at Indiana and elsewhere. The genesis of the project dates to the early 1980's, when digital design derivation research branched from the surrounding research effort in programming languages. Both branches have continued to develop in parallel, with this particular project serving as a bridge. However, by 1990 there remained little real interaction between the branches and recently we have undertaken to reintegrate them. On the software side, researchers have refined a mathematically rigorous (but not mechanized) treatment starting with the fully abstract semantic definition of Scheme and resulting in an efficient implementation consisting of a compiler and virtual machine model, the latter typically realized with a general purpose microprocessor. The derivation includes a number of sophisticated factorizations and representations and is also deep example of the underlying engineering methodology. The hardware research has created a mechanized algebra supporting the tedious and massive transformations often seen at lower levels of design. This work has progressed to the point that large scale devices, such as processors, can be derived from first-order finite state machine specifications. This is roughly where the language oriented research stops; thus, together, the two efforts establish a thread from the highest levels of abstract specification to detailed digital implementation. The Scheme Machine project challenges hardware derivation research in several ways, although the individual components of the system are of a similar scale to those we have worked with before. The machine has a custom dual-ported memory to support garbage collection. It consists of four tightly coupled processes--processor, collector, allocator, memory--with a very non-trivial synchronization relationship. Finally, there are deep issues of representation for the run-time objects of a symbolic processing language. The research centers on verification through integrated formal reasoning systems, but is also involved with modeling and prototyping environments. Since the derivation algebra is basd on an executable modeling language, there is opportunity to incorporate design animation in the design process. We are looking for ways to move smoothly and incrementally from executable specifications into hardware realization. For example, we can run the garbage collector specification, a Scheme program, directly against the physical memory prototype, and similarly, the instruction processor model against the heap implementation.

Johnson, Steven D.↗

New Strategy for Exploration Technology Development: The Human Exploration and Development of Space (HEDS) Exploration/Commercialization Technology Initiative

In FY 2001, NASA will undertake a new research and technology program supporting the goals of human exploration: the Human Exploration and Development of Space (HEDS) Exploration/Commercialization Technology Initiative (HTCI). The HTCI represents a new strategic approach to exploration technology, in which an emphasis will be placed on identifying and developing technologies for systems and infrastructures that may be common among exploration and commercial development of space objectives. A family of preliminary strategic research and technology (R&T) road maps have been formulated that address "technology for human exploration and development of space (THREADS). These road maps frame and bound the likely content of the HTCL Notional technology themes for the initiative include: (1) space resources development, (2) space utilities and power, (3) habitation and bioastronautics, (4) space assembly, inspection and maintenance, (5) exploration and expeditions, and (6) space transportation. This paper will summarize the results of the THREADS road mapping process and describe the current status and content of the HTCI within that framework. The paper will highlight the space resources development theme within the Initiative and will summarize plans for the coming year.

Mankins, John C.↗

Compile-Time Library Call Detection Using CAASCADE and XALT

CAASCADE — Compiler-Assisted Application Source Code Analysis and DatabasE—is a tool that summarizes the use of parallel programming language features in application source code using compiler technology. This paper discusses the library detection capability within CAASCADE to find information about the usage of scientific libraries within the source code. The information that CAASCADE collects provides insights into the usage of library calls in an applications. CAASCADE can classify the APIs by scientific libraries (e.g. LAPACK, BLAS, FFTW, etc). It can also detect the context in which a library API is being invoked, for example within a serial or multi-threaded region. To collect this information, CAASCADE uses compiler plugins that summarize procedural information and uses Apache Spark to do inter-procedural analysis to reconstruct call chains. In addition to this, we also integrated CAASCADE to work with XALT to collect library information based on linkage and modules installed on a system.

Zhao, Jisheng↗

The Solar-Stellar Connection (NAG5-6124: SOHO Guest Investigator Program)

The following is a final report from the SOHO Guest Investigator program to use the SUMER far-UV spectrometer to obtain imaging spectroscopy in support of the goals of the so-called "solar-stellar connection." In particular, a major emphasis was utilization of the long-slit time-resolved maps of the solar surface in bright far-UV emission lines to deduce how particular aspects of the temporally and spatially averaged line profiles trace back to individual structural features of the magnetically disturbed outer atmosphere; to help interpret the unresolved line profiles from high quality stellar observations (say, with the Space Telescope Imaging Spectrograph). The researchers served two tours of duty in the SOHO Operations Center as SUMER planners, during which time we conducted an extensive series of observing programs. These can be divided into three general categories: surface mapping, translimb spectroscopy, and active region diagnostics. We have analyzed some of the large volumes of data to the point where we have presented them in poster papers, and in invited papers at national and international meetings. Listed below are the titles of the preliminary publications we have written, including brief abstracts to indicate the main results. (1) Chromospheric structure and Dynamics-- Observations -- The chromosphere is a highly structured dynamic 'layer' of the solar outer atmosphere. Here, not only are the effects of mechanical heating first evident (moving upward in altitude from the deep photosphere), but also the amount of nonradiative energy deposited is far greater than in the albeit much hotter overlying transition region and corona. Further, the chromosphere is by far the thickest zone of the solar atmosphere with respect to the pressure scale height. A major goal of stellar astrophysics is to understand how the chromosphere is heated and why it adopts its peculiar structure. A cursory examination of solar filtergrams and high-resolution movies demonstrates that much of the chromospheric "action" must be occurring on fine spatial scales and short times; particularly in the cell interior transient brightenings, but also in the longer-lived network fragments. That regime of investigation is far removed from what one usually associates with "synoptic" measurements. Nevertheless, synoptic observations of chromospheric indices, filtergrams, and globally-averaged profile parameters not only can provide important insight concerning the crucial role of the cycle-variable part of the solar magnetic field; but they also can forge a key link with analogous measurements of the stars, where often the phenomena can be significantly exaggerated from the solar case, but high spatial resolution reconnaissance is not even a remote possibility. In addition to discussing the synoptic aspects of chromospheric structure and dynamics, I summarized new insights into the general problem of the solar chromosphere that have been obtained recently with the SUMER far-ultraviolet spectrometer on SOHO. (2) CO and the Temperature Structure of the Solar Atmosphere -- The surface layers of the Sun provide a crucial boundary condition for many of the processes that occur in the deep interior. The stratification of the outer solar atmosphere once was thought to be well understood. However, studies of thermally sensitive molecular absorptions in the infrared revealed puzzling anomalies. Strong lines of the CO fundamental vibration-rotation bands near 5 microns showed very cool temperatures at the extreme limb, and remarkable off-limb emissions extending well into the supposedly hot chromosphere. The conflicting pictures of the photosphere/chromosphere interface, from the widely separated wavelength regimes, has raised suspicions that those "layers" of the atmosphere are much more inhomogeneous than previously suspected. One proposal is that the low chromosphere is dominated by cool gas, the "COmosphere," which is threaded by a network of persistent small-scale hot magnetic filaments and occasionally disrupted by localized acoustic disturbances. The COmosphere is capped by the merged fields of the network elements in the chromospheric "canopy." (3) Translimb Spectroscopy with SOHO/SUMER -- We have used SUMER to obtain deep exposures of the 1300-1400 A spectrum, at the extreme limb and off-limb. Previous "translimb" studies in the thermal infrared had revealed remarkable extensions of cold material (T is approximately equal to 3000 K)-traced by carbon monoxide emission lines-into the heart of the hot chromosphere. A main objective of our program was to search for corresponding far-UV signatures of the "thermally-bifurcated" low chromosphere; for example, radiatively fluoresced emissions of the CO A-X 4th-positive system (collisional excitation would be negligible in cold gas). We conducted two separate observing programs with SUMER. Both made use of the 1 inch-diameter circular aperture, translated across the limb in the minimum motor step increments of 0."375, along the central meridian in the Northern polar coronal hole. The first program executed for nine hours beginning 19UT 25 Oct 1996. The full wavelength range was 1340-1400 A. It was recorded in two overlapping segments, placing key regions of the spectrum alternately on the KBr and bare parts of the detector, to help isolate 2nd-order features. Each segment was integrated for 500 s, and 32 pairs were obtained to span a 12" swath centered on the optical limb. The second program was conducted 00-09UT 01 Dec 1996. It consisted of a single wavelength setting (1300-1340 A) with exposure time 500 s, but twice the spatial coverage of the earlier series: 64 steps, for a total displacement of 24". The strong chromospheric resonance lines of atomic oxygen (1302-1305 A) and ionized carbon (1334-1335 A) were observed on the bare part of the MCP camera.

Ayres, Thomas R.↗

RDataFrame: Easy Parallel ROOT Analysis at 100 Threads

The Physics programmes of LHC Run III and HL-LHC challenge the HEP community. The volume of data to be handled is unprecedented at every step of the data processing chain: analysis is no exception. Physicists must be provided with first-class analysis tools which are easy to use, exploit bleeding edge hardware technologies and allow to seamlessly express parallelism. This document discusses the declarative analysis engine of ROOT, RDataFrame, and gives details about how it allows to profitably exploit commodity hardware as well as high-end servers and manycore accelerators thanks to the synergy with the existing parallelised ROOT components. Real-life analyses of LHC experiments’ data expressed in terms of RDataFrame are presented, highlighting the programming model provided to express them in a concise and powerful way. The recent developments which make RDataFrame a lightweight data processing framework are described, such as callbacks and I/O capabilities. Finally, the flexibility of RDataFrame and its ability to read data formats other than ROOT’s are characterised, as an example it is discussed how RDataFrame can directly read and analyse LHCb’s raw data format MDF.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

High-rate, Low-cost Process for High-Efficiency Flexible c-Si PV

The film c-Si based photovoltaics on RABiTS substrates would be capable of achieving efficiency above 15%, but at costs comparable to thin films. Utilizing a uniquely-textured and flexible metal substrate developed at the superconducting materials program at ORNL, coupled to an NREL breakthrough in hotwire chemical vapor deposition (HWCVD) processes, silicon heteroepitaxy is for the first time being directly-deposited out of silane gas, into a silicon structure that is less than 5 microns thick, crystallographically-oriented, and large-grained – ideal for solar PV power generation. We have recently overcome the problem of Ni and Cu diffusion into Si forming NiSi/CuSi towers through buffer development. Due to the lattice mismatch between the oxide cap layer and Si, recombination-active threading dislocation defects form in the silicon layer. We can lattice match the buffer with silicon by alloying with germanium, which can subsequently be graded out for the actual device layer. The main goal of this project is to develop a physical vapor deposition process for the growth Silicon, Germanium, or Silicon-Germanium alloy films.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A new portable random number generator wrapper library

Random number generator is an important component of many scientific projects. Many projects are written using programming models (like OpenMP and SYCL) to target different architectures. However, some programming models do not provide a random number generator. In this work, we introduce our random number generator wrapper. It is a header-only library that supports three distributions of random numbers: uniform, normal, and poisson. On the GPU backend, it wraps the cuRAND and rocRAND library, and supports various random number engines. It also wraps random123, a counterbased random number generator, on both CPU and GPU. With this library, we can generate random numbers with a few lines of code and target both GPU and multi-thread CPU with the same code. We also investigate the performance and scalability of this wrapper on different architectures with different engines and the number of cores.

97 MATHEMATICS AND COMPUTING↗

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

Thirumalainambi, Rajkumar↗

Lightweight and Statistical Techniques for Petascale Debugging: Correctness on Petascale Systems (CoPS) Preliminry Report

Petascale platforms with O(10{sup 5}) and O(10{sup 6}) processing cores are driving advancements in a wide range of scientific disciplines. These large systems create unprecedented application development challenges. Scalable correctness tools are critical to shorten the time-to-solution on these systems. Currently, many DOE application developers use primitive manual debugging based on printf or traditional debuggers such as TotalView or DDT. This paradigm breaks down beyond a few thousand cores, yet bugs often arise above that scale. Programmers must reproduce problems in smaller runs to analyze them with traditional tools, or else perform repeated runs at scale using only primitive techniques. Even when traditional tools run at scale, the approach wastes substantial effort and computation cycles. Continued scientific progress demands new paradigms for debugging large-scale applications. The Correctness on Petascale Systems (CoPS) project is developing a revolutionary debugging scheme that will reduce the debugging problem to a scale that human developers can comprehend. The scheme can provide precise diagnoses of the root causes of failure, including suggestions of the location and the type of errors down to the level of code regions or even a single execution point. Our fundamentally new strategy combines and expands three relatively new complementary debugging approaches. The Stack Trace Analysis Tool (STAT), a 2011 R&D 100 Award Winner, identifies behavior equivalence classes in MPI jobs and highlights behavior when elements of the class demonstrate divergent behavior, often the first indicator of an error. The Cooperative Bug Isolation (CBI) project has developed statistical techniques for isolating programming errors in widely deployed code that we will adapt to large-scale parallel applications. Finally, we are developing a new approach to parallelizing expensive correctness analyses, such as analysis of memory usage in the Memgrind tool. In the first two years of the project, we have successfully extended STAT to determine the relative progress of different MPI processes. We have shown that the STAT, which is now included in the debugging tools distributed by Cray with their large-scale systems, substantially reduces the scale at which traditional debugging techniques are applied. We have extended CBI to large-scale systems and developed new compiler based analyses that reduce its instrumentation overhead. Our results demonstrate that CBI can identify the source of errors in large-scale applications. Finally, we have developed MPIecho, a new technique that will reduce the time required to perform key correctness analyses, such as the detection of writes to unallocated memory. Overall, our research results are the foundations for new debugging paradigms that will improve application scientist productivity by reducing the time to determine which package or module contains the root cause of a problem that arises at all scales of our high end systems. While we have made substantial progress in the first two years of CoPS research, significant work remains. While STAT provides scalable debugging assistance for incorrect application runs, we could apply its techniques to assertions in order to observe deviations from expected behavior. Further, we must continue to refine STAT's techniques to represent behavioral equivalence classes efficiently as we expect systems with millions of threads in the next year. We are exploring new CBI techniques that can assess the likelihood that execution deviations from past behavior are the source of erroneous execution. Finally, we must develop usable correctness analyses that apply the MPIecho parallelization strategy in order to locate coding errors. We expect to make substantial progress on these directions in the next year but anticipate that significant work will remain to provide usable, scalable debugging paradigms.

97 MATHEMATICS AND COMPUTING↗

Using Mach threads to control DSN operational sequences

The Link Monitor and Control Operator Assistant prototype (LMCOA) is a state-of-the-art, semiautomated monitor and control system based on an object-oriented design. The purpose of the LMCOA prototyping effort is to both investigate new technology (such as artificial intelligence) to support automation and to evaluate advances in information systems toward developing systems that take advantage of the technology. The emergence of object-oriented design methodology has enabled a major change in how software is designed and developed. This paper describes how the object-oriented approach was used to design and implement the LMCOA and the results of operational testing. The LMCOA is implemented on a NeXT workstation using the Mach operating system and the Objective-C programming language.

Urista, Juan↗

Performance Portability of the Aeras Atmosphere Model to Next Generation Architectures using Kokkos

The subject of this report is the performance portability of the Aeras global atmosphere dynamical core (implemented within the Albany multi-physics code) to new and emerging architecture machines using the Kokkos library and programming model. We describe the process of refactoring the finite element assembly process for the 3D hydrostatic model in Aeras and highlight common issues associated with development on GPU architectures. After giving detailed build and execute instructions for Aeras with MPI, OpenMP and CUDA on the Shannon cluster at Sandia National Laboratories and the Titan supercomputer at Oak Ridge National Laboratory, we evaluate the per- formance of the code on a canonical test case known as the baroclinic instability problem. We show a speedup of up to 4 times on 8 OpenMP threads, but we were unable to achieve a speedup on the GPU due to memory constraints. We conclude by providing methods for improving the performance of the code for future optimization.

97 MATHEMATICS AND COMPUTING↗

XPRESS: eXascale PRogramming Environment and System Software, Final Report

The University of Oregon (UO) was a partner in the XPRESS project together with Sandia National Laboratories (SNL), Indiana University (IU), Lawrence Berkeley National Laboratory (LBL), Louisiana State University (LSU), Oak Ridge National Laboratory (ORNL), University of Houston (UH), and University of North Carolina (RENCI). UO's objective in the project was to develop "APEX (Asynchronous Performance Environment for eXascale)": performance measurement, analysis, feedback and control infrastructure to asynchronous tasking runtimes, specifically HPX (LSU) and HPX-5 (IU). During the project period, our efforts focused on the need to measure complex tasking models where the traditional instrumentation methods would not work due to an absent/meaningless call-path context and runtime control of task pre-emption and resumption, usually on a different operating system thread. In addition to the challenges of performance measurement, we developed a framework to provide information from all levels of the stack (hardware, operating system, runtime, application) to a feedback & control mechanism for controlling concurrency, task granularity, networking parameters, and other aspects of execution in order to improve execution performance, throughput and/or efficiency. UO demonstrated these developments on leading edge HPC machines at large scale, including a 2017 Gordon Bell submission in which APEX was used to optimize key bottlenecks in an astrophysics application. The following final report summarizes our accomplishments during the XPRESS project.

99 GENERAL AND MISCELLANEOUS↗

INTEGRATION OF PANDA WORKLOAD MANAGEMENT SYSTEM WITH SUPERCOMPUTERS

Abstract The Large Hadron Collider (LHC), operating at the international CERN Laboratory in Geneva, Switzerland, is leading Big Data driven scientific explorations. Experiments at the LHC explore the funda- mental nature of matter and the basic forces that shape our universe, and were recently credited for the dis- covery of a Higgs boson. ATLAS, one of the largest collaborations ever assembled in the sciences, is at the forefront of research at the LHC. To address an unprecedented multi-petabyte data processing challenge, the ATLAS experiment is relying on a heterogeneous distributed computational infrastructure. The ATLAS experiment uses PanDA (Production and Data Analysis) Workload Management System for managing the workflow for all data processing on over 140 data centers. Through PanDA, ATLAS physicists see a single computing facility that enables rapid scientific breakthroughs for the experiment, even though the data cen- ters are physically scattered all over the world. While PanDA currently uses more than 250000 cores with a peak performance of 0.3+ petaFLOPS, next LHC data taking runs will require more resources than Grid computing can possibly provide. To alleviate these challenges, LHC experiments are engaged in an ambitious program to expand the current computing model to include additional resources such as the opportunistic use of supercomputers. We will describe a project aimed at integration of PanDA WMS with supercomputers in United States, Europe and Russia (in particular with Titan supercomputer at Oak Ridge Leadership Com- puting Facility (OLCF), Supercomputer at the National Research Center Kurchatov Institute , IT4 in Ostrava, and others). The current approach utilizes a modified PanDA pilot framework for job submission to the supercomputers batch queues and local data management, with light-weight MPI wrappers to run single- threaded workloads in parallel on Titan s multi-core worker nodes. This implementation was tested with a variety of Monte-Carlo workloads on several supercomputing platforms. We will present our current accom- plishments in running PanDA WMS at supercomputers and demonstrate our ability to use PanDA as a portal independent of the computing facility s infrastructure for High Energy and Nuclear Physics, as well as other data-intensive science applications, such as bioinformatics and astro-particle physics.

De, K↗