Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grid 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 91 records · Page 5

Towards a centralized Grid Speedometer

Given the distributed nature of the Worldwide LHC Computing Grid and the way CPU resources are pledged and shared around the globe, Virtual Organizations (VOs) face the challenge of monitoring the use of these resources. For CMS and the operation of centralized workflows, the monitoring of how many production jobs are running and pending in the Glidein WMS production pools is very important. The Dashboard Site Status Board (SSB) provides a very flexible framework to collect, aggregate and visualize data. The CMS production monitoring team uses the SSB to define the metrics that have to be monitored and the alarms that have to be raised. During the integration of CMS production monitoring into the SSB, several enhancements to the core functionality of the SSB were required, They were implemented in a generic way, so that other VOs using the SSB can exploit them. Alongside these enhancements, there were a number of changes to the core of the SSB framework. This paper presents the details of the implementation and the advantages for current and future usage of the new features in SSB.

Dzhunov, I.↗

The pilot way to Grid resources using glideinWMS

Grid computing has become very popular in big and widespread scientific communities with high computing demands, like high energy physics. Computing resources are being distributed over many independent sites with only a thin layer of Grid middleware shared between them. This deployment model has proven to be very convenient for computing resource providers, but has introduced several problems for the users of the system, the three major being the complexity of job scheduling, the nonuniformity of computer resources, and the lack of good job monitoring. Pilot jobs address all the above problems by creating a virtual private computing pool on top of Grid resources. This paper presents both the general pilot concept, as well as a concrete implementation, called glideinWMS, deployed in the Open Science Grid.

99 GENERAL AND MISCELLANEOUS↗

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗

FTS3: Data Movement Service in containers deployed in OKD [Slides]

The File Transfer Service (FTS3) is a data movement service developed at CERN which is used to distribute the majority of the Large Hadron Collider's data across the Worldwide LHC Computing Grid (WLCG) infrastructure. At Fermilab, we have deployed a couple of FTS3 instances for Intensity Frontier experiments (e.g. DUNE) to transfer data in America and Europe, using a container-based strategy. During this talk, we are going to present the two different configurations currently running at Fermilab, comparing and contrasting a Docker-based OKD deployment against a traditional RPM-based deployment and giving an overview of the possible issues encountered. In addition, we discuss our method of certificate management and maintenance utilizing Kubernetes cronjobs.

97 MATHEMATICS AND COMPUTING↗

Evolution of the Distributed Computing Model of the CMS experiment at the LHC

The Computing Model of the CMS experiment was prepared in 2005 and described in detail in the CMS Computing Technical Design Report. With the experience of the first years of LHC data taking and with the evolution of the available technologies, the CMS Collaboration identified areas where improvements were desirable. In this work we describe the most important modifications that have been, or are being implemented in the Distributed Computing Model of CMS. The Worldwide LHC computing Grid (WLCG) project acknowledged that the whole distributed computing infrastructure is impacted by this kind of changes that are happening in most LHC experiments and decided to create several Technical Evolution Groups (TEG) aiming at assessing the situation and at developing a strategy for the future. In this work we describe the CMS view on the TEG activities as well.

Grandi, C.↗

Multiscale Modeling of Porous Medium Systems. In: Handbook of Porous Media, Third edition

The use of computers over the last 60 years for simulating subsurface “ow problems has provided an impressive, ever-expanding ability to model processes at a high resolution. Whereas in the 1960s a computational grid with 500 œxed nodes would have pushed the boundaries of computer power [59], simulations today involve millions of spatial grid points and adaptive meshes [40,57].

Dye, Amanda↗

Unit physics performance of a mix model in Eulerian fluid computations

In this report, we evaluate the performance of a K-L drag-buoyancy mix model, described in a reference study by Dimonte-Tipton [1] hereafter denoted as [D-T]. The model was implemented in an Eulerian multi-material AMR code, and the results are discussed here for a series of unit physics tests. The tests were chosen to calibrate the model coefficients against empirical data, principally from RT (Rayleigh-Taylor) and RM (Richtmyer-Meshkov) experiments, and the present results are compared to experiments and to results reported in [D-T]. Results show the Eulerian implementation of the mix model agrees well with expectations for test problems in which there is no convective flow of the mass averaged fluid, i.e., in RT mix or in the decay of homogeneous isotropic turbulence (HIT). In RM shock-driven mix, the mix layer moves through the Eulerian computational grid, and there are differences with the previous results computed in a Lagrange frame [D-T]. The differences are attributed to the mass averaged fluid motion and examined in detail. Shock and re-shock mix are not well matched simultaneously. Results are also presented and discussed regarding model sensitivity to coefficient values and to initial conditions (IC), grid convergence, and the generation of atomically mixed volume fractions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Storage Resource Manager version 2.2: Design, implementation, and testing experience

