Search NASA⌕ Search

SEARCH · Search NASA

Results for “communication volume”

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 55 records · Page 3

A study of digital holographic filters generation. Phase 2: Digital data communication system, volume 1

An empirical study of the performance of the Viterbi decoders in bursty channels was carried out and an improved algebraic decoder for nonsystematic codes was developed. The hybrid algorithm was simulated for the (2,1), k = 7 code on a computer using 20 channels having various error statistics, ranging from pure random error to pure bursty channels. The hybrid system outperformed both the algebraic and the Viterbi decoders in every case, except the 1% random error channel where the Viterbi decoder had one bit less decoding error.

Ingels, F. M.↗

Concepts for 18/30 GHz satellite communication system, volume 1A: Appendix

The following are appended: (1) Propagation phenomena and attenuation models; (2) Models and measurements of rainfall patterns in the U.S.; (3) Millimeter wave propagation experiments; (4) Comparison of the theory and Millimeter wave propagation experiments; (4) Comparison of theory and experiment; (5) A practical rain attenuation model for CONUS; (6) Space diversity; (7) Values of attenuation for selected U.S. cities; and (8) Additional considerations.

Jorasch, R.↗

Automated Performance Prediction of Message-Passing Parallel Programs

The increasing use of massively parallel supercomputers to solve large-scale scientific problems has generated a need for tools that can predict scalability trends of applications written for these machines. Much work has been done to create simple models that represent important characteristics of parallel programs, such as latency, network contention, and communication volume. But many of these methods still require substantial manual effort to represent an application in the model's format. The NIK toolkit described in this paper is the result of an on-going effort to automate the formation of analytic expressions of program execution time, with a minimum of programmer assistance. In this paper we demonstrate the feasibility of our approach, by extending previous work to detect and model communication patterns automatically, with and without overlapped computations. The predictions derived from these models agree, within reasonable limits, with execution times of programs measured on the Intel iPSC/860 and Paragon. Further, we demonstrate the use of MK in selecting optimal computational grain size and studying various scalability metrics.

Block, Robert J.↗

Automated Performance Prediction of Message Passing Parallel Programs

As the trend toward massively parallel processing continues, the need for tools that can predict scalability trends becomes greater. While high level languages Eke HPF have come into greater use, explicit message-passing programs proliferate, and will probably do so for some time, thanks to the onslaught of standards such as MPI. Much work has been done to create simple models that represent important characteristics of parallel programs, such as latency, network contention, and communication volume. But many of these methods still require a substantial manual effort to represent an application in the model's format. The YAPP ("Yet Another Performance Predictor") tool is an attempt to automate the formation of first-order expressions for completion time, with a minimum of programmer assistance. The content of this paper is as follows: First, we explore the implementation details of YAPP, and illustrate with examples some of the reasons that automatic prediction is difficult. In the following sections, we present the results of four applications, using execution traces on the Intel i860, analyze the error in YAPP's predictions, explain the limitations of our implementation, and mention possible future additions. In particular, we illustrate techniques used to identify pipeline communication patterns, and demonstrate how compiler analysis and regression are combined to automate the prediction process.

Block, Robert J.↗

ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems

