Search NASA⌕ Search

SEARCH · Search NASA

Results for “program architectures”

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 595 records · Page 33

Physical models reveal indirect reader protein interactions that facilitate epigenetic crosstalk

The spatial organization of chromatin is governed by epigenetic factors, including epigenetic marks and the reader proteins that bind them. By dictating the accessibility of genomic loci, epigenetic factors contribute to the physical regulation of gene expression, enabling diverse cellular phenotypes to be encoded by a shared genome in an individual. Epigenetic dysregulation can lead to aberrations in chromatin architecture, contributing to diseases such as neurological disorders and cancers. Despite the known importance of chromatin organization for human health, the physical mechanisms governing chromatin folding remain underspecified. In this work, we develop a physical model of chromatin organization based on contributions from multiple epigenetic factors. Using our model, we evaluate how conditions in the nuclear environment and crosstalk between epigenetic marks affect the compartmentalization of chromatin into dense heterochromatin and loose euchromatin. Our results emphasize the role of reader protein binding in chromatin compartmentalization. We show that reader proteins interact through an indirect mechanism facilitated by the shared chromatin “scaffold” to which they bind. Under a scenario where reader proteins compete for binding sites, we find that indirect interactions affect the program adopted by the chromatin fiber. By isolating indirect modes of epigenetic crosstalk, we demonstrate how the interplay between epigenetic patterning and environmental factors influences chromatin architecture.

59 BASIC BIOLOGICAL SCIENCES↗

Neuromorphic Graph Algorithms

Graph algorithms enable myriad large-scale applications including cybersecurity, social network analysis, resource allocation, and routing. The scalability of current graph algorithm implementations on conventional computing architectures are hampered by the demise of Moore’s law. We present a theoretical framework for designing and assessing the performance of graph algorithms executing in networks of spiking artificial neurons. Although spiking neural networks (SNNs) are capable of general-purpose computation, few algorithmic results with rigorous asymptotic performance analysis are known. SNNs are exceptionally well-motivated practically, as neuromorphic computing systems with 100 million spiking neurons are available, and systems with a billion neurons are anticipated in the next few years. Beyond massive parallelism and scalability, neuromorphic computing systems offer energy consumption orders of magnitude lower than conventional high-performance computing systems. We employ our framework to design and analyze new spiking algorithms for shortest path and dynamic programming problems. Our neuromorphic algorithms are message-passing algorithms relying critically on data movement for computation. For fair and rigorous comparison with conventional algorithms and architectures, which is challenging but paramount, we develop new models of data-movement in conventional computing architectures. This allows us to prove polynomial-factor advantages, even when we assume a SNN consisting of a simple grid-like network of neurons. To the best of our knowledge, this is one of the first examples of a rigorous asymptotic computational advantage for neuromorphic computing.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Portable Programming Models to Accelerate LArTPC Detector Simulations

The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development that requires often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Using Enterprise Architecture for Analysis of a Complex Adaptive Organization's Risk Inducing Characteristics

Sandia National Laboratories is an organization with a wide range of research and development activities that include nuclear, explosives, and chemical hazards. In addition, Sandia has over 2000 labs and over 40 major test facilities, such as the Thermal Test Complex, the Lightning Test Facility, and the Rocket Sled Track. In order to support safe operations, Sandia has a diverse Environment, Safety, and Health (ES&H) organization that provides expertise to support engineers and scientists in performing work safely. With such a diverse organization to support, the ES&H program continuously seeks opportunities to improve the services provided for Sandia by using various methods as part of their risk management strategy. One of the methods being investigated is using enterprise architecture analysis to mitigate risk inducing characteristics such as normalization of deviance, organizational drift, and problems in information flow. This paper is a case study for how a Department of Defense Architecture Framework (DoDAF) model of the ES&H enterprise, including information technology applications, can be analyzed to understand the level of risk associated with the risk inducing characteristics discussed above. While the analysis is not complete, we provide proposed analysis methods that will be used for future research as the project progresses.

