Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

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 577 records · Page 32

A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

Knowledge-based commodity distribution planning

This paper presents an overview of a Decision Support System (DSS) that incorporates Knowledge-Based (KB) and commercial off the shelf (COTS) technology components. The Knowledge-Based Logistics Planning Shell (KBLPS) is a state-of-the-art DSS with an interactive map-oriented graphics user interface and powerful underlying planning algorithms. KBLPS was designed and implemented to support skilled Army logisticians to prepare and evaluate logistics plans rapidly, in order to support corps-level battle scenarios. KBLPS represents a substantial advance in graphical interactive planning tools, with the inclusion of intelligent planning algorithms that provide a powerful adjunct to the planning skills of commodity distribution planners.

Saks, Victor↗

Cloud Mask Intercomparison eXercise (CMIX): An evaluation of cloud masking algorithms for Landsat 8 and Sentinel-2

Cloud cover is a major limiting factor in exploiting time-series data acquired by optical spaceborne remote sensing sensors. Multiple methods have been developed to address the problem of cloud detection in satellite imagery and a number of cloud masking algorithms have been developed for optical sensors but very few studies have carried out quantitative intercomparison of state-of-the-art methods in this domain. This paper summarizes results of the first Cloud Masking Intercomparison eXercise (CMIX) conducted within the Committee Earth Observation Satellites (CEOS) Working Group on Calibration & Validation (WGCV). CEOS is the forum for space agency coordination and cooperation on Earth observations, with activities organized under working groups. CMIX, as one such activity, is an international collaborative effort aimed at intercomparing cloud detection algorithms for moderate-spatial resolution (10–30 m) spaceborne optical sensors. The focus of CMIX is on open and free imagery acquired by the Landsat 8 (NASA/USGS) and Sentinel-2 (ESA) missions. Ten algorithms developed by nine teams from fourteen different organizations representing universities, research centers and industry, as well as space agencies (CNES, ESA, DLR, and NASA), are evaluated within the CMIX. Those algorithms vary in their approach and concepts utilized which were based on various spectral properties, spatial and temporal features, as well as machine learning methods. Algorithm outputs are evaluated against existing reference cloud mask datasets. Those datasets vary in sampling methods, geographical distribution, sample unit (points, polygons, full image labels), and generation approaches (experts, machine learning, sky images). Overall, the performance of algorithms varied depending on the reference dataset, which can be attributed to differences in how the reference datasets were produced. The algorithms were in good agreement for thick cloud detection, which were opaque and had lower uncertainties in their identification, in contrast to thin/semi-transparent clouds detection. Not only did CMIX allow identification of strengths and weaknesses of existing algorithms and potential areas of improvements, but also the problems associated with the existing reference datasets. The paper concludes with recommendations on generating new reference datasets, metrics, and an analysis framework to be further exploited and additional input datasets to be considered by future CMIX activities.

Sergii Skakun↗

Monthly distributions of precipitable water from the Nimbus 7 SMMR data

The first year of data from the Nimbus 7 Scanning Multichannel Microwave Radiometer (SMMR), covering the period December 1978 through November 1979, was used to study the monthly mean distributions of precipitable water over the global oceans. The water vapor algorithm is based on a multiple regression technique, utilizing three of the higher frequency channels on SMMR. The results obtained are in good agreement with other independent studies. They reveal features associated with other independent studies. They reveal features associated with the general circulation of the atmosphere and the ocean currents. Samples of monthly and annual distributions of precipitable water over oceans are presented, and their characteristics are discussed.

Chang, H. D.↗

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗

Extending XBAER Algorithm to Aerosol and Cloud Condition

The retrieval of cloud optical properties for aerosol contaminated water cloud is challenging because of the complexity of physical processes in such situations. Conventionally, cloud optical data products are typically derived, ignoring the aerosol impacts on radiative transfer in the retrieval process. This is potentially a significant source of error. In this paper, the eXtensible Bremen Aerosol Retrieval (XBAER) algorithm has been optimized for the retrieval of aerosol/cloud properties for the aerosol contaminated cloud (ACC) scenarios. This version of XBAER delivers cloud optical thickness (COT) and cloud effective radius (CER) for ACCs and simultaneously retrieves aerosol optical thickness (AOT). The surface parameterization and aerosol types used in the standard XBAER algorithm have been adapted in this retrieval to account for the ACC conditions. Aerosol types in XBAER for the retrieval of ACC scenarios have been parameterized to comprise weak and strong absorptions. The comparisons of COT, CER, and AOT retrieved using this adapted XBAER algorithm and two new NASA algorithms show good agreements, especially for biomass burning aerosol. The correlation coefficients are >0.9 for AOT, ~0.8 for CER, and ~0.7 for COT. There is also a good agreement for dust plume contaminated cloud scene. The XBAER derived AOT values for dust aerosols are systematically smaller than the NASA retrieval, but both products have the same spatial distribution patterns. The comparison of COT retrieved using the adapted XBAER algorithm and that retrieved from ground-based microwave radiometer (MWR) measurements shows much better agreement for ACC conditions with high AOT.

