Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Programming”

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.

148 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Optimizing Desalination Operations for Energy Flexibility

Despite the value of energy optimization in desalination processes, modeling dynamic operations for monthly billing periods has remained a computational challenge. This work proposes a framework for energy flexibility optimization, which includes new modeling features for independent operation of parallel skids, start-up delays associated with chemical stabilization, the consideration of industrial energy tariff structures, and inclusion of hourly electrical carbon intensities. This is done using a modular and computationally efficient formulation that guarantees a globally optimal solution with standard optimization solvers. In this study, the approach is demonstrated in two distinct case studies: a seawater desalination plant in Santa Barbara, CA, and an indirect potable reuse facility in San Jose, CA. Trends predicted from the model are validated against operational facility measurements from a demand response shutdown event. Preliminary results show that optimizing energy flexibility can result in 18.51% monthly cost savings over energy efficiency-optimized operation. The value extracted from a facility-wide shutdown during peak electricity price hours is hampered by start-up delays in post-treatment chemical stabilization. In cases in which a facility does not have much excess capacity, using a flow equalization tank or operating over a wide recovery range may be cost-effective.

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

Fermilab Italian Student Program (Final Report)

I participated to the 2019 Fermilab Italian Student Program under the supervision of Anadi Canepa and Lorenzo Uplegger. I worked with the Fermilab research group that is involved with the R&D of the CMS Outer Tracker. The Compact Muon Solenoid (CMS) is a a general-purpose detector located at the Large Hadron Collider (LHC), the world's most powerful particle accelerator. In the next years LHC will undergo the High-Luminosity LHC upgrade, which will bring its luminosity from 1 × 10 34 cm -2 s -1 to 1.5 × 10 34 cm -2 s -1 . This increase in luminosity will require an upgrade of CMS as well, in order to comply with the augmented rate of particles which will cross the detector. The CMS tracker is a detector, composed of various modules made of silicon pixel trackers and silicon strip trackers, whose aim is to reconstruct the trajectories of the particles produced by the collisions in LHC. The tracker is ideally divided in Inner Tracker and Outer Tracker. The HL-LHC upgrade put important challenges in the designing of the tracker. It will have to withstand the irradiation of a large fluence of particles, without suffering a too severe deterioration of its performance. In addition to this, in order to comply with the increased rate of events that CMS will need to detect, the tracker will be exploited for triggering at the fully hardware Level 1 Trigger, in contrast to the current tracker, whose data are only used for the software High-Level Trigger. This feature is managed by the "stub logic", which will be explained in chapter 2. During the months of August and September at Fermilab I carried out the data analysis of three test beam runs performed in the last two years on the 2S Outer Tracker Minimules. The 2S Minimoule consists of two silicon strip trackers placed one upon the other with the strips kept parallel.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