Storage Services are crucial components of the Worldwide LHC Computing Grid Infrastructure spanning more than 200 sites and serving computing and storage resources to the High Energy Physics LHC communities. Up to tens of Petabytes of data are col lected every year by the four LHC experiments at CERN. To process these large data volumes it is important to establish a protocol and a very efficient interface to the various storage solutions adopted by the WLCG sites. In this work we report on the exp erience acquired during the definition of the Storage Resource Manager v2.2 protocol. In particular, we focus on the study performed to enhance the interface and make it suitable for use by the WLCG communities. At the moment 5 different storage solutions implement the SRM v2.2 interface: BeStMan (LBNL), CASTOR (CERN and RAL), dCache (DESY and FNAL), DPM (CERN), and StoRM (INFN and ICTP). After a detailed inside review of the protocol, various test suites have been written identifying the most effective s et of tests: the S2 test suite from CERN and the SRM-Tester test suite from LBNL. Such test suites have helped verifying the consistency and coherence of the proposed protocol and validating existing implementations. We conclude our work describing the re sults achieved.

Donno, Flavia↗

Data preservation at the Fermilab Tevatron

The Fermilab Tevatron collider's data-taking run ended in September 2011, yielding a dataset with rich scientific potential. The CDF and D0 experiments each have approximately 9 PB of collider and simulated data stored on tape. A large computing infrastructure consisting of tape storage, disk cache, and distributed grid computing for physics analysis with the Tevatron data is present at Fermilab. The Fermilab Run II data preservation project intends to keep this analysis capability sustained through the year 2020 and beyond. To achieve this goal, we have implemented a system that utilizes virtualization, automated validation, and migration to new standards in both software and data storage technology and leverages resources available from currently-running experiments at Fermilab. Lastly, these efforts have also provided useful lessons in ensuring long-term data access for numerous experiments, and enable high-quality scientific output for years to come.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Data preservation at the Fermilab Tevatron

The Fermilab Tevatron collider's data-taking run ended in September 2011, yielding a dataset with rich scientific potential. The CDF and DO experiments each have nearly 9 PB of collider and simulated data stored on tape. A large computing infrastructure consisting of tape storage, disk cache, and distributed grid computing for physics analysis with the Tevatron data is present at Fermilab. The Fermilab Run II data preservation project intends to keep this analysis capability sustained through the year 2020 or beyond. To achieve this, we are implementing a system that utilizes virtualization, automated validation, and migration to new standards in both software and data storage technology as well as leveraging resources available from currently-running experiments at Fermilab. Furthermore, these efforts will provide useful lessons in ensuring long-term data access for numerous experiments throughout high-energy physics, and provide a roadmap for high-quality scientific output for years to come.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

ExaWind: Then and Now

The scientific goal of the ExaWind project is to advance our fundamental understanding of the flow physics governing whole wind plant performance, including wake formation, complex terrain impacts, and turbine-turbine-interaction effects. The primary application codes in the ExaWind environment are Nalu-Wind, an unstructured-grid computational fluid dynamics (CFD) code, AMR-Wind, a structured-grid CFD code, and OpenFAST, a whole-turbine simulation code. In this poster we present the current status of the ExaWind software stack in the context of the modeling and simulation capabilities when the project started in 2016.

computational fluid dynamics↗

ExaWind: Exascale Predictive Wind Plant Flow Physics Modeling

The scientific goal of the ExaWind project is to advance our fundamental understanding of the flow physics governing whole wind plant performance, including wake formation, complex terrain impacts, and turbine-turbine-interaction effects. The primary application codes in the ExaWind environment are Nalu-Wind, an unstructured-grid computational fluid dynamics (CFD) code, AMR-Wind, a structured-grid CFD code, and OpenFAST, a whole-turbine simulation code. In this poster we present our progress towards simulating the ExaWind challenge problem, which is a predictive simulation of a wind farm with tens of megawatt-scale wind turbines dispersed over an area of 50 square kilometers.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

GeoComputation 2009

The tremendous computing requirements of today's algorithms and the high costs of high-performance supercomputers drive us to share computing resources. The emerging computational Grid technologies are expected to make feasible the creation of a computational environment handling many PetaBytes of distributed data, tens of thousands of heterogeneous computing resources, and thousands of simultaneous users from multiple research institutions.

97 MATHEMATICS AND COMPUTING↗

Grids and Society - Chaired by Ian Bird

An audience question and answer session regarding the LHC computing grid. Panel members addressed whether the grid would ultimately be useful in the commercial world (industry) as well as data and cybersecurity.