99 GENERAL AND MISCELLANEOUS↗

IRIS-MEMFLOW: Data Flow-Enabled Portable Memory Orchestration in IRIS Runtime for Diverse Heterogeneity

Task-based programming models and execution paradigms provide a means to decompose a computation by expressing it as a graph in which each node represents a specific computation operating on memory objects and the edges define the dependencies in the execution flow. In this execution model, independent nodes in the graph can be executed concurrently in different computing devices, making it suitable for heterogeneous systems in which computing devices with different architectures coexist. However, careful memory orchestration across heterogeneous devices is needed because copies of the same memory object may reside in multiple devices during execution. Manually ensuring such an orchestration is quite challenging. Not only must an application developer guard against race conditions, but they must also optimize data movement between the host and devices because unnecessary data movement significantly impacts performance. To mitigate these challenges, we enhance the IRIS heterogeneous runtime and introduce IRIS-MEMFLOW–a data flow–enabled portable memory abstraction for seamlessly orchestrating memory in diverse heterogeneous computing environments. By using data-flow analysis, IRIS-MEMFLOW guards against race conditions while multiple heterogeneous devices access memory objects. IRIS-MEMFLOW also optimizes data movement between the host and devices without manual intervention. As a result, IRIS provides improved programming productivity, performance, and portability for multidevice heterogeneous executions in high-performance computing and cloud systems that run diverse architectures from different vendors. The efficacy of IRIS-MEMFLOW is evaluated through experiments that show its capability in terms of programming productivity, multidevice heterogeneity, portability, and low overhead versus the state of the art.

Monil, M. A. H. [ORNL] (ORCID:0000000334194037)↗

Evaluation of Portable Programming Models to Accelerate LArTPC Detector Simulations

The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development for these compute accelerators often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.

47 OTHER INSTRUMENTATION↗

NLR surveillance of essential SEC-9 SNARE proteins induces programmed cell death upon allorecognition in filamentous fungi

Significance NOD-like receptors (NLRs) are fundamental components of plant and animal innate immune systems. Some fungal proteins with NLR-like architecture are involved in an allorecognition process that results in cell death, termed heterokaryon incompatibility. A role for fungal NLR-like proteins in pathogen defense has also been proposed. Here, we show that a fungal NLR-like protein, patatin-like phospholipase-1 (PLP-1), monitors the essential SNARE protein SEC-9 in two distantly related fungal species, Neurospora crassa and Podospora anserina . Both plp-1 and sec-9 are highly polymorphic in fungal populations and show evidence of balancing selection. This study provides biochemical evidence that fungal NLRs function similar to NLRs in plants and animals, indicating that these fundamental players of innate immunity evolved independently in all three kingdoms.

54 ENVIRONMENTAL SCIENCES↗

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗

An Architectural Survey of the Test Cell C Historic District, Area 25, Nevada National Security Site, Nye County, Nevada

