Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer networks.”

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 73 records · Page 4

Structure Slicing: Extending Logical Regions with Fields, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Applications on modern supercomputers are increasingly limited by the cost of data movement, but mainstream programming systems have few abstractions for describing the structure of a program's data. Consequently, the burden of managing data movement, placement, and layout currently falls primarily upon the programmer. To address this problem we previously proposed a data model based on logical regions and described Legion, a programming system incorporating logical regions. In this paper, we present structure slicing, which incorporates fields into the logical region data model. We show that structure slicing enables Legion to automatically infer task parallelism from field non-interference, decouple the specification of data usage from layout, and reduce the overall amount of data moved. We demonstrate that structure slicing enables both strong and weak scaling of three Legion applications including S3D, a production combustion simulation that uses logical regions with thousands of fields, with speedups of up to 3.68X over a vectorized CPU-only Fortran implementation and 1.88X over an independently hand-tuned OpenACC code.

Computer Science↗

Using cross-layer adaptations for dynamic data management in large scale coupled scientific workflows, In: SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

As system scales and application complexity grow, managing and processing simulation data has become a significant challenge. While recent approaches based on data staging and in-situ/in-transit data processing are promising, dynamic data volumes and distributions, such as those occurring in AMR-based simulations, make the efficient use of these techniques challenging. In this paper we propose cross-layer adaptations that address these challenges and respond at runtime to dynamic data management requirements. Specifically we explore (1) adaptations of the spatial resolution at which the data is processed, (2) dynamic placement and scheduling of data processing kernels, and (3) dynamic allocation of in-transit resources. We also exploit coordinated approaches that dynamically combine these adaptations at the different layers. We evaluate the performance of our adaptive cross-layer management approach on the Intrepid IBM-BlueGene/P and Titan Cray-XK7 systems using Chombo-based AMR applications, and demonstrate its effectiveness in improving overall time-to-solution and increasing resource efficiency.

Computer Science↗

Physics-based seismic hazard analysis on petascale heterogeneous supercomputers, In: SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

We have developed a highly scalable and efficient GPU-based finite-difference code (AWP) for earthquake simulation that implements high throughput, memory locality, communication reduction and communication/computation overlap and achieves linear scalability on Cray XK7 Titan at ORNL and NCSA's Blue Waters system. We simulate realistic 0-10 Hz earthquake ground motions relevant to building engineering design using high-performance AWP. Moreover, we show that AWP provides a speedup by a factor of 110 in key strain tensor calculations critical to probabilistic seismic hazard analysis (PSHA). These performance improvements to critical scientific application software, coupled with improved co-scheduling capabilities of our workflow-managed systems, make a statewide hazard model a goal reachable with existing supercomputers. The performance improvements of GPU-based AWP are expected to save millions of core-hours over the next few years as physics-based seismic hazard analysis is developed using heterogeneous petascale supercomputers.

Computer Science↗

In-Situ Feature Extraction of Large Scale Combustion Simulations Using Segmented Merge Trees, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

The ever increasing amount of data generated by scientific simulations coupled with system I/O constraints are fueling a need for in-situ analysis techniques. Of particular interest are approaches that produce reduced data representations while maintaining the ability to redefine, extract, and study features in a post-process to obtain scientific insights. This paper presents two variants of in-situ feature extraction techniques using segmented merge trees, which encode a wide range of threshold based features. The first approach is a fast, low communication cost technique that generates an exact solution but has limited scalability. The second is a scalable, local approximation that nevertheless is guaranteed to correctly extract all features up to a predefined size. We demonstrate both variants using some of the largest combustion simulations available on leadership class supercomputers. Our approach allows state-of-the-art, feature-based analysis to be performed in-situ at significantly higher frequency than currently possible and with negligible impact on the overall simulation runtime.

Computer Science↗

Deadlock-free class routes for collective communications embedded in a multi-dimensional torus network

A computer implemented method and a system for routing data packets in a multi-dimensional computer network. The method comprises routing a data packet among nodes along one dimension towards a root node, each node having input and output communication links, said root node not having any outgoing uplinks, and determining at each node if the data packet has reached a predefined coordinate for the dimension or an edge of the subrectangle for the dimension, and if the data packet has reached the predefined coordinate for the dimension or the edge of the subrectangle for the dimension, determining if the data packet has reached the root node, and if the data packet has not reached the root node, routing the data packet among nodes along another dimension towards the root node.

