Search NASA⌕ Search

SEARCH · Search NASA

Results for “resource partitioning”

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 37 records · Page 2

JTRS/SCA and Custom/SDR Waveform Comparison

This paper compares two waveform implementations generating the same RF signal using the same SDR development system. Both waveforms implement a satellite modem using QPSK modulation at 1M BPS data rates with one half rate convolutional encoding. Both waveforms are partitioned the same across the general purpose processor (GPP) and the field programmable gate array (FPGA). Both waveforms implement the same equivalent set of radio functions on the GPP and FPGA. The GPP implements the majority of the radio functions and the FPGA implements the final digital RF modulator stage. One waveform is implemented directly on the SDR development system and the second waveform is implemented using the JTRS/SCA model. This paper contrasts the amount of resources to implement both waveforms and demonstrates the importance of waveform partitioning across the SDR development system.

Oldham, Daniel R.↗

Network design consideration of a satellite-based mobile communications system

Technical considerations for the Mobile Satellite Experiment (MSAT-X), the ground segment testbed for the low-cost spectral efficient satellite-based mobile communications technologies being developed for the 1990's, are discussed. The Network Management Center contains a flexible resource sharing algorithm, the Demand Assigned Multiple Access scheme, which partitions the satellite transponder bandwidth among voice, data, and request channels. Satellite use of multiple UHF beams permits frequency reuse. The backhaul communications and the Telemetry, Tracking and Control traffic are provided through a single full-coverage SHF beam. Mobile Terminals communicate with the satellite using UHF. All communications including SHF-SHF between Base Stations and/or Gateways, are routed through the satellite. Because MSAT-X is an experimental network, higher level network protocols (which are service-specific) will be developed only to test the operation of the lowest three levels, the physical, data link, and network layers.

Yan, T.-Y.↗

A Formal Model of Partitioning for Integrated Modular Avionics

The aviation industry is gradually moving toward the use of integrated modular avionics (IMA) for civilian transport aircraft. An important concern for IMA is ensuring that applications are safely partitioned so they cannot interfere with one another. We have investigated the problem of ensuring safe partitioning and logical non-interference among separate applications running on a shared Avionics Computer Resource (ACR). This research was performed in the context of ongoing standardization efforts, in particular, the work of RTCA committee SC-182, and the recently completed ARINC 653 application executive (APEX) interface standard. We have developed a formal model of partitioning suitable for evaluating the design of an ACR. The model draws from the mathematical modeling techniques developed by the computer security community. This report presents a formulation of partitioning requirements expressed first using conventional mathematical notation, then formalized using the language of SRI'S Prototype Verification System (PVS). The approach is demonstrated on three candidate designs, each an abstraction of features found in real systems.

DiVito, Ben L.↗

A distributable APSE

A distributed Ada program library is a key element in a distributed Ada Program Support Environment (APSE). To implement this successfully, the program library universe as defined by the Ada Reference Manual must be broken up into independently manageable pieces. This in turn requires the support of a distributed database system, as well as a mechanism for identifying compilation units, linkable subprograms, and Ada types in a decentralized way, to avoid falling victim to the bottlenecks of a global database and/or global unique-identifier manager. It was found that the ability to decentralize Ada program library activity is a major advantage in the management of large Ada programs. Currently, there are 18 resource-catalog revision sets, each in its own Host Interface (HIF) partition, plus 18 partitions for testing each of these, plus 11 partitions for the top-level compiler/linker/program library manager components. Compiling and other development work can proceed in parallel in each of these partitions, without suffering the performance bottlenecks of global locks or global unique-identifier generation.

Taft, Tucker, S.↗

A multiblock analysis for shuttle orbiter re-entry heating from Mach 24 to Mach 12

