Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “UPC”

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 109 records · Page 6

Global-Address Networking (GASNet-1) Library

GASNet is a language-independent, networking middleware layer that provides network-independent, high-performance communication primitives including Remote Memory Access (RMA) and Active Messages (AM). It has been used to implement parallel programming models and libraries such as UPC, Co-Array Fortran, Titanium, Legion, Chapel, and many others. The interface is primarily intended as a compilation target and for use by runtime library writers (as opposed to end users), and the primary goals are high performance, interface portability, and expressiveness. GASNet stands for "Global-Address Space Networking".

SciDAC↗

Global-Address Space Networking for Exascale

GASNet-EX is a portable, open-source, high-performance communication library designed to efficiently support the networking requirements of Partitioned Global Address Space (PGAS) runtime systems and other alternative models in future exascale machines. The library is an evolution of the popular GASNet communication system, building upon over 15 years of lessons learned. GASNet is a language-independent, networking middleware layer that provides network-independent, high-performance communication primitives including Remote Memory Access (RMA) and Active Messages (AM). It has been used to implement parallel programming models and libraries such as UPC, Co-Array Fortran, Titanium, Legion, Chapel, and many others. The interface is primarily intended as a compilation target and for use by runtime library writers (as opposed to end users), and the primary goals are high performance, interface portability, and expressiveness. GASNet stands for "Global-Address Space Networking".

ECP↗

BRAID

BRAID is a rewriting system for translating abstract intermediate descriptions into light-weight, "pay only for what you need" middleware wrappers. Initial capabilities will focus on language interoperability, remote method invocation (RMI), and interface contract enforcement wrappers from Scientific Interface Definition Language (SIDL) specifications. Language interoperability will be provided for software written in C, C++, Fortran, Java, and Python, as was done with Babel, but also a subset of PGAS/HPCS languages, such as Chapel, UPC, and X10. Interface contract enforcement wrappers will initially be supported in a subset of those languages.

Prantl, A.↗

ROSE

Developed at Lawrence Livermore National Laboratory (LLNL), ROSE is an open source compiler infrastructure to build source-to-source program transformation and analysis tools for large-scale C (C89 to C23), C++ (C++98 to C++23), UPC, Fortran (Fortran4, 66, 77, 95, 2003), OpenMP, Java, Python, and Binary applications. ROSE users range from experienced compiler researchers to library and tool developers who may have minimal compiler experience. ROSE is particularly well suited for building custom tools for static analysis, program optimization, arbitrary program transformation, domain-specific optimizations, complex loop optimizations, performance analysis, and cyber-security. ROSE is: A library (and set of associated tools) to quickly and easily apply compiler techniques to one's code in order to improve application performance and developer productivity. A research and development compiler infrastructure for for writing custom source-to-source translators to perform source code transformations, analysis, and optimizations. Is

