Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “CODE SHARING”

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 685 records · Page 38

JACC.shared: Leveraging HPC Metaprogramming and Performance Portability for Computations That Use Shared Memory GPUs

In this work, we present JACC.shared, a new feature of Julia for ACCelerators (JACC), which is the performanceportable and metaprogramming model of the just-in-time and LLVM-based Julia language. This new feature allows JACC applications to leverage the high-performance computing (HPC) capabilities of high-bandwidth, on-chip GPU memory. Historically, exploiting high-bandwidth, shared-memory GPUs has not been a priority for high-level programming solutions. JACC.shared covers that gap for the first time, thereby providing a highlevel, portable, and easy-to-use solution for programmers to exploit this memory and supporting all current major accelerator architectures. Well-known HPC and AI workloads, such as multi/hyperspectral imaging and AI convolutions, have been used to evaluate JACC.shared on two exascale GPU architectures hosted by some of the most powerful US Department of Energy supercomputers: Perlmutter (NVIDIA A100) and Frontier (AMD MI250X). The performance evaluation reports speedup of up to 3.5× by adding only one line of code to the base codes, thus providing important accelerators in a simple, portable, and transparent way and elevating the programming productivity and performance-portability capabilities for Julia/JACC HPC, AI, and scientific applications.

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗

Genome-wide identification of circRNAs involved in tomato fruit coloration

Highlights: • In total, 3796 circRNAs were identified in tomato fruits. • Expression levels of circRNAs differed between fruit samples. • The parental genes of the circRNAs played roles in fruit coloration and ripening. Circular RNAs (circRNAs) are an emerging class of non-coding RNAs in plants. Our aim is to identify the circRNAs with different expression levels between tomato fruits from two cultivars (‘Jinling Fenyu’ and ‘Jinling Moyu’) at two different developmental stages. Following high-throughput sequencing, 3796 circRNAs were identified, and 243 circRNAs were shared in the four samples. As compared with the fruit at mature green stage, the expression levels of 273 and 89 circRNAs were significantly altered in the fruit at turning stage from ‘Jinling Fenyu’ and ‘Jinling Moyu’, respectively. Moreover, the parental genes of the circRNAs with significantly different expression level were mainly involved in metabolic, cellular and single-organism process and played roles in catalytic activity and binding based on GO (Gene Ontology) analysis. The results suggested that circRNAs were widespread in tomato and were generated from different chromosomes and diverse genomic regions. Some circRNAs were specific in tomato fruits at different developmental stages, which enriches the number of circRNAs in plants involved in fruit coloration and ripening. This study provides the first genome-wide profile of circRNAs involved in tomato fruit coloration and lays a foundation for studying the potential biological functions of circRNAs involved in fruit ripening.

60 APPLIED LIFE SCIENCES↗

Recommendations for Minimum Required Diagnostics Information for Electric Vehicle Charging Infrastructure

The rapid growth of electrified transportation, including light- and medium-duty electric vehicles (EVs) as a mobility solution requires a reliable EV charging infrastructure. To advance charging reliability, the ChargeX Consortium reports “Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure” and “Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure” have provided recommendations for a set of minimum required error codes (MRECs), their functional and responsibility classifications, and a guide for their implementation using OCPP versions 1.6J and 2.0.1. These reports outline a recommended practice for consistent error reporting and interpretation, which is essential for communicating issues uniformly across the complex and diverse EV charging ecosystem. However, MRECs are just one part of diagnosing issues, another critical part is obtaining enough information about the current state and performance of the various charging components to identify root causes for each of the error codes. This additional diagnostics data can be used by technicians or automated systems to understand the context around an issue, allowing for timely resolution, decreased maintenance costs, and increased charging reliability. During everyday operations, data is regularly collected and analyzed across the ecosystem. Although sharing of all that available data would be great for diagnostics, concerns on data ownership, privacy, and OEM intellectual property pose a challenge. To overcome this obstacle, this report proposes a set of Minimum Required Diagnostic Information (MRDI) and recommends that the industry implement these uniformly across the North American EV charging ecosystem. MRDI provides a means to exchange only data deemed necessary for root cause determination.

32 - ENERGY CONSERVATION, CONSUMPTION, AND UTILIZA↗

A transient FETI methodology for large-scale parallel implicit computations in structural mechanics, part 2

