Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cluster Computing”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next- generation scientific applications. We propose a new scheme — Edge Neural Network — for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

36 MATERIALS SCIENCE↗
DOE OSTI2019

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next-generation scientific applications. We propose a new scheme — Edge Neural Network — for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

Ojika, David↗
DOE OSTI2019

PCS: A Productive Computational Science Platform

As modern supercomputers continue to be increasingly heterogeneous with diverse computational accelerators, software becomes a critical aspect necessary to fully exploit these accelerators while not increasing the effort and time required to make variable scientific discovery in the face of complicated programming environments introduced by these accelerators. This paper presents PCS, a productive computational science platform for cluster-scale heterogeneous computing. The PCS platform by design follows a basic principle that, multiple programming models in a unified programming environment, is essential to facilitate large-scale, accelerator-aware, heterogeneous computing for next- generation scientific applications. We propose a new scheme - Edge Neural Network - for managing regularity in large dataflow graphs using higher-order bulk synchronous operators, providing a foundation for formalizing computational models for cluster-wide dataflow programming of heterogeneous clusters.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Superposition of Fragment Excitations for Excited States of Large Clusters with Application to Helium Clusters

We develop a local excited-state method, based on the configuration interaction singles (CIS) wave function, for large atomic and molecular clusters. This method exploits the properties of absolutely localized molecular orbitals (ALMOs), which strictly limits the total number of excitations, and results in formal scaling with the third power of the system size for computing the full spectrum of ALMO-CIS excited states. Here, the derivation of the equations and design of the algorithm are discussed in detail, with particular emphasis on the computational scaling. Clusters containing ~500 atoms were used in evaluating the scaling, which agrees with the theoretical predictions, and the accuracy of the method is evaluated with respect to standard CIS. Finally, a pioneering application to the size dependence of the helium cluster spectrum is also presented for clusters of 25-231 atoms, the largest of which results in the computation of 2310 excited states per sampled cluster geometry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Exploring Parameter Redundancy in the Unitary Coupled-Cluster Ansätze for Hybrid Variational Quantum Computing

One of the commonly used chemical-inspired approaches in variational quantum computing is the unitary coupled-cluster (UCC) ansatze. Despite being a systematic way of approaching the exact limit, the number of parameters in the standard UCC ansatze exhibits unfavorable scaling with respect to the system size, hindering its practical use on near-term quantum devices. Efforts have been taken to propose some variants of UCC ansatze with better scaling. In this paper we explore the parameter redundancy in the preparation of unitary coupled-cluster singles and doubles (UCCSD) ansatze employing spin-adapted formulation, small amplitude filtration, and entropy-based orbital selection approaches. Numerical results of using our approach on some small molecules have exhibited a significant cost reduction in the number of parameters to be optimized and in the time to convergence compared with conventional UCCSD-VQE simulations. Further, we also discuss the potential application of some machine learning techniques in further exploring the parameter redundancy, providing a possible direction for future studies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Accelerating science: The usage of commercial clouds in ATLAS Distributed Computing

The ATLAS experiment at CERN is one of the largest scientific machines built to date and will have ever growing computing needs as the Large Hadron Collider collects an increasingly larger volume of data over the next 20 years. ATLAS is conducting R&D projects on Amazon Web Services and Google Cloud as complementary resources for distributed computing, focusing on some of the key features of commercial clouds: lightweight operation, elasticity and availability of multiple chip architectures. The proof of concept phases have concluded with the cloud-native, vendoragnostic integration with the experiment’s data and workload management frameworks. Google Cloud has been used to evaluate elastic batch computing, ramping up ephemeral clusters of up to O(100k) cores to process tasks requiring quick turnaround. Amazon Web Services has been exploited for the successful physics validation of the Athena simulation software on ARM processors. We have also set up an interactive facility for physics analysis allowing endusers to spin up private, on-demand clusters for parallel computing with up to 4 000 cores, or run GPU enabled notebooks and jobs for machine learning applications. The success of the proof of concept phases has led to the extension of the Google Cloud project, where ATLAS will study the total cost of ownership of a production cloud site during 15 months with 10k cores on average, fully integrated with distributed grid computing resources and continue the R&D projects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1996