satellite↗

Improved Algorithm to Estimate Convective and Stratiform Rain from TRMM Microwave Radiometer Data

The rain rates associated with Mesoscale Convective Systems (MCSS) deduced from the Tropical Rainfall Measuring Mission (TRMM) Precipitation Radar (PR) follow the well known log-normal type frequency distribution characteristic of conventional radars and rain gauges. On the other hand, the current microwave radiometer rain retrieval algorithms cannot give good representations of convective and stratiform precipitation. Thus they capture poorly this log-normal character. In particular, this is noticed clearly over land areas. The objective of the present study is to improve TRMM Microwave Imager (TMI) retrievals of convective and stratiform rain to a level comparable to the PR. For this purpose, we have developed a TMI rain retrieval algorithm that depends primarily on the 85 GHz brightness temperatures (Tbs) and their spatial distribution. We emphasize the 85 GHz channel because of its fine footprint size (about 5.5 km) and strong extinction property. The other spectral channels, because they are poorer in these respects, are given less importance. The brightness temperatures and spatial distribution information in the 85 GHz allows us to detect thunderstorms, or cumulonimbus clouds (Cbs), that are in different stages of development, as well as stratiform rain outside of these Cbs. Utilizing our retrieval technique, we have produced maps of convective and stratiform rain for several MCS events over land and ocean that agree well with those given by the PR. On average, the convective and stratiform rain rates given by our technique have an accuracy of about 15 % with respect to those given by the PR.

Prabhakara, C.↗

Hardware-assisted software clock synchronization for homogeneous distributed systems

A clock synchronization scheme that strikes a balance between hardware and software solutions is proposed. The proposed is a software algorithm that uses minimal additional hardware to achieve reasonably tight synchronization. Unlike other software solutions, the guaranteed worst-case skews can be made insensitive to the maximum variation of message transit delay in the system. The scheme is particularly suitable for large partially connected distributed systems with topologies that support simple point-to-point broadcast algorithms. Examples of such topologies include the hypercube and the mesh interconnection structures.

Ramanathan, P.↗

Climatespark: an In-Memory Distributed Computing Framework for Big Climate Data Analytics

The unprecedented growth of climate data creates new opportunities for climate studies, and yet big climate data pose a grand challenge to climatologists to efficiently manage and analyze big data. The complexity of climate data content and analytical algorithms increases the difficulty of implementing algorithms on high performance computing systems. This paper proposes an in-memory, distributed computing framework, ClimateSpark, to facilitate complex big data analytics and time-consuming computational tasks. Chunking data structure improves parallel I/O efficiency, while a spatiotemporal index is built for the chunks to avoid unnecessary data reading and preprocessing. An integrated, multi-dimensional, array-based data model (ClimateRDD) and ETL operations are developed to address big climate data variety by integrating the processing components of the climate data lifecycle. ClimateSpark utilizes Spark SQL and Apache Zeppelin to develop a web portal to facilitate the interaction among climatologists, climate data, analytic operations and computing resources (e.g., using SQL query and Scala/Python notebook). Experimental results show that ClimateSpark conducts different spatiotemporal data queries/analytics with high efficiency and data locality. ClimateSpark is easily adaptable to other big multiple- dimensional, array-based datasets in various geoscience domains.

Hu, Fei↗

Meteorological Inventory of Rain-On-Snow Events in the Canadian Arctic Archipelago and Satellite Detection Assessment Using Passive Microwave Data

The spatial and temporal distributions of rain-on-snow (ROS) events across the Canadian Arctic Archipelago (CAA) remain poorly understood owing to their sporadic nature in time and space. This situation motivated the development of remote sensing detection algorithms. This paper uses a large meteorological dataset across the CAA to adapt an existing ROS-detection algorithm developed in a previous study by our group. Results highlight the spatial distribution and evolution of ROS occurrences reported since 1985 at 14 weather stations across the CAA. Results show that >600 ROS events were inventoried since 1985, for which >70% were classified as pure rain (liquid form) and 30% as mixed precipitation (solid/liquid). Of the pure rain events, 75% occurred during spring, 14% during fall, 8% during summer and <1% during winter. Such events can have significant impacts on ungulate grazing conditions through the creation of ice layers, causing serious problems for caribou calf survival, especially during the migration period. This paper introduces an adaptation for larger scale Arctic application of a detection algorithm (sensitivity analysis on the detection threshold) with an error of ~5%. The validation, however, remains limited due to a short study period and limited number of sites.

Canadian Arctic Archipelago (CAA)↗

Finite element solution for energy conservation using a highly stable explicit integration algorithm