Explicit codes are often used to simulate the nonlinear dynamics of large-scale structural systems, even for low frequency response, because the storage and CPU requirements entailed by the repeated factorizations traditionally found in implicit codes rapidly overwhelm the available computing resources. With the advent of parallel processing, this trend is accelerating because explicit schemes are also easier to parallellize than implicit ones. However, the time step restriction imposed by the Courant stability condition on all explicit schemes cannot yet and perhaps will never be offset by the speed of parallel hardware. Therefore, it is essential to develop efficient and robust alternatives to direct methods that are also amenable to massively parallel processing because implicit codes using unconditionally stable time-integration algorithms are computationally more efficient than explicit codes when simulating low-frequency dynamics. Here we present a domain decomposition method for implicit schemes that requires significantly less storage than factorization algorithms, that is several times faster than other popular direct and iterative methods, that can be easily implemented on both shared and local memory parallel processors, and that is both computationally and communication-wise efficient. The proposed transient domain decomposition method is an extension of the method of Finite Element Tearing and Interconnecting (FETI) developed by Farhat and Roux for the solution of static problems. Serial and parallel performance results on the CRAY Y-MP/8 and the iPSC-860/128 systems are reported and analyzed for realistic structural dynamics problems. These results establish the superiority of the FETI method over both the serial/parallel conjugate gradient algorithm with diagonal scaling and the serial/parallel direct method, and contrast the computational power of the iPSC-860/128 parallel processor with that of the CRAY Y-MP/8 system.

Farhat, Charbel↗

Hierarchical resilience with lightweight threads.

This paper proposes methodology for providing robustness and resilience for a highly threaded distributed- and shared-memory environment based on well-defined inputs and outputs to lightweight tasks. These inputs and outputs form a failure 'barrier', allowing tasks to be restarted or duplicated as necessary. These barriers must be expanded based on task behavior, such as communication between tasks, but do not prohibit any given behavior. One of the trends in high-performance computing codes seems to be a trend toward self-contained functions that mimic functional programming. Software designers are trending toward a model of software design where their core functions are specified in side-effect free or low-side-effect ways, wherein the inputs and outputs of the functions are well-defined. This provides the ability to copy the inputs to wherever they need to be - whether that's the other side of the PCI bus or the other side of the network - do work on that input using local memory, and then copy the outputs back (as needed). This design pattern is popular among new distributed threading environment designs. Such designs include the Barcelona STARS system, distributed OpenMP systems, the Habanero-C and Habanero-Java systems from Vivek Sarkar at Rice University, the HPX/ParalleX model from LSU, as well as our own Scalable Parallel Runtime effort (SPR) and the Trilinos stateless kernels. This design pattern is also shared by CUDA and several OpenMP extensions for GPU-type accelerators (e.g. the PGI OpenMP extensions).

43 PARTICLE ACCELERATORS↗

CONRAD—A software framework for cone-beam imaging in radiology

Purpose: In the community of x-ray imaging, there is a multitude of tools and applications that are used in scientific practice. Many of these tools are proprietary and can only be used within a certain lab. Often the same algorithm is implemented multiple times by different groups in order to enable comparison. In an effort to tackle this problem, the authors created CONRAD, a software framework that provides many of the tools that are required to simulate basic processes in x-ray imaging and perform image reconstruction with consideration of nonlinear physical effects.Methods: CONRAD is a Java-based state-of-the-art software platform with extensive documentation. It is based on platform-independent technologies. Special libraries offer access to hardware acceleration such as OpenCL. There is an easy-to-use interface for parallel processing. The software package includes different simulation tools that are able to generate up to 4D projection and volume data and respective vector motion fields. Well known reconstruction algorithms such as FBP, DBP, and ART are included. All algorithms in the package are referenced to a scientific source.Results: A total of 13 different phantoms and 30 processing steps have already been integrated into the platform at the time of writing. The platform comprises 74.000 nonblank lines of code out of which 19% are used for documentation. The software package is available for download at http://conrad.stanford.edu. To demonstrate the use of the package, the authors reconstructed images from two different scanners, a table top system and a clinical C-arm system. Runtimes were evaluated using the RabbitCT platform and demonstrate state-of-the-art runtimes with 2.5 s for the 256 problem size and 12.4 s for the 512 problem size.Conclusions: As a common software framework, CONRAD enables the medical physics community to share algorithms and develop new ideas. In particular this offers new opportunities for scientific collaboration and quantitative performance comparison between the methods of different groups.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Operational Energy Life Cycle Data Development for the National Institute of Standards And Technology (NIST) Building Industry Reporting and Design for Sustainability (BIRDS) Neutral Environmental Software Tool (NEST)