The U.S. Department of Energy, National Nuclear Security Administration Nevada Field Office (NNSA/NFO) has authorized an updated recording and evaluation of Test Cell C. This facility is part of the former Nuclear Rocket Development Station (NRDS) in Area 25 of Nevada National Security Site (NNSS) in Nye County, Nevada (formerly the Nevada Test Site [NTS]). Future alterations to the facility are anticipated to meet current and future National Weapons Science, Global and Homeland Security Programs, and Environmental Management mission requirements. Therefore, this survey was done to comply with requirements of Section 106 of the National Historic Preservation Act and its implementing regulations, 36 C.F.R. Part 800. An architectural survey of 35.75 acres was completed by Desert Research Institute (DRI). This area also represents the potential Test Cell C Historic District and is identified by NNSA/NFO as the Area of Potential Effect (APE) within which the undertaking may directly cause alterations to the character of historic properties. One resource, Building 25-3210 (SHPO Resource No. B2444), within this area was previously surveyed by DRI. It was found eligible for inclusion in the National Register of Historic Places (NRHP or National Register) under Criteria A and C, and Consideration G. Mitigation of this building was completed prior to its demolition. The APE for reasonably foreseeable effects that may indirectly cause alterations later in time, be farther removed in distance, or be cumulative is the unrecorded NRDS historic district. The present survey updates the previous survey to present standards and expands it to include the entire Test Cell C complex. This includes updated recording and evaluation of the remains of 25-3210 and its 32 previously unrecorded and unevaluated Accessory Resources. The entire complex was recorded as the Test Cell C Historic District (SHPO Resource No. D346), which is eligible for the National Register at the National Level under Criteria A, C, and D. All nine architectural resources in the district are recommended as contributing elements of the Test Cell C Historic District (Figure 2). Of these, four (25-3210 Resource No. B2444, 25-3220 SHPO Resource No. B18110, 25-3226 SHPO Resource No. B18111, and 25-3230-32 SHPO Resource No. B18114) are recommended as individually eligible to the National Register under Criteria A and C, and one (KIWI-TNT [Transient Nuclear Test] SHPO Resource No. S2287) is recommended as individually eligible under Criteria A, C, and D. The remaining four resources (25-3214 SHPO Resource No. B18109, 25-3228 SHPO Resource No. B18112, 25-3229 SHPO Resource No. B18113, and 25-3233 SHPO Resource No. 18115) are not recommended as individually eligible. In addition, the Test Cell C Historic District is regarded as a contributor to the potential national significance of the NRDS Historic District. In 2010, the NTS became the NNSS. Because of the nature of the discussion in the Historic Context below, “NTS” is used throughout that section, otherwise “NNSS” is used to refer to the site. The survey area is located in unplatted sections of T13S R51E Mount Diablo Baseline and Meridian (projected) in Area 25 of the NNSS. It is within the NRDS in Jackass Flats, which has long been recognized as a potential historic district. An oblique aerial photo of the Test Cell C complex is shown on the cover of this report.

54 ENVIRONMENTAL SCIENCES↗

Next Generation System Analysis Model Recently Added Features and Future Plans - Abstract