A multiblock, laminar heating analysis for the shuttle orbiter at three trajectory points ranging from Mach 24.3 to Mach 12.86 on re-entry is described. The analysis is performed using the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) with both a seven species chemical nonequilibrium model and an equilibrium model. A finite-catalytic-wall model appropriate for shuttle tiles at a radiative equilibrium wall temperature is applied. Computed heating levels are generally in good agreement with the flight data though a few rather large discrepancies remain unexplained. The multiblock relaxation strategy partitions the flowfield into manageable blocks requiring a fraction of the computational resources (time and memory) required by a full domain approach. In hot, the computational cost for a solution at even a single trajectory point would be prohibitively expensive at the given resolution without the multiblock approach. Converged blocks are reassembled to enable a fully coupled converged solution over the entire vehicle, starting from a nearly converged initial condition.

Gnoffo, Peter A.↗

Multiblock analysis for Shuttle Orbiter reentry heating from Mach 24 to Mach 12

A multiblock, laminar heating analysis for the shuttle orbiter at three trajectory points ranging from Mach 24.3 to Mach 12.86 on reentry is described. The analysis is performed using the Langley Aerothermodynamic Upwind Relaxation Algorithm with a seven species chemical nonequilibrium model. A finite-catalytic-wall model appropriate for shuttle tiles at a radiative equilibrium wall temperature is applied. Computed heating levels are generally in good agreement with the flight data, although a few rather large discrepancies remain unexplained. The multiblock relaxation strategy partitions the flowfield into manageable blocks requiring a fraction of the computational resources (time and memory) required by a full domain approach. In fact, the computational cost for a solution at even a single trajectory point would be prohibitively expensive at the given resolution without the multiblock approach. Converged blocks are reassembled to enable a fully coupled converged solution over the entire vehicle, starting from a nearly converged initial condition.

LANGLEY AEROTHERMODYNAMIC UPWI↗

Psyche Hardware Abstraction Simulation Environment (PHASE): Development of High-Fidelity Downlink Model for Flight Software Performance Testing

NASA’s Katherine Johnson Independent Verification and Validation (IV&V) Independent Test Capability (ITC) Team develops high fidelity software-only simulations (or “digital-twins”) of NASA’s most critical missions that are then used for software verification and validation (V&V). One such digital-twin simulator nearing maturity is the Psyche Hardware Abstraction Simulation Environment (PHASE). PHASE utilizes an instruction set simulator along with ITC-developed avionics models. PHASE includes a newly-developed model of the telecom hardware with a high-fidelity downlink interface, capable of supporting reconfigurable downlink data rates and transmission modes. The different downlink transmission modes allow more processing to be ceded from software onto the telecom hardware. Thus, we are able to monitor the performance of the downlink software module in the time-partitioned OS and perform more realistic dynamic testing based on software’s resource utilization. This presentation will cover PHASE, avionics modeling, the downlink model, and its usage for flight software performance testing.

modeling↗

Cosmochemical Studies: Meteorites, Asteroidal Processes, Chondrules

Our research mainly concerned the asteroidal processes involved in the formation of meteorites and meteoritic chondrules. We continued to generate large amounts of instrumental-neutron-activation analysis (INAA) data, both for irons, chondrites and primitive achondrites. Major themes of our chondrule research were: (1) the temperature and crystallization history of individual chondrules, and (2) the evolution of the solar nebula during the period within which chondrule formation occurred. Much of our chondrule research was focused on the highly primitive CO3 chondrites. We initiated a study of the cooling history of high-FeO chondrules by characterizing the overgrowth layers on relict grains.. We also continued our studies of the composition and the formation of iron meteorites and the evolution of their parent planets. The large data sets that we have generated at UCLA allows systematic comparisons of the large magmatic groups both in terms of fractional crystallization (including rough estimates of non-metal contents of the parental melts) and in terms of the effects of variable contents of trapped melt. We have completed a preliminary study of group IIIAB in which we developed a trapped-melt model and more detailed studies of group IVA and the main-group pallasites. By comparing these large groups and modeling them by a combination of crystallization and melt trapping, we are able to better define both the formation processes and the nature of the solid/liquid elemental partitioning. We helped maintain the excellent neutron-activation facilities at UCLA, a major resource for the cosmochemical community.