For this analysis, regionalized life cycle assessment (LCA) results for environmental impacts (using the Tool for Reduction and Assessment of Chemicals and Other Environmental Impacts [TRACI] 2.1) and cumulative energy demand (using the Federal Life Cycle Analysis Commons Elementary Flow List [FEDEFL] Inventory Methods v1.0.0) were evaluated for the production and utilization of electricity, natural gas, fuel oil, and propane as commodities within residential and commercial buildings. These results can used as a framework for future research into net zero, high-performance buildings, such as done here for the Building Industry Reporting and Design for Sustainability (BIRDS) database by the National Institute of Standards and Technology (NIST) Engineering Laboratory. The geographical results were assigned to each United States (U.S.) Zone Improvement Plan (ZIP) code based on the ZIP code location and corresponding Balancing Authority Area, natural gas basin, and Petroleum Administration for Defense Districts (PADDs). Additionally, previously developed models were utilized to develop future life cycle profiles. Projections were based on data available from the U.S. Energy Information Administration Annual Energy Outlook 2022 through 2050 (AEO 2022). Electricity LCA models were updated based on AEO 2022 projected annual generation mixes, while the natural gas baseline model was updated based on projected shares of natural gas types (conventional, shale, tight, and coalbed methane). Projections of crude oil production rates and export rates were applied to the petroleum baseline model in five-year increments to investigate their effects on the life cycle profile of fuel oil and propane. While only 100-year Global Warming Potential (GWP-100) with climate carbon feedback (CC-FB) and Cumulative Energy Demand are shown in Section 4: Results, the complete results, including Acidification Potential, Eutrophication Potential, Freshwater Ecotoxicity Potential, GWP-100 without inclusion of CC-FB, Human Health Impacts Potentials (Cancer, Non-Cancer), Ozone Depletion Potential, Particulate Matter Formation Potential, and Photochemical Smog Formation Potential, are tabulated for each ZIP code in the Excel worksheets that accompany this analysis. For the Excel spreadsheet tools associated with this report, please go to https://www.netl.doe.gov/energy-analysis/details?id=f8890fac-be55-44ac-aaa9-e2888bfabe93

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Inventory of Composable Elements (ICE) v6.0.0

The Inventory of Composable Elements (ICE) is an open source registry software platform for managing information about biological parts. It is capable of recording information about plasmids, microbial host strains and seeds, as well as DNA parts. Includes features such as DNA sequence visualization, editing and annotation, auto-aligning sequencing trace files against reference templates, SBOL XML/RDF support, and web-of-registries functionality. The web of registries functionality provides strong support for distributed interconnected use and enables sharing and transfer of biological parts across various independent ICE instances. ICE adopts modern software development principles, leveraging component-base frameworks, offering a REST API for convenient third-party integration and emphasizing scalability, security, and service integrations for dynamic content availability. The source code is hosted at https://github.com/JBEI/ice. A public instance is available at public-registry.jbei.org, where users can try out features, upload parts or simply use it for their projects.

Plahar, Hector↗

Distributed scheduling with COMPASS

COMPASS (COMPuter Aided Scheduling System) is a sophisticated, interactive scheduling tool used within NASA. Like most existing tools, however, COMPASS is a single-user application. There is a large class of scheduling problems which may be better solved by allowing several people at various locations to build separate schedules with shared resources. DISCORS (DIStributed COmputer Resource Scheduling) is a set of services which support a distributed version of COMPASS. This architecture naturally accommodates the integration of user-defined resource models without modifying COMPASS. DISCORS services include the ability to establish and manage communications, to code messages in efficient formats, to provide fault detection and recovery, and to configure schedulers across a network. In its present form, DISCORS effectively supports distributed COMPASS, but fails to run fast and to guarantee efficient schedules. Further enhancements may allow several users to simultaneously and interactively work together to create complex schedules while COMPASS detects and coordinates the resolution of conflicting requests.

Rufat-Latre, Jorge↗

MPI, HPF or OpenMP: A Study with the NAS Benchmarks