Pinnow, NathanT [Lawrence Livermore National Labor↗

Impact parameter dependence of color charge correlations in the proton

The impact parameter dependence of color charge correlators in the proton is obtained from the light front formalism in light cone gauge. We include NLO corrections due to the |qqqg\rangle | q q q g ⟩ Fock state via light-cone perturbation theory. Near the center of the proton, the b b -dependence of the correlations is very different from a ``transverse profile function’’. The resulting t t -dependence of exclusive J/\Psi J / Ψ photoproduction transitions from exponential to power law at |t| \approx 1 | t | ≈ 1 ~GeV ^2 2 . This prediction could be tested at upcoming DIS facilities or in nucleus-proton ultraperipheral collisions (UPCs).

Dumitru, Adrian↗

Scalable fault tolerance runtime technology for petascale computers (Final Project Report)

With the massive number of components comprising the forthcoming petascale computer systems, hardware failures will be routinely encountered during execution of large-scale applications. Due to the multidisciplinary, multiresolution, and multiscale nature of scientific problems that drive the demand for high end systems, applications place increasingly differing demands on the system resources: disk, network, memory, and CPU. In addition to MPI, future applications are expected to use advanced programming models such as those developed under the DARPA HPCS program as well as existing global address space programming models such as Global Arrays, UPC, and Co-Array Fortran. While there has been a considerable amount of work in fault tolerant MPI with a number of strategies and extensions for fault tolerance proposed, virtually none of advanced models proposed for emerging petascale systems is currently fault aware. To achieve fault tolerance, development of underlying runtime and OS technologies able to scale to petascale level is needed. This project has evaluated range of runtime techniques for fault tolerance for advanced programming models.

97 MATHEMATICS AND COMPUTING↗

Final Report from The University of Texas at Austin for DEGAS: Dynamic Global Address Space programming environments

The Dynamic, Exascale Global Address Space programming environment (DEGAS) project will develop the next generation of programming models and runtime systems to meet the challenges of Exascale computing. Our approach is to provide an efficient and scalable programming model that can be adapted to application needs through the use of dynamic runtime features and domain-specific languages for computational kernels. We address the following technical challenges: Programmability: Rich set of programming constructs based on a Hierarchical Partitioned Global Address Space (HPGAS) model, demonstrated in UPC++. Scalability: Hierarchical locality control, lightweight communication (extended GASNet), and ef- ficient synchronization mechanisms (Phasers). Performance Portability: Just-in-time specialization (SEJITS) for generating hardware-specific code and scheduling libraries for domain-specific adaptive runtimes (Habanero). Energy Efficiency: Communication-optimal code generation to optimize energy efficiency by re- ducing data movement. Resilience: Containment Domains for flexible, domain-specific resilience, using state capture mechanisms and lightweight, asynchronous recovery mechanisms. Interoperability: Runtime and language interoperability with MPI and OpenMP to encourage broad adoption.

97 MATHEMATICS AND COMPUTING↗

The LLNL Program in Relativistic Heavy-Ion Physics: FY20 Annual Laboratory Continuation Progress Report

The LLNL Heavy-Ion Group has research interests in the features and phenomena of nuclear matter at extreme temperatures and densities. It pursues these interests through participation in two experimental collaborations (ATLAS and sPHENIX) and one joint theory/experiment topical collaboration (JETSCAPE). The group is funded through a combination of LDRD, DOE-SC NP and an award from US ATLAS Software and Computing Operations, which is ultimately funded through HEP. The group's activities in FY20 were oriented around beginning a new LDRD project and fi lling two open postdoc positions while contributing to the ATLAS jet and UPC programs as well as participating in sPHENIX. Both postdoc positions were lled, effectively doubling the side of the LLNL Heavy-Ion Group, by Qipeng Hu (starting 6/20) and Dhanush Hangal (starting 8/20).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DECOVALEX-2019 (Task D: INBEB Final Report)

The DECOVALEX Project is an on-going international research collaboration, established in 1992, to advance the understanding and modeling of coupled Thermal (T), Hydrological (H), Mechanical (M) and Chemical (C) processes in geological in geological systems. This document is the final report of Task D which was proposed by the DECOVALEX Project and coordinated by CIMNE_UPC, presenting the technical definitions of the problems studied, approaches applied, achievements made and outstanding issues for future research. Task D of the DECOVALEX 2019 project is devoted to the study of the hydro-mechanical (HM) and thermo-hydro-mechanical (THM) Interactions in Bentonite Engineered Barriers (INBEB). Special attention is paid to the evolution of barrier heterogeneity under transient conditions. A proper understanding of the processes occurring during the transient period requires the appropriate simulation of the behavior of the engineered barrier by means of coupled numerical analyses. In this context, the main objective of the Task is to assess the capabilities of numerical formulations and codes to simulate and interpret the HM and THM behavior of the bentonite barrier, with a particular focus on the final state reached on saturation.

58 GEOSCIENCES↗

Geologic controls on the West Antarctic Ice Sheet

The stability of the West Antarctic Ice Sheet is intertwined with its geologic history. The sub-ice geology and the possibility of active rifting and associated elevated heat-flux and volcanism might be determining factors in ice-sheet behavior. Seismic monitoring of natural events at the base of Ice Stream C reveals the presence of a young sedimentary basin beneath the ice stream. The sediments are presumed to be of glacio-marine origin, similar to those beneath Ice Stream B and in the Ross Sea. The young sediments are approximately 1/2 km thick at UpC camp, but thin abruptly southward to 100 m or less. We hypothesize the presence of a fault with a throw of 400 m to account for this (though we have not directly detected the fault), rather than invoking unrealistic basement dips. To extend these studies to critical inland regions, we suggest an expanded explosive-source seismic survey of the Byrd Subglacial Basin to determine the extent and character of the hypothesized rift basin. High-resolution seismic monitoring will detect layering in the sedimentary column, as well as possibly imaging faults directly.

Anandakrishnan, Sridhar↗

Unified Planetary Coordinates System: A Searchable Database of Geodetic Information

Over the past 40 years, an enormous quantity of orbital remote sensing data has been collected for Mars from many missions and instruments. Unfortunately these datasets currently exist in a wide range of disparate coordinate systems, making it extremely difficult for the scientific community to easily correlate, combine, and compare data from different Mars missions and instruments. As part of our work for the PDS Imaging Node and on behalf of the USGS Astrogeology Team, we are working to solve this problem and to provide the NASA scientific research community with easy access to Mars orbital data in a unified, consistent coordinate system along with a wide variety of other key geometric variables. The Unified Planetary Coordinates (UPC) system is comprised of two main elements: (1) a database containing Mars orbital remote sensing data computed using a uniform coordinate system, and (2) a process by which continual maintainance and updates to the contents of the database are performed.

Becker, K. J.a↗

Coarrars for Parallel Processing

The design of the Coarray feature of Fortran 2008 was guided by answering the question "What is the smallest change required to convert Fortran to a robust and efficient parallel language." Two fundamental issues that any parallel programming model must address are work distribution and data distribution. In order to coordinate work distribution and data distribution, methods for communication and synchronization must be provided. Although originally designed for Fortran, the Coarray paradigm has stimulated development in other languages. X10, Chapel, UPC, Titanium, and class libraries being developed for C++ have the same conceptual framework.

Fortran↗

A Single Thread to Fortran Coarray Transition Process for the Control Algorithm in the Space Radiation Code HZETRN

Exa-scale computing is the direction by industry and government are going to generate solutions to problems they deem necessary. Computing hardware is being developed to achieve the transition from Peta-scale to Exa-scale with more CPUs (Central Processing Units) that have more cores per CPU and more accelerators (GPGPUs (General Purpose Graphics Processing Units) and MICs (Many Integrated Cores)) per node. To fully utilize the hardware available now and in the future, algorithms must become multi-threaded. There are a few methods to generate multi-threaded software such as MPI (Message Passing Interface) and OpenMP (Multi-Processing) / OpenACC (ACCelerator). This paper concentrates on using Coarray Fortran to convert the Fortran 95 based HZETRN (High Z and Energy TRaNsport) code's control algorithm from a single threaded code to a multithreaded code. The resultant Coarray code was 32.5 times faster (with a theoretical speed-up of 74.5 times) than the single threaded version on the hardware tested, as reliable as the Fortran 95 version, and, as it uses native Fortran, was as maintainable as the Fortran 95 version. The Coarray code can be maintained by the same project engineers and scientists who created the original single threaded code. This transition process can be utilized on a C language based code with a compiler that has the UPC (Universal Parallel C) extensions to C.

Singleterry, Robert C., Jr.↗

An Automatic Light Rain Detection Algorithm on NASA MPLNET Lidar Observations in the Frame of WMO GALION Project

The water cycle strongly influences life on Earth. In particular, the precipitation modifies the atmospheric column thermodynamics through the process of evaporation and serves as a proxy for latent heat modulation. For this reason, a correct precipitation parameterization (especially low-intensity precipitation) at global scale, bedsides improving our understanding of the hydrological cycle, it is crucial to reduce the associated uncertainty of the global climate models to correctly forecast future scenarios, i.e. to apply fast mitigation strategies. In this study we developed an algorithm to automatically detect precipitation from lidar measurements obtained by the National and Aeronautics Space Administration (NASA) Micropulse lidar network (MPLNET) permanent observational site in Goddard. The algorithm, once full operational, will deliver in Near Real Time (latency 1.5h) a new rain mask product that will be publicly available on MPLNET website as part of the new Version 3 Level 1.5 data. The methodology, based on an image processing technique, can detect only light precipitation events (defined by intensity and duration) as the morphological filters used through the detection process are applied on the lidar volume depolarization ratio range corrected composite images, i.e. heavy rain events are unusable as the lidar signal is completely extinguished after few meters in the precipitation or no signal detected because of the water accumulated on the receiver optics. Results from the algorithm, besides filling a gap in precipitation and virga detection by radars, are of particular interest for the scientific community because will help to better understand long-term aerosol-cloud interactions and aerosol atmospheric removal (scavenging effect) by rain as multi-year database being available for several MPLNET permanent observational sites across the globe. Moreover, we developed the automatic algorithm at Universitat Politecnica de Catalunya (UPC) Barcelona, the unique permanent observation station member of MPLNET and the European Aerosol Lidar Network (EARLINET) In the future the algorithm can be then easily applied to any other lidar and/or ceilometer network infrastructure in the frame of World Meteorological Organization (WMO) Global Aerosol Watch (GAW) aerosol lidar observation network (GALION)

Simone Lolli↗

Operating Systems Support for Advanced Programming Languages

As machines grow in scale and complexity, techniques to make the most effective use of network, memory, and processor resources will also become increasingly important. Programming models that rely on one-sided communication or global address space support have demonstrated advantages for productivity and performance, but they are most effective when used with proper OS support. We propose to develop OS and runtime support for programming models like UPC, GA, Charm++, and HPCS languages, which rely on one-sided communication. Rather than a full OS model, we envision applications bundled with only the necessary OS functions linked in to the application in user space -- relying on the hypervisor for protaction, resource sharing, and mangagement of Quality of Service guarantees. Our services will include support for remote reads and writes to memory, along with remote active message handlers, which are essential for support of fast noncontiguous memory operations, atomic operations, and event-driven applications.

97 MATHEMATICS AND COMPUTING↗

Global Arrays Parallel Programming Toolkit

The two predominant classes of programming models for parallel computing are distributed memory and shared memory. Both shared memory and distributed memory models have advantages and shortcomings. Shared memory model is much easier to use but it ignores data locality/placement. Given the hierarchical nature of the memory subsystems in modern computers this characteristic can have a negative impact on performance and scalability. Careful code restructuring to increase data reuse and replacing fine grain load/stores with block access to shared data can address the problem and yield performance for shared memory that is competitive with message-passing. However, this performance comes at the cost of compromising the ease of use that the shared memory model advertises. Distributed memory models, such as message-passing or one-sided communication, offer performance and scalability but they are difficult to program. The Global Arrays toolkit attempts to offer the best features of both models. It implements a shared-memory programming model in which data locality is managed by the programmer. This management is achieved by calls to functions that transfer data between a global address space (a distributed array) and local storage. In this respect, the GA model has similarities to the distributed shared-memory models that provide an explicit acquire/release protocol. However, the GA model acknowledges that remote data is slower to access than local data and allows data locality to be specified by the programmer and hence managed. GA is related to the global address space languages such as UPC, Titanium, and, to a lesser extent, Co-Array Fortran. In addition, by providing a set of data-parallel operations, GA is also related to data-parallel languages such as HPF, ZPL, and Data Parallel C. However, the Global Array programming model is implemented as a library that works with most languages used for technical computing and does not rely on compiler technology for achieving parallel efficiency. It also supports a combination of task- and data-parallelism and is available as an extension of the message passing (MPI) model. The GA model exposes to the programmer the hierarchical memory of modern high-performance computer systems, and by recognizing the communication overhead for remote data transfer, it promotes data reuse and locality of reference. Virtually all the scalable architectures possess non-uniform memory access characteristics that reflect their multi-level memory hierarchies. These hierarchies typically comprise processor registers, multiple levels of cache, local memory, and remote memory. Over time, both the number of levels and the cost (in processor cycles) of accessing deeper levels has been increasing. It is important for any scalable programming model to address memory hierarchy since it is critical to the efficient execution of scalable applications.

ARMCI↗

Universal Common Communication Substrate (UCCS) Specification; Universal Common Communication Substrate (UCCS) Implementation

Universal Common Communication Substrate (UCCS) is a low-level communication substrate that exposes high-performance communication primitives, while providing network interoperability. It is intended to support multiple upper layer protocol (ULPs) or programming models including SHMEM,UPC,Titanium,Co-Array Fortran,Global Arrays,MPI,GASNet, and File I/O. it provides various communication operations including one-sided and two-sided point-to-point, collectives, and remote atomic operations. In addition to operations for ULPs, it provides an out-of-band communication channel required typically required to wire-up communication libraries.

Source record↗

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