Search NASA⌕ Search

SEARCH · Search NASA

Results for “Communication costs”

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

An advanced geostationary communications platform

A large geostationary communications platform can offer many attractive possibilities for providing lower cost communications. The platform payload concept described in this paper attempts to exploit these possibilities. The use of a combination of spot and wide-area coverage beams accommodates users in both high- and low-density population areas, and provides a good degree of frequency reuse. A standard channel bandwidth, used for most traffic, facilitates interconnectivity among C-, Ku-, and Ka-band users who may all access the platform. Adoption of a 36-MHz channel bandwidth leads to transmission rates that would be easily handled by low-cost terminals providing direct customer premises service. This also lends itself well to a solution using a large number of solid-state power amplifiers operating in all three frequency bands and sharing a common, redundant, conditioned power supply.

Hawkes, Thaddeus A.↗

Development and Characterization of a Small Spacecraft Electro-Optic Scanner for Free-Space Laser Communications

Emergent data-intensive missions coupled with dramatic reductions in spacecraft size plus an increasing number of space-based missions necessitates new high performance, compact and low cost communications technology. Free space optical communications offer advantages including orders of magnitude increase for data rate performance, increased security, immunity to jamming and lack of frequency allocation requirements when compared with conventional radio frequency (RF) means. The spatial coherence and low divergence associated with the optical frequencies of laser communications lends themselves to superior performance, but this increased directionality also creates one of the primary technical challenges in establishing a laser communications link by repeatedly and reliably pointing the beam onto the receive aperture. Several solutions have emerged from wide angle (slow) mechanical articulation systems, fine (fast) steering mirrors and rotating prisms, inertial compensation gyros and vibration isolation cancellation systems, but each requires moving components and imparts a measured amount of burden on the host platform. The complexity, cost and size of current mechanically scanned solutions limits their platform applicability, and restricts the feasibility of deploying optical communications payloads on very compact spacecraft employing critical systems. A high speed, wide angle, non-mechanical solution is therefore desirable. The purpose of this work is to share the development, testing, and demonstration of a breadboard prototype electro-optic (EO) scanned laser-communication link (see Figure 1). This demonstration is a step toward realizing ultra-low Size, Weight and Power (SWaP) SmallSat/MicroSat EO non-mechanical laser beam steering modules for high bandwidth ( greater than Gbps) free-space data links operating in the 1550 nm wavelength bands. The elimination of all moving parts will dramatically reduce SWaP and cost, increase component lifetime and reliability, and simplify the system design of laser communication modules. This paper describes the target mission architectures and requirements (few cubic centimeters of volume, 10's of grams of weight with milliwatts of power) and design of the beam steering module. Laboratory metrology is used to determine the component performance including horizontal and vertical resolution (20urad) as a function of control voltage (see Figure 2), transition time (0.1-1ms), pointing repeatability and optic insertion loss. A test bed system demonstration, including a full laser communications link, is conducted. The capabilities of this new EO beam steerer provide an opportunity to dramatically improve space communications through increased utilization of laser technology on smaller platforms than were previously attainable.

Laser Optical Communications↗

Retargeting of existing FORTRAN program and development of parallel compilers

The software models used in implementing the parallelizing compiler for the B-HIVE multiprocessor system are described. The various models and strategies used in the compiler development are: flexible granularity model, which allows a compromise between two extreme granularity models; communication model, which is capable of precisely describing the interprocessor communication timings and patterns; loop type detection strategy, which identifies different types of loops; critical path with coloring scheme, which is a versatile scheduling strategy for any multicomputer with some associated communication costs; and loop allocation strategy, which realizes optimum overlapped operations between computation and communication of the system. Using these models, several sample routines of the AIR3D package are examined and tested. It may be noted that automatically generated codes are highly parallelized to provide the maximized degree of parallelism, obtaining the speedup up to a 28 to 32-processor system. A comparison of parallel codes for both the existing and proposed communication model, is performed and the corresponding expected speedup factors are obtained. The experimentation shows that the B-HIVE compiler produces more efficient codes than existing techniques. Work is progressing well in completing the final phase of the compiler. Numerous enhancements are needed to improve the capabilities of the parallelizing compiler.

Agrawal, Dharma P.↗

Space network support for lunar communications

The space network can provide high data rate lunar communications as an alternative or adjunct to an expansion of the deep space network. Use of a space-based system can provide continuous coverage for lunar users and reduce terrestrial communication costs by delivering data directly to a single domestic location. Adapting the space network for lunar communications support would also maximize the use of the existing and planned space network and Space Station infrastructure. Several alternative architectures are evaluated.

Jordan, Michael A.↗

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗

Pathfinder Technology Demonstrator: GlobalStar Testing and Results

The communications subsystem of a spacecraft is typically a SWaP (size, weight, and power) intensive subsystem in a SWaP constrained environment such as a CubeSat. Use of a satellite-based communication system, such as GlobalStars duplex GSP-1720 radio is a low SWaP potentially game-changing low-cost communication subsystem solution that was evaluated for feasibility for the NASA Pathfinder Technology Demonstrator (PTD) project. The PTD project is a series of 6U CubeSat missions to flight demonstrate and characterize novel small satellite payloads in low Earth orbit. GlobalStar is a low Earth orbit satellite constellation for satellite phone and low-speed data communications, and the GSP-1720 is their single board duplex radio most commonly used in satellite phones and shipment tracking devices. The PTD project tested the GSP-1720 to characterize its viability for flight using NASA GEVS (General Environmental Verification Standard) vibration and thermal vacuum levels, as well as testing the uplink-downlink connectivity, data throughput, and file transfer capabilities. This presentation will present the results of the environmental and capability testing of the GSP-1720 performed at NASA Ames Research Center, as well as the viability for CubeSat use in LEO.

satellite communication↗

Performance evaluation of a simulated data-flow computer with low-resolution actors

Basic problems related to the exploitation of parallelism in a program include sequencing of the instructions and communication of the data. It is pointed out that the data-flow approach offers an elegant solution to the sequencing problem, since all data dependencies are automatically handled and only instructions with ready input sets are activated. It is shown that a change in the level of subcomputations (actors) affects communications costs. The concept of variable resolution is discussed, and the testbed environment is examined. Attention is given to the architecture of the processing elements, the communication network, and the simulators. A description of the analytical model is also provided. Simulation and results are discussed, taking into account test programs and allocation, the variation of the number of processing elements, the variation of the resolution in directed acyclic graphs, performance in processing loops, and array handling.

Gaudiot, J. L.↗

Systems engineering and integration: Cost estimation and benefits analysis

Space Transportation Avionics hardware and software cost has traditionally been estimated in Phase A and B using cost techniques which predict cost as a function of various cost predictive variables such as weight, lines of code, functions to be performed, quantities of test hardware, quantities of flight hardware, design and development heritage, complexity, etc. The output of such analyses has been life cycle costs, economic benefits and related data. The major objectives of Cost Estimation and Benefits analysis are twofold: (1) to play a role in the evaluation of potential new space transportation avionics technologies, and (2) to benefit from emerging technological innovations. Both aspects of cost estimation and technology are discussed here. The role of cost analysis in the evaluation of potential technologies should be one of offering additional quantitative and qualitative information to aid decision-making. The cost analyses process needs to be fully integrated into the design process in such a way that cost trades, optimizations and sensitivities are understood. Current hardware cost models tend to primarily use weights, functional specifications, quantities, design heritage and complexity as metrics to predict cost. Software models mostly use functionality, volume of code, heritage and complexity as cost descriptive variables. Basic research needs to be initiated to develop metrics more responsive to the trades which are required for future launch vehicle avionics systems. These would include cost estimating capabilities that are sensitive to technological innovations such as improved materials and fabrication processes, computer aided design and manufacturing, self checkout and many others. In addition to basic cost estimating improvements, the process must be sensitive to the fact that no cost estimate can be quoted without also quoting a confidence associated with the estimate. In order to achieve this, better cost risk evaluation techniques are needed as well as improved usage of risk data by decision-makers. More and better ways to display and communicate cost and cost risk to management are required.

Dean, ED↗

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

Applications and development of communication models for the touchstone GAMMA and DELTA prototypes

The goal of this project was to develop models of the interconnection networks of the Intel iPSC/860 and DELTA multicomputers to guide the design of efficient algorithms for interprocessor communication in problems that commonly occur in CFD codes and other applications. Interprocessor communication costs of codes for message-passing architectures such as the iPSC/860 and DELTA significantly affect the level of performance that can be obtained from those machines. This project addressed several specific problems in the achievement of efficient communication on the Intel iPSC/860 hypercube and DELTA mesh. In particular, an efficient global processor synchronization algorithm was developed for the iPSC/860 and numerous broadcast algorithms were designed for the DELTA.

Seidel, Steven R.↗

A phased array tracking antenna for vehicles

An antenna system including antenna elements and a satellite tracking method is considered a key technology in implementing land mobile satellite communications. In the early stage of land mobile satellite communications, a mechanical tracking antenna system is considered the best candidate for vehicles, however, a phased array antenna will replace it in the near future, because it has many attractive advantages such as a low and compact profile, high speed tracking, and potential low cost. Communications Research Laboratory is now developing a new phased array antenna system for land vehicles based on research experiences of the airborne phased array antenna, which was developed and evaluated in satellite communication experiments using the ETS-V satellite. The basic characteristics of the phased array antenna for land vehicles are described.

Ohmori, Shingo↗

A simple hyperbolic model for communication in parallel processing environments

We introduce a model for communication costs in parallel processing environments called the 'hyperbolic model,' which generalizes two-parameter dedicated-link models in an analytically simple way. Dedicated interprocessor links parameterized by a latency and a transfer rate that are independent of load are assumed by many existing communication models; such models are unrealistic for workstation networks. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes that initiate the sending and receiving of the information and in which internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. The direction of graph edges specifies the flow of the information carried through messages. Each CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. The parameters are evaluated in the limits of very large and very small messages. Rules are given for reducing a communication graph consisting of many to an equivalent two-parameter form, while maintaining an approximation for the service time that is exact in both large and small limits. The model is validated on a dedicated Ethernet network of workstations by experiments with communication subprograms arising in scientific applications, for which a tight fit of the model predictions with actual measurements of the communication and synchronization time between end processes is demonstrated. The model is then used to evaluate the performance of two simple parallel scientific applications from partial differential equations: domain decomposition and time-parallel multigrid. In an appropriate limit, we also show the compatibility of the hyperbolic model with the recently proposed LogP model.

Stoica, Ion↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Low-Cost Large Aperture Telescopes for Optical Communications

Low-cost, 0.5-1 meter ground apertures are required for near-Earth laser communications. Low-cost ground apertures with equivalent diameters greater than 10 meters are desired for deep-space communications. This presentation focuses on identifying schemes to lower the cost of constructing networks of large apertures while continuing to meet the requirements for laser communications. The primary emphasis here is on the primary mirror. A slumped glass spherical mirror, along with passive secondary mirror corrector and active adaptive optic corrector show promise as a low-cost alternative to large diameter monolithic apertures. To verify the technical performance and cost estimate, development of a 1.5-meter telescope equipped with gimbal and dome is underway.

optical communications↗

Avionics and Power Management for Low-Cost High-Altitude Balloon Science Platforms

High-altitude balloons (HABs) have become popular as educational and scientific platforms for planetary research. This document outlines key components for missions where low cost and rapid development are desired. As an alternative to ground-based vacuum and thermal testing, these systems can be flight tested at comparable costs. Communication, solar, space, and atmospheric sensing experiments often require environments where ground level testing can be challenging or impossible in certain cases. When performing HAB research the ability to monitor the status of the platform and gather data is key for both scientific and recoverability aspects of the mission. A few turnkey platform solutions are outlined that leverage rapidly evolving open-source engineering ecosystems. Rather than building custom components from scratch, these recommendations attempt to maximize simplicity and cost of HAB platforms to make launches more accessible to everyone.

Avionics↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Zhang, Hong↗