The Nuclear Waste Policy Act of 1982, as amended (NWPA 1982), established the federal government’s responsibility to accept spent nuclear fuel (SNF) and high-level radioactive waste (HLW) from waste owners and generators for ultimate disposition. SNF generated by the current fleet of commercial nuclear reactors is being stored at the reactor sites in spent fuel pools (SFPs) and in dry independent spent fuel storage installations (ISFSIs). The US Department of Energy Office of Nuclear Energy (DOE-NE) is developing an Integrated Waste Management Program (IWMP) comprising a suite of options and supporting analyses to enable future informed choices. The IWMP is applying integrated waste management system architecture analysis, system engineering, and decision analysis principles to inform potential future decisions regarding potential nuclear waste management system architectures. Architecture analyses of the IWM system are being conducted to support the future deployment of a comprehensive system for managing nuclear waste that considers all major aspects of the back end of the nuclear fuel cycle (i.e., transportation, storage, and disposal). The Next Generation System Analysis Model (NGSAM) is an agent-based simulation software tool designed for the express purpose of modeling the IWM system. NGSAM imports data from the Oak Ridge National Laboratory (ORNL) Unified Database (e.g., historic assembly information, thermal profiles for assembly heat, at-reactor dry storage loadings) to ensure that the simulation initializes with a realistic representation of the state of commercial SNF in the United States. Recent major enhancements that have been implemented into NGSAM since NGSAM was last presented at the WM2019 conference include: • Tracking of railroad escort and buffer car acquisition. • Addition of heavy haul and barge routes for some sites, as well as support for user-defined inter-modal routes. • Updates to the logic that checks the thermal maps prior to package transport. • Addition of an allocation method that predicts when reactor sites will pack assemblies from their pools for dry storage and allocates packages to those reactor sites in the preceding periods, favoring direct transport packages and reducing the number of packages that reactor sites pack for dry storage at their ISFSIs. • Addition of reactor site family operational limits, which are used to limit the number of loads from the pool and from dry storage at a given reactor site per year. • Support has been added for multiple canister loading maps and packages having multiple compatible transportation overpacks. • Updates in the handling of non-commercial fuel, including a new database containing data to support the updates. • Support for repackaging at reactor sites. • Implementing additional output reports or modifying existing reports. • User edits can now be created and edited via the NGSAM website. • Ability to load packages for dry storage at ISF pools. • Same-type package blending at DOE sites. • Support for multi-mode transloading at reactor sites. These new features have improved NGSAM capabilities and/or improve the user experience with the model and will be discussed in more detail. The initial NGSAM requirements for advanced reactor fuels, reprocessing, treatment, and conditioning are preliminary and are described at a high level in this paper: analysts will provide more specific requirements to the NGSAM team in the future. Additionally, there are many data needs associated with modeling advanced reactors in NGSAM, but many of the data or plans are still in progress and/or yet to be fully defined. However, this document describes an initial exploration of the data relevant to this program. Advanced reactor data will likely require revision as concepts evolve and new considerations are made. This is a technical paper that does not take into account contractual limitations or obligations under the Standard Contract for Disposal of Spent Nuclear Fuel and/or High-Level Radioactive Waste (Standard Contract) (10 CFR Part 961). For example, under the provisions of the Standard Contract, spent nuclear fuel in multi-assembly canisters is not an acceptable waste form, absent a mutually agreed to contract amendment. To the extent discussions or recommendations in this paper conflict with the provisions of the Standard Contract, the Standard Contract governs the obligations of the parties, and this paper in no manner supersedes, overrides, or amends the Standard Contract. This paper reflects technical work which could support future decision making by DOE. No inferences should be drawn from this paper regarding future actions by DOE, which are limited both by the terms of the Standard Contract and Congressional appropriations for the Department to fulfill its obligations under the Nuclear Waste Policy Act including licensing and construction of a spent nuclear fuel repository.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Lifecycle Prognostics Architecture for Selected High-Cost Active Components

There are an extensive body of knowledge and some commercial products available for calculating prognostics, remaining useful life, and damage index parameters. The application of these technologies within the nuclear power community is still in its infancy. Online monitoring and condition-based maintenance is seeing increasing acceptance and deployment, and these activities provide the technological bases for expanding to add predictive/prognostics capabilities. In looking to deploy prognostics there are three key aspects of systems that are presented and discussed: (1) component/system/structure selection, (2) prognostic algorithms, and (3) prognostics architectures. Criteria are presented for component selection: feasibility, failure probability, consequences of failure, and benefits of the prognostics and health management (PHM) system. The basis and methods commonly used for prognostics algorithms are reviewed and summarized. Criteria for evaluating PHM architectures are presented: open, modular architecture; platform independence; graphical user interface for system development and/or results viewing; web enabled tools; scalability; and standards compatibility. Thirteen software products were identified and discussed in the context of being potentially useful for deployment in a PHM program applied to systems in a nuclear power plant (NPP). These products were evaluated by using information available from company websites, product brochures, fact sheets, scholarly publications, and direct communication with vendors. The thirteen products were classified into four groups of software: (1) research tools, (2) PHM system development tools, (3) deployable architectures, and (4) peripheral tools. Eight software tools fell into the deployable architectures category. Of those eight, only two employ all six modules of a full PHM system. Five systems did not offer prognostic estimates, and one system employed the full health monitoring suite but lacked operations and maintenance support. Each product is briefly described in Appendix A. Selection of the most appropriate software package for a particular application will depend on the chosen component, system, or structure. Ongoing research will determine the most appropriate choices for a successful demonstration of PHM systems in aging NPPs.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Studying performance portability of LAMMPS across diverse GPU-based platforms