Wasson, John T.↗

A Partitioned - Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a platform for multiscale modeling of composites which can perform analysis of materials with any arbitrary number of length scales. The platform supports modularity, scalability, and interoperability using recursive procedures and data structures. A Macro solver driven parallelization scheme often limits the capability of NASMAT to scale as it has access to limited memory and number of cores (often one core/thread) and often forces to implement macro solver specific changes to the platform. In this work, a partitioned task-parallel approach is adopted, where the parallelization strategy adopted for NASMAT is independent of the macro solver and the computational resources are managed independently. The programming architecture takes into account the hierarchy of multiple scales (task-dependence) and the heterogeneous nature (dynamic load balancing) of computation through implementation of a hierarchy-informed task parallel model. The partitioned nature of the framework further extends the “plug and play” capability of NASMAT. preCICE, an open-source library for coupling multiphysics solver in a partitioned manner, is adopted to integrate NASMAT with an external macro solver by implementing a NASMAT adapter for preCICE. Speedup and scalability of the framework is studied for micromechanical models of varying size.

task-parallel↗

Interaction of Airspace Partitions and Traffic Flow Management Delay

To ensure that air traffic demand does not exceed airport and airspace capacities, traffic management restrictions, such as delaying aircraft on the ground, assigning them different routes and metering them in the airspace, are implemented. To reduce the delays resulting from these restrictions, revising the partitioning of airspace has been proposed to distribute capacity to yield a more efficient airspace configuration. The capacity of an airspace partition, commonly referred to as a sector, is limited by the number of flights that an air traffic controller can safely manage within the sector. Where viable, re-partitioning of the airspace distributes the flights over more efficient sectors and reduces individual sector demand. This increases the overall airspace efficiency, but requires additional resources in some sectors in terms of controllers and equipment, which is undesirable. This study examines the tradeoff of the number of sectors designed for a specified amount of traffic in a clear-weather day and the delays needed for accommodating the traffic demand. Results show that most of the delays are caused by airport arrival and departure capacity constraints. Some delays caused by airspace capacity constraints can be eliminated by re-partitioning the airspace. Analyses show that about 360 high-altitude sectors, which are approximately today s operational number of sectors of 373, are adequate for delays to be driven solely by airport capacity constraints for the current daily air traffic demand. For a marginal increase of 15 seconds of average delay, the number of sectors can be reduced to 283. In addition, simulations of traffic growths of 15% and 20% with forecasted airport capacities in the years 2018 and 2025 show that delays will continue to be governed by airport capacities. In clear-weather days, for small increases in traffic demand, increasing sector capacities will have almost no effect on delays.

Palopo, Kee↗

Efficient Use of Distributed Systems for Scientific Applications

Distributed computing has been regarded as the future of high performance computing. Nationwide high speed networks such as vBNS are becoming widely available to interconnect high-speed computers, virtual environments, scientific instruments and large data sets. One of the major issues to be addressed with distributed systems is the development of computational tools that facilitate the efficient execution of parallel applications on such systems. These tools must exploit the heterogeneous resources (networks and compute nodes) in distributed systems. This paper presents a tool, called PART, which addresses this issue for mesh partitioning. PART takes advantage of the following heterogeneous system features: (1) processor speed; (2) number of processors; (3) local network performance; and (4) wide area network performance. Further, different finite element applications under consideration may have different computational complexities, different communication patterns, and different element types, which also must be taken into consideration when partitioning. PART uses parallel simulated annealing to partition the domain, taking into consideration network and processor heterogeneity. The results of using PART for an explicit finite element application executing on two IBM SPs (located at Argonne National Laboratory and the San Diego Supercomputer Center) indicate an increase in efficiency by up to 36% as compared to METIS, a widely used mesh partitioning tool. The input to METIS was modified to take into consideration heterogeneous processor performance; METIS does not take into consideration heterogeneous networks. The execution times for these applications were reduced by up to 30% as compared to METIS. These results are given in Figure 1 for four irregular meshes with number of elements ranging from 30,269 elements for the Barth5 mesh to 11,451 elements for the Barth4 mesh. Future work with PART entails using the tool with an integrated application requiring distributed systems. In particular this application, illustrated in the document entails an integration of finite element and fluid dynamic simulations to address the cooling of turbine blades of a gas turbine engine design. It is not uncommon to encounter high-temperature, film-cooled turbine airfoils with 1,000,000s of degrees of freedom. This results because of the complexity of the various components of the airfoils, requiring fine-grain meshing for accuracy. Additional information is contained in the original.