The k-dimensional Weisfeiler-Lehman (k-WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k-WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k-WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k-WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k-WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques.

algorithims↗

Measurement Adequacy for Monitoring Data Center Oscillations

Artificial intelligence (AI) training data centers with periodic load profiles can induce sustained grid oscillations across a wide frequency range, making accurate monitoring essential for reliable power system operation. This report evaluates the adequacy of existing measurement systems for monitoring such oscillations, focusing on phasor measurement units (PMUs) and point-on-wave (POW) measurement systems. The analysis shows that while PMUs are highly effective for monitoring low-frequency electromechanical oscillations, they have inherent limitations in accurately representing higher-frequency oscillations due to constraints imposed by reporting rates and the bandwidth of phasor estimation filters. Even when configured with higher reporting rates, the filtering inherent in the phasor estimation process can significantly attenuate oscillation magnitudes, potentially leading to underestimation of oscillatory behavior. This has important implications for compliance and performance monitoring of large loads. To address the limitations associated with PMU-based monitoring, the report examines the use of high-resolution POW measurements, which can capture oscillations across a broader frequency range. However, continuous POW monitoring introduces practical challenges related to large data volumes, communication bandwidth, and real-time data processing. For this reason, the report also discusses emerging approaches that use POW measurements as a complementary capability alongside PMUs to improve observability of oscillations from large data center loads.

47 OTHER INSTRUMENTATION↗

A preliminary assessment of the self-induced environment and contamination of the Space Telescope

Preliminary estimates for the internal pressures and surface contamination of the Space Telescope were made. The calculations for the transient pressures in the aft-shroud and telescope compartments considered two large communicating volumes that contain gaseous sources and sinks. The outgassing sources in the aft shroud consist of several scientific instruments, paints, insulations, and graphite-epoxy structures. With the exception of the instruments, these sources also exist in the telescope compartment. the outgassing functions were generated from ample test results at various temperatures and from internal pressure measurements in a vacuum test of one of the instruments. The venting occurs through combinations of series and parallel passages in both compartments. The calculated time constant of the two volumes and their respective passages, with the telescope protective door closed, is a few seconds, which is slightly less than that of the shuttle bay volume with the bay doors closed. With the telescope door closed, the pressures in the two compartments should decay to about 1OE-5 torr in about 200 hours. The contaminant deposits were assessed on the basis of expected partial pressures of the contaminant fraction of the outgassing. These pressures and the activation energies of the source materials were used to calculate the adsorbed and condensed deposits on the surfaces as a function of time.

Scialdone, J. J.↗

Improved load distribution in parallel sparse Cholesky factorization

Compared to the customary column-oriented approaches, block-oriented, distributed-memory sparse Cholesky factorization benefits from an asymptotic reduction in interprocessor communication volume and an asymptotic increase in the amount of concurrency that is exposed in the problem. Unfortunately, block-oriented approaches (specifically, the block fan-out method) have suffered from poor balance of the computational load. As a result, achieved performance can be quite low. This paper investigates the reasons for this load imbalance and proposes simple block mapping heuristics that dramatically improve it. The result is a roughly 20% increase in realized parallel factorization performance, as demonstrated by performance results from an Intel Paragon system. We have achieved performance of nearly 3.2 billion floating point operations per second with this technique on a 196-node Paragon system.

Rothberg, Edward↗

Requirements for a mobile communications satellite system. Volume 2: Technical report

Three types of satellite aided mobile communications are considered for users in areas not served by (terrestrial) cellular radio systems. In system 1, mobile units are provided a direct satellite link to a gateway station, which serves as the interface to the terrestrial toll network. In system 2, a terrestrial radio link similar to those in cellular systems connects the mobile unit to a translator station; each translator relays the traffic from mobile units in its vicinity, via satellite, to the regional gateway. It is not feasible for system 2 to provide obiquitous coverage. Therefore, system 3 is introduced, in which the small percentage of users not within range of a translator are provided a direct satellite link as in system 1.

Horstein, M.↗

Requirements for a mobile communications satellite system. Volume 1: Executive summary

Three types of satellite-aided mobile communications are considered for users in areas not served by (terrestrial) cellular radio systems. In System 1, mobile units are provided a direct satellite link to a gateway station, which serves as the interface to the terrestrial toll network. In System 2, a terrestrial radio link similar to those in cellular systems connects the mobile unit to a translator station; each translator relays the traffic from mobile units in its vicinity, via satellite, to the regional gateway. It is not feasible for System 2 to provide ubiquitous coverage. Therefore, System 3 is introduced, in which the small percentage of users not within range of a translator are provided a direct satellite link as in System 1. While System 2 can operate with leased satellite capacity, Systems 1 and 3 require a dedicated satellite. A major portion of this study is concerned with the design of a satellite for System 1. A weight limit of 10,000 lbs, corresponding to the projected 1990 STS capability, is imposed on the design. Frequency re-use of the allocated spectrum, through multiple satellite beams, is employed to generate the specified system capacity. Both offset-fed and center-fed reflectors are considered. For an assumed 10-MHz allocation and a population of 350,000 subscribers, a two-satellite system is required. The reflector diameters corresponding to offset-fed and center-fed geometries are 46 m and 62 m, respectively. Thus, large-space-structure technology is inherent to the implementation of System 1. In addition to establishing the technical requirements for the three types of satellite systems, the monthly service charge needed to provide a specified return on invested capital is computed. A net present value analysis is used for this purpose.

Source record↗