Theoretical derivation of a finite element solution algorithm for the transient energy conservation equation in multidimensional, stationary multi-media continua with irregular solution domain closure is considered. The complete finite element matrix forms for arbitrarily irregular discretizations are established, using natural coordinate function representations. The algorithm is embodied into a user-oriented computer program (COMOC) which obtains transient temperature distributions at the node points of the finite element discretization using a highly stable explicit integration procedure with automatic error control features. The finite element algorithm is shown to posses convergence with discretization for a transient sample problem. The condensed form for the specific heat element matrix is shown to be preferable to the consistent form. Computed results for diverse problems illustrate the versatility of COMOC, and easily prepared output subroutines are shown to allow quick engineering assessment of solution behavior.

Baker, A. J.↗

A Survey of Collective Intelligence

This chapter presents the science of "COllective INtelligence" (COIN). A COIN is a large multi-agent systems where: i) the agents each run reinforcement learning (RL) algorithms; ii) there is little to no centralized communication or control; iii) there is a provided world utility function that, rates the possible histories of tile full system. Tile conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather that approach begins with explicit modeling of the overall system's dynamics, followed by detailed hand-tuning of the interactions between the components to ensure that they "cooperate" as far as the world utility is concerned. This approach is labor-intensive, often results in highly non-robust systems, and usually results in design techniques that, have limited applicability. In contrast, with COINs we wish to solve the system design problems implicitly, via the 'adaptive' character of the RL algorithms of each of the agents. This COIN approach introduces an entirely new, profound design problem: Assuming the RL algorithms are able to achieve high rewards, what reward functions for the individual agents will, when pursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of the commons, or Braess's paradox? Although still very young, the science of COINs has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur's "El Farol bar problem". It is expected that as it matures not only will COIN science expand greatly the range of tasks addressable by human engineers, but it will also provide much insight into already established scientific fields, such as economics, game theory, or population biology.

Wolpert, David H.↗

Mission Design for the Lunar Reconnaissance Orbiter

The Lunar Reconnaissance Orbiter (LRO) will be the first mission under NASA's Vision for Space Exploration. LRO will fly in a low 50 km mean altitude lunar polar orbit. LRO will utilize a direct minimum energy lunar transfer and have a launch window of three days every two weeks. The launch window is defined by lunar orbit beta angle at times of extreme lighting conditions. This paper will define the LRO launch window and the science and engineering constraints that drive it. After lunar orbit insertion, LRO will be placed into a commissioning orbit for up to 60 days. This commissioning orbit will be a low altitude quasi-frozen orbit that minimizes stationkeeping costs during commissioning phase. LRO will use a repeating stationkeeping cycle with a pair of maneuvers every lunar sidereal period. The stationkeeping algorithm will bound LRO altitude, maintain ground station contact during maneuvers, and equally distribute periselene between northern and southern hemispheres. Orbit determination for LRO will be at the 50 m level with updated lunar gravity models. This paper will address the quasi-frozen orbit design, stationkeeping algorithms and low lunar orbit determination.

Beckman, Mark↗

Applying Biomimetic Algorithms for Extra-Terrestrial Habitat Generation

The objective is to simulate and optimize distributed cooperation among a network of robots tasked with cooperative excavation on an extra-terrestrial surface. Additionally to examine the concept of directed Emergence among a group of limited artificially intelligent agents. Emergence is the concept of achieving complex results from very simple rules or interactions. For example, in a termite mound each individual termite does not carry a blueprint of how to make their home in a global sense, but their interactions based strictly on local desires create a complex superstructure. Leveraging this Emergence concept applied to a simulation of cooperative agents (robots) will allow an examination of the success of non-directed group strategy achieving specific results. Specifically the simulation will be a testbed to evaluate population based robotic exploration and cooperative strategies while leveraging the evolutionary teamwork approach in the face of uncertainty about the environment and partial loss of sensors. Checking against a cost function and 'social' constraints will optimize cooperation when excavating a simulated tunnel. Agents will act locally with non-local results. The rules by which the simulated robots interact will be optimized to the simplest possible for the desired result, leveraging Emergence. Sensor malfunction and line of sight issues will be incorporated into the simulation. This approach falls under Swarm Robotics, a subset of robot control concerned with finding ways to control large groups of robots. Swarm Robotics often contains biologically inspired approaches, research comes from social insect observation but also data from among groups of herding, schooling, and flocking animals. Biomimetic algorithms applied to manned space exploration is the method under consideration for further study.

Birge, Brian↗

A balanced submatrix merging algorithm for multiprocessor architectures

In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.

Chu, Eleanor↗

Global Distribution and Variability of Surface Skin and Surface Air Temperatures as Depicted in the AIRS Version-6 Data Set

In this presentation, we will briefly describe the significant improvements made in the AIRS Version-6 retrieval algorithm, especially as to how they affect retrieved surface skin and surface air temperatures. The global distribution of seasonal 1:30 AM and 1:30 PM local time 12 year climatologies of Ts,a will be presented for the first time. We will also present the spatial distribution of short term 12 year anomaly trends of Ts,a at 1:30 AM and 1:30 PM, as well as the spatial distribution of temporal correlations of Ts,a with the El Nino Index. It will be shown that there are significant differences between the behavior of 1:30 AM and 1:30 PM Ts,a anomalies in some arid land areas.

Retrieval algorithm↗