SEARCH · Engineering Papers

Results for “Partitioned Global Address Space”

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.

SourceResearch connectionFrom yearThrough year

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

5 records

All sources NASA NTRS DOE OSTI

NASA NTRS2023

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Modern Fortran↗

NASA NTRS1990

Compiling global name-space programs for distributed execution

Distributed memory machines do not provide hardware support for a global address space. Thus programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. The compiler support required to allow programmers to express their algorithms using a global name-space is examined. A general method is presented for analysis of a high level source program and along with its translation to a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile-time. Otherwise run-time code is generated to implement the required data movement. The analysis required in both situations is described and the performance of the generated code on the Intel iPSC/2 is presented.

Koelbel, Charles↗

NASA NTRS1991

Compiling global name-space parallel loops for distributed execution

Distributed memory machines do not provide hardware support for a global address space. Thus programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. The compiler support required to allow programmers to express their algorithms using a global name-space is examined. A general method is presented for analysis of a high level source program and its translation into a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile time. Otherwise, run-time code is generated to implement the required data movement. The analysis required in both situations is described and the performance of the generated code on the Intel iPSC/2 is presented.

Koelbel, Charles↗

NASA NTRSDate not supplied

Understanding the Impact of Unobservable Variables on the Performance of Predictive Models: The Need for Feature Space Partitioning and Fusion

When developing predictive models over a dataset, the model is globally optimized across the entire feature space to learn a decision boundary. However, when unobservable variables—which cannot be measured or estimated—interact with the observable variables, this can negatively impact the optimization applied to the decision boundary since the data samples introduced by unobservable variables may have little to no association with the applied global optimization. This, consequently, penalizes the entire decision boundary and model performance. This paper examines some of the detrimental effects of unobservable variables, particularly their role in creating new modes in the distribution of observable variables and reducing the separability of class distributions. Such challenges result in skewed or warped decision boundaries and decreased accuracy of model predictions, particularly for interpretable models like logistic regression and decision trees. Through two illustrative case examples, we highlight the need to address the challenges imposed by unobservable variables. We propose a strategy to mitigate these challenges by creating local regions within the feature space through partitioning. This enables the optimization of local models within the regions to overcome the impact of unobservability in different feature space localities. Research into a more sophisticated partitioning strategy and where the partition should be relative to the sample of interest is left as future work. Through the analysis of the impact of unobservability and the development of a partitioning method, we demonstrate the clear need for a partitioning strategy that integrates knowledge from multiple local models to estimate risk factors using information fusion. Thus, we establish the foundation and motivation for using partitioning and information fusion to overcome the effects of unobservability in predictive models. Formal fusion methods, such as Dempster-Shafer theory, can better leverage the information from local regions to improve the performance of interpretable predictive models in the presence of unobservable variables.

Time Series Data↗

NASA NTRS2024

Global Sensitivity Analysis of Simulated Remote Sensing Polarimetric Observations Over Snow

This study presents a detailed theoretical assessment of the information content of passive polarimetric observations over snow scenes, using a global sensitivity analysis (GSA) method. Conventional sensitivity studies focus on varying a single parameter while keeping all other parameters fixed. In contrast, the GSA correctly addresses the covariance of state parameters across their entire parameter space, hence favoring a more correct interpretation of inversion algorithms and the optimal design of their state vectors. The forward simulations exploit a vector radiative transfer model to obtain the Stokes vector emerging at the top of the atmosphere for different solar zenith angles, when the bottom boundary consists of a vertically resolved snowpack of non-spherical grains. The presence of light-absorbing particulates (LAPs), either embedded in the snow or aloft in the atmosphere above in the form of aerosols, is also considered. The results are presented for a set of wavelengths spanning the visible (VIS), near-infrared (NIR), and shortwave infrared (SWIR) region of the spectrum. The GSA correctly captures the expected, high sensitivity of the reflectance to LAPs in the VIS–NIR and to grain size at different depths in the snowpack in the NIR–SWIR. With adequate viewing geometries, mono-angle measurements of total reflectance in the VIS–SWIR (akin to those of the Moderate Resolution Imaging Spectroradiometer, MODIS) resolve grain size in the top layer of the snowpack sufficiently well. The addition of multi-angle polarimetric observations in the VIS–NIR provides information on grain shape and microscale roughness. The simultaneous sensitivity in the VIS–NIR to both aerosols and snow-embedded impurities can be disentangled by extending the spectral range to the SWIR, which contains information on aerosol optical depth while remaining essentially unaffected when the same particulates are mixed with the snow. Multi-angle polarimetric observations can therefore (i) effectively partition LAPs between the atmosphere and the surface, which represents a notorious challenge for snow remote sensing based on measurements of total reflectance only and (ii) lead to better estimates of grain shape and roughness and, in turn, the asymmetry parameter, which is critical for the determination of albedo. The retrieval uncertainties are minimized when the degree of linear polarization is used in place of the polarized reflectance. The Sobol indices, which are the main metric for the GSA, were used to select the state parameters in retrievals performed on data simulated for multiple instrument configurations. Improvements in retrieval quality with the addition of measurements of polarization, multi-angle views, and different spectral channels reflect the information content, identified by the Sobol indices, relative to each configuration. The results encourage the development of new remote sensing algorithms that fully leverage multi-angle and polarimetric capabilities of modern remote sensors. They can also aid flight planning activities, since the optimal exploitation of the information content of multi-angle measurements depends on the viewing geometry. The better characterization of surface and atmospheric parameters in snow-covered regions advances research opportunities for scientists of the cryosphere and ultimately benefits albedo estimates in climate models.

remote sensing↗