The molecular dynamics simulation software, LAMMPS, utilizes the Kokkos acceleration library to port computation to a diverse set of architectures including those based on GPU accelerators. In addition to Kokkos, LAMMPS contains a vast code base that leverages the CUDA application programming interface using library functions such as cuFFT, CUDA's fast-fourier transform (FFT) library, and, more recently, also support for AMD's Heterogeneous Interface for Portability (HIP) that is rapidly growing. While preparing LAMMPS tests for the AMD GPU-based test system precursors to Frontier, we investigated several strategies for accelerating LAMMPS on AMD GPUs, using the AMD Instinct MI100 and MI250X. In this work, we integrated the HIP FFT library, hipFFT, into the particle-particle particle-mesh (PPPM) long-range solver, which allowed the porting of PPPM calculations to the GPUs. Kokkos behavior on the MI100 and MI250X was also investigated through the package kokkos command of LAMMPS, targeting communication, memory usage, and particle grid decomposition. The Tersoff, Reax, Lennard-Jones (LJ), EAM, Granular, and PPPM potentials were investigated in this effort, and results from these experiments are provided. In conclusion, the selected potentials were run on Spock (AMD Instinct MI100), Crusher (AMD Instinct MI250X), AFW HPC11 (NVIDIA A100) and Summit (NVIDIA V100), for comparison. Operational roofline models were constructed and analyzed for the Tersoff, Reax, and Lennard–Jones potentials on Crusher and Summit.

97 MATHEMATICS AND COMPUTING↗

The Rule of Thirds: Controlling Junction Chirality and Polarity in 3D DNA Tiles

The successful self-assembly of tensegrity triangle DNA crystals heralded the ability to programmably construct macroscopic crystalline nanomaterials from rationally-designed, nanoscale components. This 3D DNA tile owes its “tensegrity” nature to its three rotationally-stacked double helices locked together by the tensile winding of a center strand segmented into 7 base pair (bp) inter-junction regions, corresponding to two thirds of a helical turn of DNA. All reported tensegrity triangles to date have employed [Z + 2/3] turn inter-junction segments, yielding right-handed, antiparallel, “J1” junctions. Here, we report here a minimal DNA triangle motif consisting of 3-bp inter-junction segments, or one third of a helical turn. Here, we find that the minimal motif exhibits a reversed morphology with a left-handed tertiary structure mediated by a locally-parallel Holliday junction—the L1 junction. This parallel junction yields a predicted helical groove matching pattern that breaks the pseudosymmetry between tile faces, and the junction morphology further suggests a folding mechanism. We identify a Rule of Thirds by which supramolecular chirality can be programmed through inter-junction DNA segment length. These results underscore the role that global topological forces play in determining local DNA architecture and ultimately point to an under-explored class of self-assembling, chiral nanomaterials for topological processes in biological systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using Compiler Directives for Performance Portability in Scientific Computing: Kernels from Molecular Simulation

Achieving performance portability for high-performance computing (HPC) applications in scientific fields has become an increasingly important initiative due to large differences in emerging supercomputer architectures. Here we test some key kernels from molecular dynamics (MD) to determine whether the use of the OpenACC directive-based programming model when applied to these kernels can result in performance within an acceptable range for these types of programs in the HPC setting. We find that for easily parallelizable kernels, performance on the GPU remains within this range. On the CPU, OpenACC-parallelized pairwise distance kernels would not meet the performance standards required, when using AMD Opteron “Interlagos” processors, but with IBM Power 9 processors, performance remains within an acceptable range for small batch sizes. These kernels provide a test for achieving performance portability with compiler directives for problems with memory-intensive components as are often found in scientific applications.

Sedova, Ada↗

Manage OpenMP GPU Data Environment Under Unified Address Space