Porting applications to new high performance parallel and distributed platforms is a challenging task. Writing parallel code by hand is time consuming and costly, but this task can be simplified by high level languages and would even better be automated by parallelizing tools and compilers. The definition of HPF (High Performance Fortran, based on data parallel model) and OpenMP (based on shared memory parallel model) standards has offered great opportunity in this respect. Both provide simple and clear interfaces to language like FORTRAN and simplify many tedious tasks encountered in writing message passing programs. In our study, we implemented the parallel versions of the NAS Benchmarks with HPF and OpenMP directives. Comparison of their performance with the MPI implementation and pros and cons of different approaches will be discussed along with experience of using computer-aided tools to help parallelize these benchmarks. Based on the study, potentials of applying some of the techniques to realistic aerospace applications will be presented.

Jin, H.↗

MPI, HPF or OpenMP: A Study with the NAS Benchmarks

Porting applications to new high performance parallel and distributed platforms is a challenging task. Writing parallel code by hand is time consuming and costly, but the task can be simplified by high level languages and would even better be automated by parallelizing tools and compilers. The definition of HPF (High Performance Fortran, based on data parallel model) and OpenMP (based on shared memory parallel model) standards has offered great opportunity in this respect. Both provide simple and clear interfaces to language like FORTRAN and simplify many tedious tasks encountered in writing message passing programs. In our study we implemented the parallel versions of the NAS Benchmarks with HPF and OpenMP directives. Comparison of their performance with the MPI implementation and pros and cons of different approaches will be discussed along with experience of using computer-aided tools to help parallelize these benchmarks. Based on the study,potentials of applying some of the techniques to realistic aerospace applications will be presented

Jin, Hao-Qiang↗

General Mission Analysis Tool (GMAT)

The General Mission Analysis Tool (GMAT) is a space trajectory optimization and mission analysis system developed by NASA and private industry in the spirit of the NASA Mission. GMAT contains new technology and is a testbed for future technology development. The goal of the GMAT project is to develop new space trajectory optimization and mission design technology by working inclusively with ordinary people, universities, businesses, and other government organizations, and to share that technology in an open and unhindered way. GMAT is a free and open source software system licensed under the NASA Open Source Agreement: free for anyone to use in development of new mission concepts or to improve current missions, freely available in source code form for enhancement or further technology development.

Hughes, Steven P.↗

Multi-Block Enhancement for Lagrangian Dendritic Mesh setup in Altair5

Initial mesh setup for an ASC mUlti-physics code at LANL is done using Altair5. Altair5 assumes that the final mesh is composed of logical structured mesh blocks linked together at mesh boundaries to form, ultimately, an unstructured mesh. Within these blocks, meshes may have dendrites, that is, local regions where two zones share common edges (in two-dimensions, or faces in three-dimensions) with a single zone. In many cases, contiguous subsets of the initial set of blocks may have the same material assigned to them, but without smoothing the mesh would form a computationally challenging initial mesh. Some of these blocks may also have zones with nodes on domain boundaries. This paper reports on the implementation of multiblock smoothing in Altair5, which allows for dendrites and for moving boundary nodes. Dendritic nodes are constrained to be located at the average of their neighbor nodes while boundary nodes are constrained to move along the boundary geometry. Two fundamentally different smoothing methods were implemented. First, a variational principle is presented that balances zonal size and distortion via a user selected weighting with constraints imposed using penalty methods for dendritic nodes and Lagrange multipliers for boundary nodes. Second, the Laplace-Beltrami smoother is presented. This is a general elliptic smoother which can easily be modified to give Laplacian and Winslow-Crowley mesh smoothing. Results are shown for several test meshes of interest.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Using the Global Arrays Toolkit to Reimplement NumPy for Distributed Computation

Global Arrays (GA) is a software system from Pacific Northwest National Laboratory that enables an efficient, portable, and parallel shared memory programming interface to manipulate distributed defense arrays. Using a combination of GA and NumPy, we have reimplemented NumPy as a distributed drop-in replacement called Global Arrays in NumPy (GAiN). Scalability studies will be presented showing the utility of developing serial NumPy codes which can later run on more capable clusters or supercomputers.

Global Arrays↗

Improving five-year survival prediction via multitask learning across HPV-related cancers