Performance Evaluation in Network-Based Parallel Computing

Network-based parallel computing is emerging as a cost-effective alternative for solving many problems which require use of supercomputers or massively parallel computers. The primary objective of this project has been to conduct experimental research on performance evaluation for clustered parallel computing. First, a testbed was established by augmenting our existing SUNSPARCs' network with PVM (Parallel Virtual Machine) which is a software system for linking clusters of machines. Second, a set of three basic applications were selected. The applications consist of a parallel search, a parallel sort, a parallel matrix multiplication. These application programs were implemented in C programming language under PVM. Third, we conducted performance evaluation under various configurations and problem sizes. Alternative parallel computing models and workload allocations for application programs were explored. The performance metric was limited to elapsed time or response time which in the context of parallel computing can be expressed in terms of speedup. The results reveal that the overhead of communication latency between processes in many cases is the restricting factor to performance. That is, coarse-grain parallelism which requires less frequent communication between processes will result in higher performance in network-based computing. Finally, we are in the final stages of installing an Asynchronous Transfer Mode (ATM) switch and four ATM interfaces (each 155 Mbps) which will allow us to extend our study to newer applications, performance metrics, and configurations.

Dezhgosha, Kamyar↗
DOE OSTI2020

Deconvolute individual genomes from metagenome sequences through short read clustering

Metagenome assembly from short next-generation sequencing data is a challenging process due to its large scale and computational complexity. Clustering short reads by species before assembly offers a unique opportunity for parallel downstream assembly of genomes with individualized optimization. However, current read clustering methods suffer either false negative (under-clustering) or false positive (over-clustering) problems. Here we extended our previous read clustering software, SpaRC, by exploiting statistics derived from multiple samples in a dataset to reduce the under-clustering problem. Using synthetic and real-world datasets we demonstrated that this method has the potential to cluster almost all of the short reads from genomes with sufficient sequencing coverage. The improved read clustering in turn leads to improved downstream genome assembly quality.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

An Integrated Platform for Collaborative Data Analytics

While collaboration among data scientists is a key to organizational productivity, data analysts face significant barriers to achieving this end, including data sharing, accessing and configuring the required computational environment, and a unified method of sharing knowledge. Each of these barriers to collaboration is related to the fundamental question of knowledge management “how can organizations use knowledge more effectively?”. In this paper, we consider the problem of knowledge management in collaborative data analytics and present ShareAL, an integrated knowledge management platform, as a solution to that problem. The ShareAL platform consists of three core components: a full stack web application, a dashboard for analyzing streaming data and a High Performance Computing (HPC) cluster for performing real time analysis. Prior research has not applied knowledge management to collaborative analytics or developed a platform with the same capabilities as ShareAL. ShareAL overcomes the barriers data scientists face to collaboration by providing intuitive sharing of data and analytics via the web application, a shared computing environment via the HPC cluster and knowledge sharing and collaboration via a real time messaging application.

Oesch, T↗
DOE OSTI2020

The Installation of Direct Water-Cooling Systems to Reduce Cooling Energy Requirements for High-Performance Computing Centers

A large cluster of High-Performance Computing (HPC) equipment at the Lawrence Livermore National Laboratory in California was retrofitted with an Asetek cooling system. The Asetek system is a hybrid scheme with water-cooled cold plates on high-heat-producing components in the information technology (IT) equipment, and with the remainder of the heat being removed by conventional air-cooling systems. In order to determine energy savings of the Asetek system, data were gathered and analyzed two ways: using top-down statistical models, and bottom-up engineering models. The cluster, “Cabernet”, rejected its heat into a facilities cooling water loop which in turn rejected the heat into the same chilled water system serving the computer-room air handlers (CRAHs) that provided the air-based cooling for the room. Because the “before” and “after” cases both reject their heat into the chilled water system, the only savings is due to reduction in CRAH fan power. The top-down analysis showed a 4% overall energy savings for the data center (power usage effectiveness (PUE) —the ratio of total data center energy to IT energy— dropped from 1.60 to 1.53, lower is better); the bottom-up analysis showed a 3% overall energy savings (PUE from 1.70 to 1.66) and an 11% savings for the Cabernet system by itself (partial PUE of 1.51). Greater savings, on the order of 15-20%, would be possible if the chilled water system was not used for rejecting the heat from the Asetek system. About 37% of the heat from the Cab system was rejected to the cooling water, lower than at other installations.