Source record↗

Emulation of seismic-phase traveltimes with machine learning

SUMMARY We present a machine learning (ML) method for emulating seismic-phase traveltimes that are computed using a global-scale 3-D earth model and physics-based ray tracing. Accurate traveltime predictions based on 3-D earth models are known to reduce the bias of event location estimates, increase our ability to assign phase labels to seismic detections and associate detections to events. However, practical use of 3-D models is challenged by slow computational speed and the unwieldiness of pre-computed lookup tables that are often large and have prescribed computational grids. In this work, we train a ML emulator using pre-computed traveltimes, resulting in a compact and computationally fast way to approximate traveltimes that are based on a 3-D earth model. Our model is trained using approximately 850 million P-wave traveltimes that are based on the global LLNL-G3D-JPS model, which was developed for more accurate event location. The training-set consists of traveltimes between 10 393 global seismic stations and randomly sampled event locations that provide a prescribed, distance-dependent geographic sample density for each station. Prediction accuracy is dependent on event-station distance and whether the station was included in the training set. For stations included in the training set the mean absolute deviation (MAD) of the difference between traveltimes computed using ray tracing through the 3-D model and the ML emulator for local, regional, and teleseismic distances are 0.090, 0.125 and 0.121 s, respectively. For tested station locations not included in the training set, MAD values for the three distance ranges increase to 0.173, 0.219 and 0.210 s, respectively. Empirical traveltime residuals for a global reference data are indistinguishable when ML emulation or the 3-D model is used to compute traveltimes. This result holds regardless of whether the recording station is used in ML training or not.

58 GEOSCIENCES↗

DOE site remedial management optimization utilizing on the cloud computing systems - 15676

Environmental cleanups at complex sites necessarily address many competing demands and answer questions such as: 'What is the best way and in a sustainable manner to minimize risk to human health and the environment during active restoration efforts and/or long term legacy management, while incorporating parameter uncertainty, management considerations, and stakeholder concerns into the process?' Physics Based Management Optimization (PBMO{sup TM}) provides a means to answer such questions. 'Physics Based' indicates incorporation of numerically computed groundwater flow and transport processes into the analysis. This enables optimal remedy design based on comprehensive mass removal/destruction metrics and optimal monitoring strategies. 'Management Optimization' indicates the ability to incorporate objective functions (e.g., management constraints, sustainability considerations) into the evaluation. PBMO{sup TM} components have been successfully implemented for optimal plume delineation (points of compliance) and monitoring, for optimal system design and to optimize existing active treatment systems in the US at multiple DOE, DOD and industrial sites since the mid 1990's. PBMO{sup TM} has been recently extended and implemented on multi-core, multi-CPU grid computing systems including computational clusters, local area networks and the Cloud. This extension allows for increased flexibility and adaptation of computational resources which can now support optimal remedy design and long term management strategies for complex soil and groundwater sites. In the PBMO{sup TM} -Grid case study, we evaluate flow and transport for a typical optimization search for a realistic project against sequential optimization. PBMO{sup TM}-Grid reduces the CPU time required to solve the optimization problem by more than a factor of 14 X compared to sequential optimization. PBMO{sup TM}-Grid can be deployed for deterministic or stochastic optimization and formally computes design risk and predicted degree of remedial action success. The numerical models used can consist of a single 'mega' model (aka a monolith), or a mixture of models and other calculations or expert systems. PBMO{sup T}M-Grid integrates the computational models in a seamless manner, and models run on the Cloud can be implemented in Windows or Linux platforms. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Practical Implementation of GPU-based Computing at the Grid Edge for Resilience Scenarios

This paper presents a practical implementation of GPU-accelerated computing at the grid edge to enhance power system resilience through next-generation smart meters. Advanced Metering Infrastructure (AMI) systems rely predominantly on centralized processing architectures, which limit real-time response capabilities during grid disturbances. This work proposes the integration of GPU-enabled computational platforms directly within smart meter to enable local execution support for power system analytics, fault detection algorithms, and optimization routines. The proposed framework uses the Julia programming language to leverage highperformance parallel computing capabilities while maintaining code portability and development efficiency. We use two experimental scenarios to benchmark the computational feasibility of this approach: sparse linear system solutions representative of power flow analyses, and multi-stage production cost simulations incorporating unit commitment and economic dispatch operations. Results demonstrate that computationally intensive power system algorithms, such as those supporting resilience scenario calculations, can be effectively executed at the distribution edge using commercially available embedded GPU hardware. Keywords—GPU acceleration, edge computing, smart meters, grid resilience, AMI, resilience.

De Souza, Reubun [School of Electrical Engineering↗