Oncology is a highly siloed field of research in which sub-disciplinary specialization has limited the amount of information shared between researchers of distinct cancer types. This can be attributed to legitimate differences in the physiology and carcinogenesis of cancers affecting distinct anatomical sites. However, underlying processes that are shared across seemingly disparate cancers probably affect prognosis. The objective of the current study is to investigate whether multitask learning improves 5-year survival cancer patient survival prediction by leveraging information across anatomically distinct HPV related cancers. Furthermore, data were obtained from the Surveillance, Epidemiology, and End Results (SEER) program database. The study cohort consisted of 29,768 primary cancer cases diagnosed in the United States between 2004 and 2015. Ten different cancer diagnoses were selected, all with a known association with HPV risk. In the analysis, the cancer diagnoses were categorized into three distinct topography groups of varying specificity. The most specific topography grouping consisted of 10 original cancer diagnoses differentiated by the first two digits of the ICD-O-3 topography code. The second topography grouping consisted of cancer diagnoses categorized into six distinct organ groups. Finally, the third topography grouping consisted of just two groups, head-neck cancers and ano-genital cancers. The tasks were to predict 5-year survival for patients within the different topography groups using 14 predictive features which were selected among descriptive variables available in the SEER database. The information from the predictive features was shared between tasks in three different ways, resulting in three distinct predictive models: 1) Information was not shared between patients assigned to different tasks (single task learning); 2) Information was shared between all patients, regardless of task (pooled model); 3) Only relevant information was shared between patients grouped to different tasks (multitask learning). Prediction performance was evaluated with Brier scores. All three models were evaluated against one another on each of the three distinct topography-defined tasks. The results showed that multitask classifiers achieved relative improvement for the majority of the scenarios studied compared to single task learning and pooled baseline methods. In this study, we have demonstrated that sharing information among anatomically distinct cancer types can lead to improved predictive survival models.

59 BASIC BIOLOGICAL SCIENCES↗

Crystal structure of an eIF4G-like protein from Danio rerio

The gene LOC 91917 Danio rerio (zebrafish) encodes a protein annotated in the UniProt knowledgebase as the middle domain of eukaryotic initiation factor 4G domain containing protein b (MIF4Gdb). Its molecular weight is 25.8 kDa, and it comprises 222 amino acid residues. BLAST searches revealed homologues of D. rerio MIF4Gdb in many eukaryotes including humans. The homologue sand MIF4Gdb were identified as members of the Pfam family, MIF4G (PF2854), which is named after the middle domain of eukaryotic initiation factor 4G (eIF4G). eIF4G is a component of eukaryotic translational initiation complex, and contains binding sites for other initiation factors, suggesting its critical role in translational initiation. The MIF4G domain also occurs in several other proteins involved in RNA metabolism, including the Nonsense-mediated mRNA decay 2 protein (NMD2/UPF2), and the nuclear cap-binding protein 80-kDa subunit (CBP80). Sequence and structure analysis of the MIF4G domains in many proteins indicate that the domain assumes an all helical fold and has tandem repeated motifs. The zebrafish protein described here has homology to domains of other proteins variously referred to as NIC-containing proteins (NMD2, eIF4G, CBP80). The biological function of D. rerio MIF4Gdb has not yet been experimentally characterized, and the annotation is based on amino acid sequence comparison. D. rerio MIF4Gdb did not share more than 25% sequence identity with any protein for which the three-dimensional structure is known and was selected as a target for structure determination by the Center for Eukaryotic Structural Genomics (CESG). Here, they report the crystal structure of D. rerio MIF4Gdb (UniGene code Dr.79360, UniProt code Q5EAQ1, CESG target number GO.79294).

59 BASIC BIOLOGICAL SCIENCES↗

Confidence: Analyzing Performance With Empirical Probabilities

Variability in the performance of shared system components is a major obstacle in analyzing the effective throughput of leadership class computers. Shared file systems and networks are serious impediments to achieving repeatable application performance on HPC systems. In particular, performance analysts are likely to be interested in quantifying differences between average-case behavior, worst-case behavior, and standard deviation for shared system components. Typical descriptions of these statistics assume a normal distribution; however, in non-linear and multi-modal performance distributions, summary statistics are often misleading. In this paper we describe Confidence, a tool for analyzing the full spectrum of performance for a benchmarking code. By including all of the experimental outcomes in the analysis without discarding any measurements, Confidence enables a novel analysis of benchmark performance. Finally, we use Confidence to characterize the network performance of three high performance computer systems, and we provide recommendations for leveraging network performance in latency sensitive applications.

Settlemyer, Bradley W↗