OpenMP has supported the offload of computations to accelerators such as GPUs since version 4.0. A crucial aspect in OpenMP offloading is to manage the accelerator data environment. Currently, this has to be explicitly programmed by users, which is non-trival and often results in suboptimal performance. The unified memory feature available in recent GPU architectures introduces another option, implicit management. However, our experiments show that it incurs several performance issues, especially under GPU memory oversubscription. In this paper, we propose a compiler and runtime collaborative approach to manage OpenMP GPU data under unified memory. In our framework, the compiler performs data reuse analysis to assist runtime data management. The runtime combines static and dynamic information to make optimized data management decisions.We have implement the proposed technology in the LLVM framework. The evaluation shows our method can achieve significant performance improvement for OpenMP GPU offloading.

97 MATHEMATICS AND COMPUTING↗

Memory forensic analysis of a programmable logic controller in industrial control systems

In industrial control systems (ICS), programmable logic controllers (PLCs) are used to automate physical processes such as nuclear plants and power grid stations, and are often subject to cyber attacks. As in conventional IT domain, the memory analysis of the PLCs can help answer important forensic questions about the attack, such as the presence of malicious firmware, injection of modified control logic (the program running on the PLC), and manipulation of I/O devices (e.g., sensors and actuators). Unlike conventional IT domain, PLCs have heterogeneous hardware architecture, proprietary firmware and control software, making it challenging to employ a unified framework for their memory forensics. For merely extracting artifacts of forensic importance, reverse-engineering the firmware is a tedious task, and the effort needs to be repeated for every PLC model. As a community, a step-wise approach to tackle this challenge is to analyze the memory of specific PLCs, and subsequently find a generic framework applicable to all PLCs. Our work is a step forward in this direction. By following a methodology that focuses on the functional layer of PLCs instead of reverse engineering the firmware, we analyze the digital forensic artifacts available in a common PLC, Allen-Bradley ControlLogix 1756-L61. Before diving into the memory dump, we analyze the PLC control software to create a list of important artifacts that are sure to exist in the PLC memory dump. The approach employs a setup where PLC control software RSLogix-5000 is connected to the PLC, and the memory dump can be obtained as and when needed. We create test cases that sequentially highlight each category of artifacts, followed by an examination of the resultant impact on memory. After attaining the listed artifacts, we employ conventional string and known data searches to extract interesting information present in this PLC's memory. The memory analysis profile, presented as a Python library and shared with the community, can help a forensic investigator to readily extract forensic artifacts from the same model's controller. The adopted approach may help researchers in creating memory profile of other PLCs, and ultimately formulating a generic PLC memory analysis framework.

Rais, Muhammad Haris↗

OpenCL: Free Your GPU... and the rest of your system too!

For the uninitiated, OpenCL may just seem like a tool for accessing GPUs in a portable manner, an alternative to CUDA that works for ATI cards. This view of OpenCL is a vast oversimplification. The truth is that OpenCL offers a rich set of features that will provide the infrastructure needed for application developers to fully utilize an increasingly heterogeneous hardware future. In this article, we will consider how OpenCL can address some of the coming challenges, and what the OpenCL community is doing to insure that there is a vibrant ecosystem of support, as more and more users turn to OpenCL from vendor-locked solutions. By now, we’ve all heard of the power wall, and we know that the only way to climb over it is parallelism. Data-level parallelism (think GPUs) was the first technology to make a mark in the new computing age. Employing very uniform work units, data parallel implementations have achieved noteworthy performance gains for many scientific algorithms, and OpenCL certainly has support for this model. However, this is not the end of the story. As CPU vendors seek to adapt their architectures to the new parallel reality (and GPU vendors evolve theirs), alternate ideas about how to expose and exploit parallelism within a program are surfacing. These designs seek to mitigate performance limitations for algorithms where the majority of the work does not fit neatly into non-divergent units of execution.

97 MATHEMATICS AND COMPUTING↗

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