Earni, Shankar↗
DOE OSTI2017

THERMODYNAMICS AND CHARGING OF INTERSTELLAR IRON NANOPARTICLES

Interstellar iron in the form of metallic iron nanoparticles may constitute a component of the interstellar dust. We compute the stability of iron nanoparticles to sublimation in the interstellar radiation field, finding that iron clusters can persist down to a radius of ≃4.5 Å, and perhaps smaller. We employ laboratory data on small iron clusters to compute the photoelectric yields as a function of grain size and the resulting grain charge distribution in various interstellar environments, finding that iron nanoparticles can acquire negative charges, particularly in regions with high gas temperatures and ionization fractions. If ≳10% of the interstellar iron is in the form of ultrasmall iron clusters, the photoelectric heating rate from dust may be increased by up to tens of percent relative to dust models with only carbonaceous and silicate grains.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗
DOE OSTI2022

Drugsniffer: An Open Source Workflow for Virtually Screening Billions of Molecules for Binding Affinity to Protein Targets

The SARS-CoV2 pandemic has highlighted the importance of efficient and effective methods for identification of therapeutic drugs, and in particular has laid bare the need for methods that allow exploration of the full diversity of synthesizable small molecules. While classical high-throughput screening methods may consider up to millions of molecules, virtual screening methods hold the promise of enabling appraisal of billions of candidate molecules, thus expanding the search space while concurrently reducing costs and speeding discovery. Here, we describe a new screening pipeline, called drugsniffer, that is capable of rapidly exploring drug candidates from a library of billions of molecules, and is designed to support distributed computation on cluster and cloud resources. As an example of performance, our pipeline required ~40,000 total compute hours to screen for potential drugs targeting three SARS-CoV2 proteins among a library of ~3.7 billion candidate molecules.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Local rewiring algorithms to increase clustering and grow a small world

Abstract Many real-world networks have high clustering among vertices: vertices that share neighbours are often also directly connected to each other. A network’s clustering can be a useful indicator of its connectedness and community structure. Algorithms for generating networks with high clustering have been developed, but typically rely on adding or removing edges and nodes, sometimes from a completely empty network. Here, we introduce algorithms that create a highly clustered network by starting with an existing network and rearranging edges, without adding or removing them; these algorithms can preserve other network properties even as the clustering increases. They rely on local rewiring rules, in which a single edge changes one of its vertices in a way that is guaranteed to increase clustering. This greedy step can be applied iteratively to transform a random network into a form with much higher clustering. Additionally, the algorithms presented grow a network’s clustering faster than they increase its path length, meaning that network enters a regime of comparatively high clustering and low path length: a small world. These algorithms may be a basis for how real-world networks rearrange themselves organically to achieve or maintain high clustering and small-world structure.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

Message Passing vs. Shared Address Space on a Cluster of SMPs

The convergence of scalable computer architectures using clusters of PCs (or PC-SMPs) with commodity networking has become an attractive platform for high end scientific computing. Currently, message-passing and shared address space (SAS) are the two leading programming paradigms for these systems. Message-passing has been standardized with MPI, and is the most common and mature programming approach. However message-passing code development can be extremely difficult, especially for irregular structured computations. SAS offers substantial ease of programming, but may suffer from performance limitations due to poor spatial locality, and high protocol overhead. In this paper, we compare the performance of and programming effort, required for six applications under both programming models on a 32 CPU PC-SMP cluster. Our application suite consists of codes that typically do not exhibit high efficiency under shared memory programming. due to their high communication to computation ratios and complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications: however, on certain classes of problems SAS performance is competitive with MPI. We also present new algorithms for improving the PC cluster performance of MPI collective operations.