97 MATHEMATICS AND COMPUTING↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Handicap Principle, Strategic Information Warfare and the Paradox of Asymmetry

The term asymmetric threat (or warfare) often refers to tactics utilized by countries, terrorist groups, or individuals to carry out attacks on a superior opponent while trying to avoid direct confrontation. Information warfare is sometimes also referred to as a type of asymmetric warfare perhaps due to its asymmetry in terms of cost and efficacy. Obviously, there are differences and commonalities between two types of asymmetric warfare. One major difference lies in the goal to avoid confrontation and one commonality is the asymmetry. Regardless, the unique properties surrounding asymmetric warfare warrant a strategic-level study. Despite enormous studies conducted in the last decade, a consensus on the strategy a nation state should take to deal with asymmetric threat seems still intriguing. In this article, we try to shed some light on the issue from the handicap principle in the context of information warfare. The Handicap principle was first proposed by Zahavi (1975) to explain the honesty or reliability of animal communication signals. He argued that in a signaling system such as one used in mate selection, a superior male is able to signal with a highly developed "handicap" to demonstrate its quality, and the handicap serves "as a kind of (quality) test imposed on the individual" (Zahavi 1975, Searcy and Nowicki 2005). The underlying thread that inspires us for the attempt to establish a connection between the two apparently unrelated areas is the observation that competition, communication and cooperation (3C), which are three fundamental processes in nature and against which natural selection optimize living things, may also make sense in human society. Furthermore, any communication networks, whether it is biological networks (such as animal communication networks) or computer networks (such as the Internet) must be reasonably reliable (honest in the case of animal signaling) to fulfill its missions for transmitting and receiving messages. The strategic goal of information warfare is then to destroy or defend the reliability (honesty) of communication networks. The handicap principle that governs the reliability (honesty) of animal communication networks can be considered as the nature s version of information warfare strategy because it is a product of natural selection. What is particularly interesting is to transfer the evolutionary game theory models [e.g., Sir Philip Sydney (SPS) game] for the handicap principle to the study of information warfare. In a broad perspective, we realize that the handicap principle may actually contradict the principle of asymmetry in asymmetric warfare. Anyway, not every species of animals has evolved expensive signaling equipments like male peacocks (whose exaggerated train is an example of handicap). Furthermore, the handicap principle is not only about communication, and it also embodies the spirits of cooperation and competition. In human societies, communication modulates cooperation and competition; so does in animal communication networks. Therefore, to evolve or maintain a sustainable communication network, the proper strategy should be to balance (modulate) the cooperation and competition with communication tools (information warfare tools), which is perhaps in contradiction with the asymmetric strategy. There might be a paradox in the strategy of asymmetric warfare, and whether or not information warfare can be used as an asymmetric tool is still an open question.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Collaborative Visualization: Definition, Challenges, and Research Agenda

Collaborative visualization has emerged as a new research direction which offers the opportunity to reach new audiences and application areas for visualization tools and techniques. Technology now allows us to easily connect and collaborate with one another - in settings as diverse as over networked computers, across mobile devices, or using shared displays such as interactive walls and tabletop surfaces. Any of these collaborative settings carries a set of challenges and opportunities for visualization research. Digital information is already regularly accessed by multiple people together in order to share information, to view it together, to analyze it, or to form decisions. However, research on how to best support collaboration with and around visualizations is still in its infancy and has so far focused only on a small subset of possible application scenarios. The purpose of this article is (1) to provide a clear scope, definition, and overview of the evolving field of collaborative visualization, (2) to help pinpoint the unique focus of collaborative visualization with its specific aspects, challenges, and requirements within the intersection of general computer-supported collaborative work (CSCW) and visualization research, and (3) to draw attention to important future research questions to be addressed by the community. Thus, the goal of the paper is to discuss a research agenda for future work on collaborative visualization, including our vision for how to meet the grand challenge and to urge for a new generation of visualization tools that were designed with collaboration in mind from their very inception.

99 GENERAL AND MISCELLANEOUS↗

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