Taylor, Valerie↗

Static assignment of complex stochastic tasks using stochastic majorization

We consider the problem of statically assigning many tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have identical behavior. We show how the theory of majorization can be used to obtain a partial order among possible task assignments. Our results show that if the vector of numbers of tasks assigned to each processor under one mapping is majorized by that of another mapping, then the former mapping is better than the latter with respect to a large number of objective functions. In particular, we show how measurements of finishing time, resource utilization, and reliability are all captured by the theory. We also show how the theory may be applied to the problem of partitioning a pool of processors for distribution among parallelizable tasks.

Nicol, David↗

Integration of domain and resource-based reasoning for real-time control in dynamic environments

A real-time software controller that successfully integrates domain-based and resource-based control reasoning to perform task execution in a dynamically changing environment is described. The design of the controller is based on the concept of partitioning the process to be controlled into a set of tasks, each of which achieves some process goal. It is assumed that, in general, there are multiple ways (tasks) to achieve a goal. The controller dynamically determines current goals and their current criticality, choosing and scheduling tasks to achieve those goals in the time available. It incorporates rule-based goal reasoning, a TMS-based criticality propagation mechanism, and a real-time scheduler. The controller has been used to build a knowledge-based situation assessment system that formed a major component of a real-time, distributed, cooperative problem solving system built under DARPA contract. It is also being employed in other applications now in progress.

Morgan, Keith↗

Programming in a proposed 9X distributed Ada

The studies of the proposed Ada 9X constructs for distribution, now referred to as AdaPT are reported. The goals for this time period were to revise the chosen example scenario and to begin studying about how the proposed constructs might be implemented. The example scenario chosen is the Submarine Combat Information Center (CIC) developed by IBM for the Navy. The specification provided by IBM was preliminary and had several deficiencies. To address these problems, some changes to the scenario specification were made. Some of the more important changes include: (1) addition of a system database management function; (2) addition of a fourth processing unit to the standard resources; (3) addition of an operator console interface function; and (4) removal of the time synchronization function. To implement the CIC scenario in AdaPT, the decided strategy were publics, partitions, and nodes. The principle purpose for implementing the CIC scenario was to demonstrate how the AdaPT constructs interact with the program structure. While considering ways that the AdaPt constructs might be translated to Ada 83, it was observed that the partition construct could reasonably be modeled as an abstract data type. Although this gives a useful method of modeling partitions, it does not at all address the configuration aspects on the node construct.

Waldrop, Raymond S.↗

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Singh, Jatinder↗

Intelligent pipelined control architecture for remote robotic applications

A new pipelined architecture for autonomous and semiautonomous space robotics systems is described. The architecture uses new concepts which significantly facilitate the overall system performance and leads to an effective functional partitioning between base and remote parts of the system. The base system which is based on a set of parameterized primitives, provides detailed planning and the remote site provides final command binding and resource management. The primitives are then directed to the intelligent manipulation controllers that perform the required manipulation. A proof-of-principle implementation at the JPL Telerobotic laboratory demonstrated the practical efficiency of the pipelined architecture in the context of supervised autonomous robotics operations.

Lokshin, A.↗

Method for resource control in parallel environments using program organization and run-time support

A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Ekanadham, Kattamuri↗