Shan, Hongzhang↗
DOE OSTI2022

Electron Binding Energy Spectra of Al n Pt – Clusters—A Combined Experimental and Computational Study

Results of size-selected electron photo-detachment experiments and density functional theory calculations on anionic Al n Pt – , n = 1–7, clusters are presented and analyzed. The measured and calculated spectra of electron binding energies are, overall, in excellent accord with each other. The analysis reveals the general importance of accounting for the multiplicity of structural forms of a given-size cluster that can contribute to its measured spectrum, especially when the clusters are fluxional and/or the conditions of the experiment allow for structural transitions. Here, we show that for the systems studied here, the size-specific peculiarities of the measured spectra can be understood in terms of the combined contributions of corresponding different accessible stable equilibrium conformations, bona-fide transition-state configurations, and electronic-crossing structures that may play the role of effective barriers in electronically nonadiabatic dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Fibre Channel Development Final Report CRADA No. TC-0340-92-D

The Fibre Channel (FC) Development project was designed to enhance U.S. industrial competitiveness by accelerating the standardization and subsequent industrial acceptance of the American National Standards Institute’s (AIW) Fibre Channel Standard (now X3T1 1). It was also intended to give the principal U.S. participants a one- to two-year lead in developing heterogeneous high-speed computer networks, dktibuted computing through clustering, scientific visualization techniques, and high speed channels. The project was proposed to benefit U.S. industry as these high performance computing methods became generally available. In 1992-93, during the initial project phases, Fibre Channel PC) was emerging as a new ANSI standard. It was envisioned as becoming the mechanism for data transfer between the next generation of computers, and between these computers and their peripherals. Using this channel standard, U.S. computer vendors were expecting to be able to provide high-speed interoperability between heterogeneous computers and their storage devices, with data transfer rates greater than a GBit/sec. Our project was composed of key principal players in the FC standardization effort from both U.S. industry and the Department of Energy’s (DOES) Lawrence Liverrnore National Laboratory (LLNL). The industial participants were developing individual FC interfaces to operate with their platform products. LLNL’s role was to be a neutral testing site and a facilitator for helping to resolve conflicting interpretations of the embryonic Fibre Channel specification. LLNL anticipated that conflicts in the interpretation of such a standard would arise and require neutral resolution and that such resolutions would best be achieved in cooperation with the ANSI FC Working Group. Project plans included transferring to U.S. industry any resilient FC testing capabilities at the project conclusion.

42 ENGINEERING↗
DOE OSTI2018

Fibre Channel Development Final Report CRADA No. TC-0340-92-C

The Fibre Channel (FC) Development project was designed to enhance U.S. industrial competitiveness by accelerating the standardization and subsequent industrial acceptance of the American National Standards Institute’s (ANSI) Fibre Channel Standard (now X3T1 1). It was also intended to give the principal U.S. participants a one-to two-year lead in developing heterogeneous high-speed computer networks, distributed computing through clustering, scientific visualization techniques, and high speed channels. The project was proposed to benefit U.S. industry as these high performance computing methods became generally available. In 1992-93, during the initial project phases, Fibre Channel (FC) was emerging as a new ANSI standard. It was envisioned as becoming the mechanism for data transfer between the next generation of computers, and between these computers and their peripherals. Using this channel standard, U.S. computer vendors were expecting to be able to provide high-speed interoperatillity between heterogeneous computers and their storage devices, with data transfer rates greater than a GBit/sec. Our project was composed of key principal players in the FC standardization effort from both U.S. industry and the Department of Energy’s@OEs) Lawrence Liverrnore National Laboratory (LLNL). The industrial participants were developing individual FC interfaces to operate with their platform products. LLNL’s.role was to be a neutral testing site and a facilitator for helping to resolve conflicting interpretations of the embryonic Fibre Channel specification. LLNL anticipated that conflicts in the interpretation of such a standard would arise and require neutral resolution and that such resolutions would best be achieved in cooperation with the ANSI FC Working Group. Project plans included transferring to U.S. industry any resilient FC testing capabilities at the project conclusion.

42 ENGINEERING↗